Feature #8128

New primitives for Rinda::TupleSpace

Added by Joel VanderWerf about 1 year ago. Updated about 1 year ago.

[ruby-core:53557]
Status:Rejected
Priority:Normal
Assignee:Masatoshi Seki
Category:lib
Target version:-

Description

=begin

= New primitives for Rinda::TupleSpace

This issue proposes adding two new primitives to TupleSpace for atomic bulk operations:

== 1. TupleSpace#replace_all

=== What it does

Calling

replaceall(tuple, newtuple, sec=nil)

atomically removes all tuples matching ((|tuple|)) and writes ((|new_tuple|)). It does not block waiting for tuples. The return value is a pair:

[ matching_tuples, entry ]

where ((|matchingtuples|)) is like the return value of (({readall(tuple)})) and
((|entry|)) is like the return value of (({write(new_tuple)})).

=== Why it is needed

It is not possible to do this atomically with existing primitives. As noted in ((The dRuby Book)), p. 176, "It isn't easy to represent a dictionary using TupleSpace." Essentially, the #[]= and #[] operations must take/write a global lock tuple.

Using #replace_all, it is easy to implement a key-value store without lock tuples. See key-value-store.rb for an example.

=== Modularity

The new code is entirely contained in two modules in a single separate file. These modules are included/extended to TupleSpace and TupleSpaceProxy as desired to add the replace_all functionality.

=== Examples

See key-value-store.rb and example-replace-all.rb.

== 2. TupleSpace#take_all

=== What it does

Calling

take_all(tuple)

atomically removes all matching tuples. It does not block waiting for tuples. The return value is the array of tuples, like the return value of (({read_all(tuple)})).

=== Why it is needed

It is not possible to do this atomically with existing primitives, though in this case atomicity may not be important. More importantly, it is not possible to do this efficiently with existing primitives. The best approximation would be an unbounded sequence of #take calls.

=== Modularity

The new code is entirely contained in two modules in a single separate file. These modules are included/extended to TupleSpace and TupleSpaceProxy as desired to add the take_all functionality.

=== Examples

See example-take-all.rb.

=end

replace-all.rb Magnifier (1.59 KB) Joel VanderWerf, 03/20/2013 08:00 AM

take-all.rb Magnifier (961 Bytes) Joel VanderWerf, 03/20/2013 08:00 AM

example-replace-all.rb Magnifier (910 Bytes) Joel VanderWerf, 03/20/2013 08:00 AM

example-take-all.rb Magnifier (813 Bytes) Joel VanderWerf, 03/20/2013 08:00 AM

key-value-store.rb Magnifier (1.13 KB) Joel VanderWerf, 03/20/2013 08:00 AM

History

#1 Updated by Hiroshi SHIBATA about 1 year ago

  • Assignee set to Masatoshi Seki

#2 Updated by Eric Hodel about 1 year ago

  • Status changed from Open to Assigned
  • Priority changed from Low to Normal

A TupleSpace isn't designed for these types of operations, see: http://www.lindaspaces.com/book/ (the TupleSpace book).

#3 Updated by Masatoshi Seki about 1 year ago

  • Status changed from Assigned to Rejected

I think so: https://twitter.com/drbrain/status/315510564233293825

This is a global lock. If you want a KVS, I recommend the Hash or Drip.

#4 Updated by Joel VanderWerf about 1 year ago

You are right: it is best to leave these extensions out of trunk. I can maintain them separately.

However, some clarifications:

  • the proposed #takeall and #replaceall operations do not block. They are like #read_all in that respect.

  • #read_all is not one of the original Linda primitives, either, AFAICT. (Yet, I cannot imagine using linda/rinda without it :)

Thanks for all your excellent work on distributed ruby, Eric and Masatoshi. Cheers!

Also available in: Atom PDF