Filters








22,561 Hits in 5.6 sec

A Concurrency-Optimal Binary Search Tree [article]

Vitaly Aksenov and Vincent Gramoli and Petr Kuznetsov and Anna Malova and Srivatsan Ravi
2017 arXiv   pre-print
The paper presents the first concurrency-optimal implementation of a binary search tree (BST).  ...  To ensure this property, we use a novel read-write locking scheme that protects tree edges in addition to nodes.  ...  Thus, a concurrency-optimal implementation accepts all correct (LS-linearizable) schedules. A concurrency-optimal binary search tree.  ... 
arXiv:1702.04441v3 fatcat:7jabpiesljh2hjrbgtqcftgneq

A Concurrency-Optimal Binary Search Tree [chapter]

Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi
2017 Lecture Notes in Computer Science  
The paper presents the first concurrency-optimal implementation of a binary search tree (BST).  ...  To ensure this property, we use a novel read-write locking scheme that protects tree edges in addition to nodes.  ...  Thus, a concurrency-optimal implementation accepts all correct (LS-linearizable) schedules. A concurrency-optimal binary search tree.  ... 
doi:10.1007/978-3-319-64203-1_42 fatcat:ywsglklzyngo5acewlmrzltdli

DeltaTree

Ibrahim Umar, Otto Johan Anshus, Phuong Hoai Ha
2015 Performance Evaluation Review  
We present DeltaTree, a practical locality-aware concurrent search tree that integrates both locality-optimization techniques from vEB-based trees, and concurrency-optimization techniques from highly-concurrent  ...  search trees.  ...  Lemma 2 . 1 . 21 For any upper bound UB on the unknown memory block size B, a search in a complete binary tree with the concurrency-aware vEB layout achieves the optimal memory transfer O(log B N ), where  ... 
doi:10.1145/2796314.2745891 fatcat:yfbpco5m3vbezkgxaxyebytode

GreenBST: Energy-Efficient Concurrent Search Tree [chapter]

Ibrahim Umar, Otto Anshus, Phuong Ha
2016 Lecture Notes in Computer Science  
such as the non-blocking binary search trees do not consider data locality.  ...  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  ...  concurrent search tree lock-based EPFL binary tree 6 DeltaTree [36] Locality aware concurrent search tree lock-based U.  ... 
doi:10.1007/978-3-319-43659-3_37 fatcat:fcoolwijevda3lvvb7ow4x4zaq

Comparing parallel performance of Go and C++ TBB on a direct acyclic task graph using a dynamic programming problem

Doug Serfass, Peiyi Tang
2012 Proceedings of the 50th Annual Southeast Regional Conference on - ACM-SE '12  
We utilized these mechanisms to implement a parallel version of the optimal binary search tree dynamic programming algorithm in Go and TBB.  ...  Both implementations tile the iteration space and construct and evaluate a direct acyclic task graph for optimal parallelism without over constraints.  ...  Then, the average search time of a key in the tree is n i=1 lipi. The problem is to build an optimal binary search tree where this search cost is minimized.  ... 
doi:10.1145/2184512.2184575 dblp:conf/ACMse/SerfassT12 fatcat:zdbbvfecgffj5f3m47723wzunq

Improving efficacy of internal binary search trees using local recovery

Arunmoezhi Ramachandran, Neeraj Mittal
2016 Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16  
Many algorithms-blocking as well as nonblocking-have been proposed for concurrent manipulation of a binary search tree in an asynchronous shared memory system that supports search, insert and delete operations  ...  Our approach is sufficiently general in the sense that it can be applied to a variety of concurrent binary search trees based on both blocking and non-blocking approaches.  ...  In this work, we present a general approach to recover locally in a concurrent binary search tree based on internal representation.  ... 
doi:10.1145/2851141.2851173 dblp:conf/ppopp/RamachandranM16 fatcat:y6zss5n65rddrdq4ggnsyhxqni

Page 8069 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
In a randomly grown binary search tree (BST) of size n, any fixed pattern occurs with a frequency that is on average proportional to n.  ...  Secondly, if K is the largest integer such that all possible shapes of subtrees of cardinality less than or equal to K occur in a random binary search tree, then we show that K ~ logn/loglogn in probability  ... 

