CAS-Based Lock-Free Algorithm for Shared Deques

@inproceedings{Michael2003CASBasedLA,
  title={CAS-Based Lock-Free Algorithm for Shared Deques},
  author={Maged M. Michael},
  booktitle={Euro-Par},
  year={2003}
}
This paper presents the first lock-free algorithm for shared double-ended queues (deques) based on the single-address atomic primitives CAS (Compare-and-Swap) or LL/SC (Load-Linked and StoreConditional). The algorithm can use single-word primitives, if the maximum deque size is static. To allow the deque’s size to be dynamic, the algorithm employs single-address double-width primitives. Prior lockfree algorithms for shared deques depend on the strong DCAS (DoubleCompare-and-Swap) atomic… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

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

Lock-free deques and doubly linked lists

J. Parallel Distrib. Comput. • 2008
View 8 Excerpts
Highly Influenced

An Unbounded Nonblocking Double-Ended Queue

2016 45th International Conference on Parallel Processing (ICPP) • 2016
View 4 Excerpts
Highly Influenced

Built-in Coloring for Highly-Concurrent Doubly-Linked Lists

Theory of Computing Systems • 2012
View 5 Excerpts
Highly Influenced

A Novel N-Retry Transactional Memory Model for Multi-Thread Programming

2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC) • 2017
View 1 Excerpt

Similar Papers

Loading similar papers…