Implementing Lock-free Queues

  title={Implementing Lock-free Queues},
  author={John D. Valois},
We study practical techniques for implementing the FIFO queue abstract data type using lock-free data structures, which synchronize the operations of concurrent processes without the use of mutual exclusion. Two new algorithms based on linked lists and arrays are presented. We also propose a new solution to the ABA problem associated with the Compare&Swap instruction. The performance of our linked list algorithm is compared several other lock-free queue implementations , as well as more… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 148 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 96 extracted citations

Scalable Room Synchronizations

Theory of Computing Systems • 2003
View 4 Excerpts
Highly Influenced

149 Citations

Citations per Year
Semantic Scholar estimates that this publication has 149 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 21 references

A simple and correct shared-queue algo- rithm using Compare-and-Swap

J. Stone
In Proceedings of Supercomputing • 1990
View 8 Excerpts
Highly Influenced

Systems programming: Coping with parallelism

R. K. Treiber
Technical Report RJ 5118, • 1986
View 4 Excerpts
Highly Influenced

Linearizability: A Correctness Condition for Concurrent Objects

ACM Trans. Program. Lang. Syst. • 1990
View 7 Excerpts
Highly Influenced

Non-blocking algorithms for concurrent data structures. Tech- nical Report TR91{002

S. Prakash, Y. Lee, T. Johnson
University of Florida, • 1991
View 1 Excerpt

Similar Papers

Loading similar papers…