On Tue, 24 Oct 2006, hemant wrote:

> On 10/23/06, Francis Cianfrocca <garbagecat10 / gmail.com> wrote:
>> On 10/23/06, Patrick Hurley <phurley / gmail.com> wrote:
>> >
>> > Hey Chris,
>> >
>> > Thanks for the continued interest and work on stompserver, I am on my
>> > way home and will be helping out soon. I will give a big thumbs up to
>> > using the file system. It is actually where I was planning on going,
>> > but used Madeleine because it was faster to get started.
>> >
>> > Another approach that I am planning on investigating is on using mmap
>> > (based on a discussion and idea I while talking with Daniel Berger at
>> > RubyConf) to provide a circular queue space -- this should be very
>> > efficient and simple enough to implement -- until the allocated queue
>> > is full. Then special logic and handling or an expensive resize would
>> > be required.
>> >
>> > pth
>> >
>> >
>> 
>> mmap and circular space: I have an implementation of that. It's fast as
>> bloody hell, but it's also (unfortunately) a compiled Ruby extension. Let
>> me know if you want to play with it when you get home. If you like it,
>> maybe you can convert it to pure Ruby without losing too much performance.
>> One of the keys to performance is fixed-length record-buffers, which means
>> there's no record-table. All lookups are O(1).
>
> Send it across Franics, I would be delighted to check it.

hi hemant-

can you elaborate on your requirements?  eg, what kind of objects are being
put into the queue?  is it fifo, lifo, priority based, etc?  how big are the
objects?  how many of them?  do they timeout or grow stale?

cheers.


-a
-- 
my religion is very simple.  my religion is kindness. -- the dalai lama