Book ChapterDOI
A Relaxed Balanced Lock-Free Binary Search Tree
Manish Kumar Singh,Lindsay Groves,Alex Potanin +2 more
- pp 304-317
TLDR
In this article, a relaxed balanced concurrent binary search tree using a single word compare and swap primitive is presented, which separates balancing actions from update operations and includes a lock-free balancing mechanism in addition to the insert, search, and relaxed delete operations.Abstract:
This paper presents a new relaxed balanced concurrent binary search tree using a single word compare and swap primitive, in which all operations are lock-free. Our design separates balancing actions from update operations and includes a lock-free balancing mechanism in addition to the insert, search, and relaxed delete operations. Search in our design is not affected by ongoing concurrent update operations or by the movement of nodes by tree restructuring operations. Our experiments show that our algorithm performs better than other state-of-the-art concurrent BSTs.read more
References
More filters
Book
The Art of Multiprocessor Programming
TL;DR: Transactional memory as discussed by the authors is a computational model in which threads synchronize by optimistic, lock-free transactions, and there is a growing community of researchers working on both software and hardware support for this approach.
Practical lock-freedom
TL;DR: This dissertation introduces and evaluates practical abstractions and data structures that facilitate the development of large-scale lock-free systems and presents an implementation of two useful abstractions that make it easier to develop arbitrary lock- free data structures.
Book ChapterDOI
A Pragmatic Implementation of Non-blocking Linked-Lists
TL;DR: This work presents a new non-blocking implementation of concurrent linked-lists supporting linearizable insertion and deletion operations, conceptually simpler and substantially faster than previous schemes.
Proceedings ArticleDOI
A practical concurrent binary search tree
TL;DR: Experimental evidence shows that the proposed concurrent relaxed balance AVL tree algorithm outperforms a highly tuned concurrent skip list for many access patterns, with an average of 39% higher single- threaded throughput and 32% higher multi-threaded throughput over a range of contention levels and operation mixes.
Proceedings ArticleDOI
A method for implementing lock-free shared-data structures
TL;DR: This work presents a technique that provides the semantics of exclusive access to data without using mutual exclusion, and devise the caching method, a general method of implementing lock-free data structures that is provably better than Herlihy's methodology for many weIl-known data structures.