Implementing Lock-Free Queues (1994)
| Venue: | In Proceedings of the Seventh International Conference on Parallel and Distributed Computing Systems, Las Vegas, NV |
| Citations: | 49 - 1 self |
BibTeX
@INPROCEEDINGS{Valois94implementinglock-free,
author = {John D. Valois},
title = {Implementing Lock-Free Queues},
booktitle = {In Proceedings of the Seventh International Conference on Parallel and Distributed Computing Systems, Las Vegas, NV},
year = {1994},
pages = {64--69}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 conventional locking techniques. 1 Introduction Concurrent access to a data structure shared among several processes must be synchronized in order to avoid conflicting updates. Conventionally this is done using mutual exclusion; processes modify the data structure only inside a critical section of code, within which the process is guaranteed exclusive access to the data structure. Typically, on a multiprocessor, critical sections are guarded with a spin-lock . We will refer to all methods using mutual ...
