Non-blocking binary search trees

Authors:
Faith Ellen;Panagiota Fatourou;Eric Ruppert;Franck van Breugel
Affiliations:
University of Toronto, Toronto, ON, Canada;University of Crete and FORTH ICS, Heraklion, Greece;York University, Toronto, ON, Canada;York University, Toronto, ON, Canada
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 20
Cited 14

A methodology for implementing highly concurrent data structures

PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
A methodology for implementing highly concurrent data objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for implementing lock-free shared-data structures

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Lock-free linked lists using compare-and-swap

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Lock-free data structures

Lock-free data structures
Amortization results for chromatic search trees, with an application to priority queues

Journal of Computer and System Sciences
Concurrent manipulation of binary search trees

ACM Transactions on Database Systems (TODS)
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting

Journal of the ACM (JACM)
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
Software transactional memory for dynamic-sized data structures

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Scalable and lock-free concurrent dictionaries

Proceedings of the 2004 ACM symposium on Applied 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
Concurrent cache-oblivious b-trees

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Concurrent programming without locks

ACM Transactions on Computer Systems (TOCS)
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
The Art of Multiprocessor Programming

The Art of Multiprocessor Programming
A universal construction for wait-free transaction friendly data structures

Proceedings of the twenty-second 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
Concurrent tries with efficient non-blocking snapshots

Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Non-blocking k-ary search trees

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Can parallel data structures rely on automatic memory managers?

Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
A lock-free B+tree

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
A non-blocking internal binary search tree

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
CBTree: a practical concurrent self-adjusting search tree

DISC'12 Proceedings of the 26th international conference on Distributed Computing
The SkipTrie: low-depth concurrent search without rebalancing

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Pragmatic primitives for non-blocking data structures

Proceedings of the 2013 ACM symposium on Principles of distributed computing
A contention-friendly binary search tree

Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Fast concurrent lock-free binary search trees

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
A practical wait-free simulation for lock-free data structures

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
A general technique for non-blocking trees

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
Practical concurrent binary search trees via logical ordering

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the first complete implementation of a non-blocking binary search tree in an asynchronous shared-memory system using single-word compare-and-swap operations. The implementation is linearizable and tolerates any number of crash failures. Insert and Delete operations that modify different parts of the tree do not interfere with one another, so they can run completely concurrently. Find operations only perform reads of shared memory.