A lock-free algorithm for concurrent bags

Authors:
Håkan Sundell;Anders Gidenstam;Marina Papatriantafilou;Philippas Tsigas
Affiliations:
University of Borås, Borås, Sweden;University of Borås, Borås, Sweden;Chalmers University of Technology, Göteborg, Sweden;Chalmers University of Technology, Göteborg, Sweden
Venue:
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Year:
2011

Citing 17
Cited 3

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)
Disjoint-access-parallel implementations of strong shared memory primitives

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Thread scheduling for multiprogrammed multiprocessors

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Specifying Concurrent Program Modules

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
A Pragmatic Implementation of Non-blocking Linked-Lists

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects

IEEE Transactions on Parallel and Distributed Systems
Lock-free linked lists and skip lists

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Using elimination to implement scalable and lock-free FIFO queues

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A dynamic-sized nonblocking work stealing deque

Distributed Computing - Special issue: DISC 04
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

IEEE Transactions on Parallel and Distributed Systems
A scalable lock-free stack algorithm

Journal of Parallel and Distributed Computing
The baskets queue

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Scalable producer-consumer pools based on elimination-diffraction trees

Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Locality-conscious lock-free linked lists

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking

SALSA: scalable and low synchronization NUMA-aware algorithm for producer-consumer pools

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Quantitative relaxation of concurrent data structures

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Distributed queues in shared memory: multicore performance and scalability through quantitative relaxation

Proceedings of the ACM International Conference on Computing Frontiers

Quantified Score

Hi-index	0.00

Visualization

Abstract

A lock-free bag data structure supporting unordered buffering is presented in this paper. The algorithm supports multiple producers and multiple consumers, as well as dynamic collection sizes. To handle concurrency efficiently, the algorithm was designed to thrive for disjoint-access-parallelism for the supported semantics. Therefore, the algorithm exploits a distributed design combined with novel techniques for handling concurrent modifications of linked lists using double marks, detection of total emptiness, and efficient memory management with hazard pointer handover. Experiments on a 24-way multi-core platform show significantly better performance for the new algorithm compared to previous algorithms of relevance.