From: Young Hyun <youngh@...>
Date: 2007-10-17T05:03:43+09:00
Subject: Re: Rinda::TupleBag

On Oct 15, 2007, at 9:29 AM, Alex V. Breger wrote:

> In the current version of Ruby
> (http://svn.ruby-lang.org/repos/ruby/trunk/lib/rinda/tuplespace.rb)
> Rinda::TupleBag is implemented with hash by tuple size and then  
> with array.
> This realization is simple and fast on very small amount of data (e.g.
> on writing), but
> scales very bad in reading and searching.
>
> How can it be rewritten?
> May be other realizations of tuplespaces are more scalable and fast?
> Is there any attempts to make faster the standard version?

I'm working on creating a faster tuple space implementation called  
Marinda that is completely independent of Rinda, though it won't be  
ready for release in the near future.  All the tuple space  
functionality is implemented, and I'm using it in a production  
setting, but the scalable tuple space matching algorithm isn't  
implemented (which is the main reason why I haven't released it  
yet).  A scalable algorithm is challenging, but it should be more  
doable with my implementation than in Rinda since I restrict tuples  
to be values rather than allowing object references (via DRb) like  
Rinda does.  I'm currently reading the literature for some insights  
on a suitable algorithm.  Unfortunately, I have a number of things to  
work on so implementing a scalable algorithm is lower down in my  
priorities.  Anyway, for details on the design, see my talk slides at

   http://www.caida.org/publications/presentations/2007/ 
young_ark_syslunch/

  --Young