The Community for Technology Leaders
Green Image
<p>Nonblocking algorithms for concurrent objects guarantee that an object is always accessible, in contrast to blocking algorithms in which a slow or halted process can render part or all of the data structure inaccessible to other processes. A number of algorithms have been proposed for shared FIFO queues, but nonblocking implementations are few and either limit the concurrency or provide inefficient solutions. The authors present a simple and efficient nonblocking shared FIFO queue algorithm with O(n) system latency, no additional memory requirements, and enqueuing and dequeuing times independent of the size of the queue. They use the compare & swap operation as the basic synchronization primitive. They model their algorithm analytically and with a simulation, and compare its performance with that of a blocking FIFO queue. They find that the nonblocking queue has better performance if processors are occasionally slow, but worse performance if some processors are always slower than others.</p>
queueing theory; data structures; nonblocking algorithm; shared queues; compare-and-swap; concurrent objects; data structure; FIFO queue algorithm; queue; nonblocking queue; performance.

S. Prakash, T. Johnson and Y. H. Lee, "A Nonblocking Algorithm for Shared Queues Using Compare-and-Swap," in IEEE Transactions on Computers, vol. 43, no. , pp. 548-559, 1994.
84 ms
(Ver 3.3 (11022016))