[concurrency-interest] Quest for the optimal queue

Nathan Reynolds nathan.reynolds at oracle.com
Fri May 11 13:55:46 EDT 2012


I've heard of disruptor and they have some results comparing it against 
ArrayBlockingQueue.  
http://code.google.com/p/disruptor/wiki/PerformanceResults  I don't know 
how it would compare against ConcurrentLinkedQueue.

Nathan Reynolds 
<http://psr.us.oracle.com/wiki/index.php/User:Nathan_Reynolds> | 
Consulting Member of Technical Staff | 602.333.9091
Oracle PSR Engineering <http://psr.us.oracle.com/> | Server Technology

On 5/11/2012 8:00 AM, √iktor Ҡlang wrote:
> Hey guys,
>
> I'd like to explore alternatives to ConcurrentLinkedQueue, especially 
> to get a bit lower latency and perhaps even lower mem usage.
>
> Behavior:
> No locks
> Unbounded
> Single consumer
> Multiple producers
>
> Operations:
>
> dequeue
> enqueue
> numberOfMessages // Would be nice to have as a constant, can be linear 
> or simply not supported, doesn't really matter
> hasMessages // Just a Boolean if there's anything in there at all, 
> only needs to return true if something has been put in that hasn't 
> been pulled out yet
>
> Is there anything out there which is better than CLQ?
>
> Cheers,
>>
> -- 
> Viktor Klang
>
> Akka Tech Lead
> Typesafe <http://www.typesafe.com/>- The software stack for 
> applications that scale
>
> Twitter: @viktorklang
>
>
>
> _______________________________________________
> Concurrency-interest mailing list
> Concurrency-interest at cs.oswego.edu
> http://cs.oswego.edu/mailman/listinfo/concurrency-interest
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20120511/55467e2e/attachment.html>


More information about the Concurrency-interest mailing list