Dynamic-sized lockfree data structures

Authors:
Maurice Herlihy;Victor Luchangco;Paul Martin;Mark Moir
Affiliations:
Computer Science Department, Brown University, Providence, RI;Sun Microsystems Laboratories, Burlington, MA;Sun Microsystems Laboratories, Burlington, MA;Sun Microsystems Laboratories, Burlington, MA
Venue:
Dynamic-sized lockfree data structures
Year:
2002

Citing 5
Cited 4

A methodology for implementing highly concurrent data objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Lock-free linked lists using compare-and-swap

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Practical implementations of non-blocking synchronization primitives

PODC '97 Proceedings of the sixteenth 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
Lock-free reference counting

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing

Work dealing

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
Lock-free reference counting

Distributed Computing - Special issue: Selected papers from PODC '01
An almost non-blocking stack

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of integrating lockfree shared data structures with standard dynamic allocation mechanisms (such as malloc and free). We have two main contributions. The first is the design and experimental analysis of two dynamic-sized lockfree FIFO queue implementations, which extend Michael and Scott's previous implementation by allowing unused memory to be freed. We compare our dynamic-sized implementations to the original on 16-processor and 64-processor multiprocessors. Our experimental results indicate that the performance penalty for making the queue dynamic-sized is modest, and is negligible when contention is not too high. These results were achieved by applying a solution to the Repeat Offender Problem (ROP), which we recently posed and solved. Our second contribution is another application of ROP solutions. Specifically, we show how to use any ROP solution to achieve a general methodology for transforming lockfree data structures that rely on garbage collection into ones that use explicit storage reclamation.