A non-blocking internal binary search tree

Howley, Shane V.; Jones, Jeremy

doi:10.1145/2312005.2312036

Cited by 75 publications

(51 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, removing a node from an internal BST is costly, more so in a concurrent setting [8,10]. With this in mind, we opt for an external BST representation [7,9] to design the LFkD-tree.…”

Section: A High-level Summary Of the Workmentioning

confidence: 99%

“…We input the pointers to the current leaf-node and its parent along with the AABB described by its two corners. The rst step is to nd the direction of the current sub-tree and then decide whether the other sub-tree of the parent is visited or not, see lines 8,11 and 12. Basically we check whether the axis-orthogonal hyperplane associated with the parent node is beyond the AABB.…”

Section: C3 the Helping Stepsmentioning

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

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%

Section: C3 the Helping Stepsmentioning

confidence: 99%

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

“…All three used the cooperative technique originated by Turek, Shasha and Prakash [31] and Barnes [4]. Howley and Jones [20] used a similar approach to build node-oriented BSTs. They tested their implementation using a model checker, but did not prove it correct.…”

Section: Related Workmentioning

confidence: 99%

A general technique for non-blocking trees

2014

View full text Add to dashboard Cite

Abstract. We describe a general technique for obtaining provably correct, non-blocking implementations of a large class of tree data structures where pointers are directed from parents to children. Updates are permitted to modify any contiguous portion of the tree atomically. Our non-blocking algorithms make use of the LLX, SCX and VLX primitives, which are multi-word generalizations of the standard LL, SC and VL primitives and have been implemented from single-word CAS [10]. To illustrate our technique, we describe how it can be used in a fairly straightforward way to obtain a non-blocking implementation of a chromatic tree, which is a relaxed variant of a red-black tree. The height of the tree at any time is O(c + log n), where n is the number of keys and c is the number of updates in progress. We provide an experimental performance analysis which demonstrates that our Java implementation of a chromatic tree rivals, and often significantly outperforms, other leading concurrent dictionaries.

show abstract

“…At each step of the traversal, search(v) chooses the child according to the appropriate bit of v (line 82). The search(v) stops if it reaches an internal node whose label is not a prefix of v. We show 20) if I = null and help(I) then return true…”

Section: Detailed Description Of Algorithmsmentioning

confidence: 99%

Non-blocking Patricia Tries with Replace Operations

Shafiei

2013

2013 IEEE 33rd International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

Abstract-This paper presents a non-blocking Patricia trie implementation for an asynchronous shared-memory system using Compare&Swap. The trie implements a linearizable set and supports three update operations: insert adds an element, delete removes an element and replace replaces one element by another. The replace operation is interesting because it changes two different locations of tree atomically. If all update operations modify different parts of the trie, they run completely concurrently. The implementation also supports a wait-free find operation, which only reads shared memory and never changes the data structure. Empirically, we compare our algorithms to some existing set implementations.

show abstract

A non-blocking internal binary search tree

Cited by 75 publications

References 11 publications

Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree

Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree

A general technique for non-blocking trees

Non-blocking Patricia Tries with Replace Operations

Contact Info

Product

Resources

About