Cache-aware lock-free queues for multiple producers/consumers and weak memory consistency

Authors:
Anders Gidenstam;Håkan Sundell;Philippas Tsigas
Affiliations:
School of Business and Informatics, University of Borås, Borås, Sweden;School of Business and Informatics, University of Borås, Borås, Sweden;Department of Computer Science and Engineering, Chalmers University of Technology, Göteborg, Sweden
Venue:
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Year:
2010

Citing 11
Cited 3

Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
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
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects

IEEE Transactions on Parallel and Distributed Systems
Using elimination to implement scalable and lock-free FIFO queues

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Impact of Instruction Re-Ordering on the Correctness of Shared-Memory Programs

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
FastForward for efficient pipeline parallelism: a cache-optimized concurrent lock-free queue

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
NOBLE: non-blocking programming support via lock-free shared abstract data types

ACM SIGARCH Computer Architecture News
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

IEEE Transactions on Parallel and Distributed Systems
The baskets queue

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems

Progress guarantees when composing lock-free objects

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
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
Understanding the performance of concurrent data structures on graphics processors

Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A lock-free FIFO queue data structure is presented in this paper. The algorithm supports multiple producers and multiple consumers and weak memory models. It has been designed to be cache-aware and work directly on weak memory models. It utilizes the cache behavior in concert with lazy updates of shared data, and a dynamic lock-free memory management scheme to decrease unnecessary synchronization and increase performance. Experiments on an 8- way multi-core platform show significantly better performance for the new algorithm compared to previous fast lock-free algorithms.