Fast concurrent lock-free binary search trees

Natarajan, Aravind; Mittal, Neeraj

doi:10.1145/2555243.2555256

Cited by 135 publications

(42 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The design of the LFkD-tree is based on the lock-free BST of Natarajan et al [9]. To perform an iterative scan, we implement an ecient fully non-recursive traversal using parent links, which is not available in [9].…”

Section: A High-level Summary Of the Workmentioning

confidence: 99%

“…To perform an iterative scan, we implement an ecient fully non-recursive traversal using parent links, which is not available in [9].…”

Section: A High-level Summary Of the Workmentioning

confidence: 99%

“…Consequently, we describe the NNS operations independently and comprehensively. Other operations in the LFkD-tree, which are very similar to the same in lock-free BST of [9], are described at a high level in the main paper and their detail discussion is included in Appendix C.…”

Section: A High-level Summary Of the Workmentioning

confidence: 99%

See 2 more Smart Citations

Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree

Chatterjee

Walulya

Tsigas

2018

Proceedings of the 19th International Conference on Distributed Computing and Networking

View full text Add to dashboard Cite

The Nearest neighbour search (NNS) is an important problem in a large number of application domains dealing with multidimensional data. In concurrent settings, where dynamic modications are allowed, a linearizable implementation of NNS is highly desirable to discover the latest nearest neighbour of a given target data-point.In this paper, we introduce the LockFree-kD-tree (LFkD-tree): a lock-free concurrent kD-tree, which implements an abstract data type (ADT) that provides the operations Add, Remove, Contains, and NNS. Our implementation is linearizable. The operations in the LFkDtree use single-word read and compare-and-swap (CAS) atomic primitives, which are readily supported on commonly available multi-core processors. We experimentally evaluate the LFkD-tree using several benchmarks comprising real-world and synthetic datasets. The experiments show that the presented design is scalable and achieves signicant speed-up compared to the implementations of an existing sequential kD-tree and a recently proposed multidimensional indexing structure, PH-tree.

show abstract

Section: A High-level Summary Of the Workmentioning

confidence: 99%

“…To perform an iterative scan, we implement an ecient fully non-recursive traversal using parent links, which is not available in [9].…”

Section: A High-level Summary Of the Workmentioning

confidence: 99%

See 1 more Smart Citation

Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree

Chatterjee

Walulya

Tsigas

2018

Proceedings of the 19th International Conference on Distributed Computing and Networking

View full text Add to dashboard Cite

show abstract

“…? ?CBTree [28] LFBST [30] BSTTK [13] DeltaTree [36] 100% 95% 90% 80% 50% [28] LFBST [30] BSTTK [13] DeltaTree [36] Fig. 1: Result of 5 millions tree operations of decreasing search percentage workloads using 12 cores (1 CPU).…”

Section: Introductionmentioning

confidence: 99%

“…Concurrent B-trees (e.g., B-link tree [28]) only perform well if their B size is optimal. Highly concurrent search trees such as non-blocking concurrent search trees [14,30] and Software Transactional Memory (STM)-based search trees [1,11], however, do not take into account fine-grained data locality.…”

Section: Introductionmentioning

confidence: 99%

GreenBST: Energy-Efficient Concurrent Search Tree

Umar

Anshus

2016

Euro-Par 2016: Parallel Processing

View full text Add to dashboard Cite

Abstract. Like other fundamental abstractions for energy-efficient computing, search trees need to support both high concurrency and finegrained data locality. However, existing locality-aware search trees such as ones based on the van Emde Boas layout (vEB-based trees), poorly support concurrent (update) operations while existing highly-concurrent search trees such as the non-blocking binary search trees do not consider data locality. We present GreenBST, a practical energy-efficient concurrent search tree that supports fine-grained data locality as vEB-based trees do, but unlike vEB-based trees, GreenBST supports high concurrency. GreenBST is a k-ary leaf-oriented tree of GNodes where each GNode is a fixed size tree-container with the van Emde Boas layout. As a result, GreenBST minimizes data transfer between memory levels while supporting highly concurrent (update) operations. Our experimental evaluation using the recent implementation of non-blocking binary search trees, highly concurrent B-trees, conventional vEB trees, as well as the portably scalable concurrent trees shows that GreenBST is efficient: its energy efficiency (in operations/Joule) and throughput (in operations/second) are up to 65% and 69% higher, respectively, than the other trees on a high performance computing (HPC) platform (Intel Xeon), an embedded platform (ARM), and an accelerator platform (Intel Xeon Phi). The results also provide insights into how to develop energy-efficient data structures in general.

show abstract

A multi‐granularity locking scheme for java packedobjects based on a concurrent multiway tree

Yang

Kent

Aubanel

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary In this paper, we develop a multi‐granularity locking scheme for Java PackedObjects, an experimental enhancement introduced in IBM's J9 Java Virtual Machine. The packed object model organizes data in a multi‐tier manner in which object data can be nested in the container object instead of being pointed to by an object reference, as in the traditional Java object model. This new object data model creates new challenges for multi‐tier data synchronization, requiring concurrent locks on the multi‐tier data of different granularities for maintaining consistency. This is different from the traditional Java synchronization model. In this paper we make use of a concurrent multiway tree to represent the containing and ordering relationship between PackedObjects at different tiers and develop an efficient multi‐granularity locking scheme allowing multiple threads to concurrently manipulate the concurrent multiway tree for synchronization operations. In the evaluation, we compare our new tree‐based multitierSync with the previous multitierSync approaches based on linked‐lists (optimized‐list‐based and lazy‐list‐based). The experimental results show that the tree‐based MultitierPackedSync outperforms the list‐based approaches considerably in different workloads, and the higher the workload, the better the performance gains achieved by the tree‐based MultitierPackedSync.

show abstract

Fast concurrent lock-free binary search trees

Cited by 135 publications

References 27 publications

Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree

Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree

GreenBST: Energy-Efficient Concurrent Search Tree

A multi‐granularity locking scheme for java packedobjects based on a concurrent multiway tree

Contact Info

Product

Resources

About