Sciweavers

WDAG
2004
Springer
134views Algorithms» more  WDAG 2004»
14 years 4 months ago
An Optimistic Approach to Lock-Free FIFO Queues
Abstract. First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The most effective and practical dynamic-memory concurren...
Edya Ladan-Mozes, Nir Shavit
SPAA
2005
ACM
14 years 4 months ago
Using elimination to implement scalable and lock-free FIFO queues
This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specific...
Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit