Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms (1996) [7 citations — 0 self]
http://www.research.ibm.com/people/m/michael/podc-
http://www.cs.pdx.edu/~walpole/class/cs510/papers/
ftp://ftp.cs.rochester.edu/pub/u/michael/PODC96.ps
http://hypatia.dcs.qmw.ac.uk/data/edu/cs.rochester
http://www.cogsci.rochester.edu/u/scott/papers/199
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Maged M. Michael and Michael L. Scott},
title = {Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms},
booktitle = {Proc. 15th ACM Symp. on Principles of Distributed Computing},
year = {1996},
pages = {267--275}
}
Bookmarks
OpenURL
Abstract:
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed concurrently. Both algorithms are simple, fast, and practical; we were surprised not to find them in the literature. Experiments on a 12-node SGI Challenge multiprocessor indicate that the new non-blocking queue consistently outperforms the best known alternatives; it is the clear algorithm of choice for machines that provide a universal atomic primitive (e.g. compare and swap or load linked/store conditional). The two-lock concurrent queue outperforms a single lock when several processes are competing simultaneously for access; it appears to be the algorithm of choice for busy queues on machines with non-universal atomic primitives (e.g. test and set). Since much of the motivation for non-blocking algorithms is rooted in their immunity to large, unpredictable delays in process execution,we report experimental ...
Citations
No citations identified.
