[concurrency-interest] Quest for the optimal queue

√iktor Ҡlang viktor.klang at gmail.com
Fri May 11 11:00:21 EDT 2012


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
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20120511/54246ee1/attachment.html>


More information about the Concurrency-interest mailing list