[concurrency-interest] Concurrent Queue implementation
takeshi10 at gmail.com
Wed Jun 10 12:57:26 EDT 2009
theres also the ConcurrentLinkedQueue which is a lock-free unbounded
queue - although its 'poll' methods returns null in the absense of
On Wed, Jun 10, 2009 at 1:29 PM, Joe Bowbeer<joe.bowbeer at gmail.com> wrote:
> On Wed, Jun 10, 2009 at 9:00 AM, Vishal Byakod wrote:
>> I am working on prototyping an embedded Message server and wanted to
>> know which queue implementation would suit the best.
>> The requirement is for a in-memory queue which will allow concurrent
>> puts and gets from the queue.
>> Any ideas and suggestions would be appreciated.
> Check out the BlockingQueue implementations, such as ArrayBlockingQueue and
> Note that take = get.
> Concurrency-interest mailing list
> Concurrency-interest at cs.oswego.edu
Marcelo Takeshi Fukushima
More information about the Concurrency-interest