Practical, Fast and Simple Concurrent FIFO Queues Using Single Word Synchronization Primitives

Authors:
Claude Evéquoz
Affiliations:
University of Applied Sciences Western Switzerland, Yverdon-les-Bains, Switzerland CH-1400
Venue:
Ada-Europe '08 Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies
Year:
2008

Citing 14
Cited 0

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Testing and verifying concurrent objects

Journal of Parallel and Distributed Computing - Special issue on parallel I/O systems
Lock-free linked lists using compare-and-swap

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors

Journal of Parallel and Distributed Computing
A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Lock-free reference counting

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
High performance dynamic lock-free hash tables and list-based sets

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Obstruction-Free Synchronization: Double-Ended Queues as an Example

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A Practical Nonblocking Queue Algorithm Using Compare-and-Swap

ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems
Correction of a Memory Management Method for Lock-Free Data Structures

Correction of a Memory Management Method for Lock-Free Data Structures
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects

IEEE Transactions on Parallel and Distributed Systems
Bringing practical lock-free synchronization to 64-bit applications

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient and practical non-blocking implementation of a concurrent array-based FIFO queue that is suitable for preemptive multi threaded systems. It is well known that concurrent FIFO queues relying on mutual exclusion cause blocking, which have several drawbacks and degrade overall system performance. Link-based non-blocking queue algorithms have a memory management problem whereby a removed node from the queue can neither be freed nor reused because other threads may still be accessing the node. Existing solutions to this problem introduce a fair amount of overhead and are shown to be less efficient compared to array-based algorithms, which inherently do not suffer from this problem. In addition to being independent in advance knowledge of the number of threads that can access the queue, our new algorithm improves on previously proposed algorithms in that it does not re quire any special instruction other than a load-linked/store-conditional atomic instruction operating on pointer-wide number of bits.