A speculation-friendly binary search tree

Tyler Crain, Vincent Gramoli, Michel Raynal
2018 Concurrency and Computation  
We introduce the first binary search tree algorithm designed for speculative executions.  ...  En effet, un programmeur a seulement besoin d'insérer des opérations dans des transactions afin d'obtenir un programme concurrent correct.  ...  Therefore, the programmer of a concurrent application that builds upon this binary search tree library must be aware of the synchronization internals of this library (including the growth optimization)  ... 
doi:10.1002/cpe.4883 fatcat:fuorlkdbkzh6jfy3cx7raowqia

A speculation-friendly binary search tree

Tyler Crain, Vincent Gramoli, Michel Raynal
2012 Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming - PPoPP '12  
We introduce the first binary search tree algorithm designed for speculative executions.  ...  En effet, un programmeur a seulement besoin d'insérer des opérations dans des transactions afin d'obtenir un programme concurrent correct.  ...  Therefore, the programmer of a concurrent application that builds upon this binary search tree library must be aware of the synchronization internals of this library (including the growth optimization)  ... 
doi:10.1145/2145816.2145837 dblp:conf/ppopp/CrainGR12 fatcat:absxr4kbd5acroyui4u7x7rqj4

A speculation-friendly binary search tree

Tyler Crain, Vincent Gramoli, Michel Raynal
2012 SIGPLAN notices  
We introduce the first binary search tree algorithm designed for speculative executions.  ...  En effet, un programmeur a seulement besoin d'insérer des opérations dans des transactions afin d'obtenir un programme concurrent correct.  ...  Therefore, the programmer of a concurrent application that builds upon this binary search tree library must be aware of the synchronization internals of this library (including the growth optimization)  ... 
doi:10.1145/2370036.2145837 fatcat:s3bnjddlsjcejly5rqdjmgoznq

Page 6230 of Mathematical Reviews Vol. , Issue 96j [page]

1996 Mathematical Reviews  
New Brunswick, NJ) Weighted binary trees for concurrent searching.  ...  Our results include efficient algorithms for constructing binary search trees having near optimal k-cost.  ... 

Page 7829 of Mathematical Reviews Vol. , Issue 2003j [page]

2003 Mathematical Reviews  
binary comparison search trees.  ...  Summary: “We present an O(n*)-time algorithm for the following problem: Given a set of items with known access frequencies, find the optimal binary search tree under the realistic assumption that each  ... 

Page 3610 of Mathematical Reviews Vol. , Issue 2000e [page]

2000 Mathematical Reviews  
[Sun, Ming] Constructing optimal search trees in optimal time. (English summary) IEEE Trans. Comput. 48 (1999), no. 7, 738-743. Summary: “(a,b)-trees are an important class of search trees.  ...  We show that a space-minimum (a, b)-tree is also height-minimum and present an optimal algorithm for constructing (a, b)-trees that are height-minimum and space-minimum.  ... 

Page 1905 of Mathematical Reviews Vol. 57, Issue 5 [page]

1979 Mathematical Reviews  
The authors define ternary search trees on a partially ordered set (or a quasi-ordered set) as generalizations of the binary search trees on a linearly ordered set.  ...  Balanced binary trees allow the execution of each such opera- tion in O(log n) steps. After a neat presentation of the problem, the authors review various families of balanced binary trees.  ... 

Contention Adapting Search Trees

Konstantinos Sagonas, Kjell Winblad
2015 2015 14th International Symposium on Parallel and Distributed Computing  
We use this approach to create a contention adapting binary search tree (CA tree) that can be used to implement concurrent ordered sets and maps.  ...  In short, we propose a practically useful and easy to implement and show correct concurrent search tree that naturally adapts to the level of contention. statLock(base.lock); 11 if (base.valid == false  ...  Such an estimate does not make sense in a binary search tree where the threads are not distributed evenly.  ... 
doi:10.1109/ispdc.2015.32 dblp:conf/ispdc/SagonasW15 fatcat:qefbbsx2p5bczg2cikslyingjq
« Previous Showing results 1 — 15 out of 22,561 results