BibSonomy :: publication :: A Scalable Lock-free Stack Algorithm

BibSonomy :: publication :: A Scalable Lock-free Stack Algorithm

This publication has not been reviewed yet.

rating distribution

average user rating

?

The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.

(0.0 of 5.0 based on 0 reviews)

Show internal link to this resource

?

You can use this internal link to create references to this post in your discussions. Just copy this internal link and paste it in your discussion text.

Please log in to take part in the discussion (add own reviews or comments).

No matching items.

A Scalable Lock-free Stack Algorithm
Danny Hendler, Nir Shavit, and Lena Yerushalmi. Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, page 206--215. New York, NY, USA, ACM, (2004)
Danny Hendler, Nir Shavit, and Lena Yerushalmi. Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, page 206--215. New York, NY, USA, ACM, (2004)
9 months ago
by gron
2
Array Concurrent Elimination LockFree Scalable Stack
(0)
URL DOI TeX
A scalable lock-free stack algorithm.
Danny Hendler, Nir Shavit, and Lena Yerushalmi. SPAA, page 206-215. ACM, (2004)
Danny Hendler, Nir Shavit, and Lena Yerushalmi. SPAA, page 206-215. ACM, (2004)
7 years ago
by dblp
2
- dblp
dblp
(0)
URLDOITeX
⟨⟨⟨1⟩⟩⟩

BibSonomy is offered by the KDE group of the University of Kassel, the DMIR group of the University of Würzburg, and the L3S Research Center, Germany. Privacy & Terms of Use - Contact