[concurrency-interest] Queue quest

√iktor Ҡlang viktor.klang at gmail.com
Mon Apr 14 08:31:23 EDT 2014


boolean offer(T t) - i.e. non-blockingly either adds t or not, depending on
available capacity.
On Apr 14, 2014 2:14 PM, "Oleksandr Otenko" <oleksandr.otenko at oracle.com>
wrote:

>  What do you mean, when you combine in one sentence "non-blocking" and
> "bounded"?
>
> Alex
>
> On 08/04/2014 14:38, √iktor Ҡlang wrote:
>
> Hey everyone,
>
>  I thought I'd throw this question out there before I go all out NIH.
>
>  Does anybody know of an open source (apache 2 compatible) "minimal
> overhead", non-blocking, bounded, non-constant-space (i.e. no ringbuffer or
> preallocated size array) multiple-producer
> single-consumer/multiple-consumer queues in Java/bytecode?
>
>
>
>  --
>  Cheers,
>>
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20140414/91ccdbd2/attachment.html>


More information about the Concurrency-interest mailing list