[concurrency-interest] Concurrent stack

Guy Korland gkorland at gmail.com
Fri Jan 23 03:26:48 EST 2009


Hi,

There's a work called "D. Hendler, N. Shavit, and L. Yerushalmi. A Scalable
Lock-Free Stack
Algorithm<http://www.cs.tau.ac.il/%7Eshanir/nir-pubs-web/Papers/Lock_Free.pdf>
".
It provides a much more scalable solution based on an elimination array and
still provides a proved linearizable stack.

Guy

On Fri, Jan 23, 2009 at 12:26 AM, Jim Andreou <jim.andreou at gmail.com> wrote:

> It's already there: SynchronousQueue.
>
> put() for push
> take() for pop
>
> Ok, this is cheating, but without synchronization (like in Stack, i.e.
> sequential pushs and pops), you have no defined order to expect anyway.
>
> Dimitris
>
> 2009/1/23 Guy Korland <gkorland at gmail.com>
>
>> Hi,
>>
>> Are there any plans to add the concurrent package a concurrent stack?
>> The current implementation exists as part of the JRE is a synchronized.
>> While there're few well known algorithms for non-blocking stack.
>>
>> --
>> Guy Korland
>>
>> _______________________________________________
>> Concurrency-interest mailing list
>> Concurrency-interest at cs.oswego.edu
>> http://cs.oswego.edu/mailman/listinfo/concurrency-interest
>>
>>
>


-- 
Guy Korland
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20090123/3524d134/attachment.html>


More information about the Concurrency-interest mailing list