Wait-free linked-lists

Authors:
Shahar Timnat;Anastasia Braginsky;Alex Kogan;Erez Petrank
Affiliations:
Technion, Israel Institute of Technology, Haifa, Israel;Technion, Israel Institute of Technology, Haifa, Israel;Technion, Israel Institute of Technology, Haifa, Israel;Technion, Israel Institute of Technology, Haifa, Israel
Venue:
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Year:
2012

Citing 9
Cited 2

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
High performance dynamic lock-free hash tables and list-based sets

Proceedings of the fourteenth 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
Lock-free linked lists and skip lists

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The Art of Multiprocessor Programming

The Art of Multiprocessor Programming
Wait-free queues with multiple enqueuers and dequeuers

Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
A highly-efficient wait-free universal construction

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
A methodology for creating fast wait-free data structures

Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming

A methodology for creating fast wait-free data structures

Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
The balancing act of choosing nonblocking features

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

Abstract

The linked-list data structure is fundamental and ubiquitous. Lock-free versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has been open. In this work we designed such a linked-list. To achieve better performance, we have also extended this design using the fast-path-slow-path methodology. The resulting implementation achieves performance which is competitive with that of Harris's lock-free list, while still guaranteeing non-starvation via wait-freedom. We have also developed a proof for the correctness and the wait-freedom of our design.