Implementing Lock-Free Queues

@inproceedings{Valois1994ImplementingLQ,
  title={Implementing Lock-Free Queues},
  author={John D. Valois},
  year={1994}
}
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 238 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

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

238 Citations

01020'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 238 citations based on the available data.

See our FAQ for additional information.

References

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
Highly Influential
8 Excerpts

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

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