Parallel dictionaries with local rules on AVL and brother trees

Gabarró, Jaoquim; Messeguer, Xavier

doi:10.1016/s0020-0190(98)00142-2

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One is intended to allow several reads to share nodes with a writer process, the other is based on the first one and combines parallelization techniques to implement concurrency for writes. Joaquim et al [6] got parallel dictionaries on AVL trees for insertions and deletions, by taking advantage of virtual plane waves which allows it to develop an EREW dictionary for k keys with k processors and time complexity O(logn + logk). Muralidhar Medidi and Narsingh Deo also presented such a parallel dictionary on AVL trees [7] by developing an explicit processor scheduling to avoid simultaneous reads while performing k searches.…”

Section: Related Workmentioning

confidence: 99%

Parallelize DSW Algorithm

Lin

Zhang

2019

Preprint

View full text Add to dashboard Cite

In this project, we propose a parallelized DSW algorithm, useful to periodically rebalance an arbitrary unbalanced BST. The proposed algorithm splits the tree into several subtrees and concurrently do ``Tree-to-Vine'' to these subtrees using multiple threads, and finally connects them into a complete vine; It also splits the vine into several semi-equal sized subvines and do ``Vine-to-Tree'' to these subvines using multiple threads, and combines them into a complete balanced tree. Our extensive experiments including BST generation, ``Tree-to-Vine'', and ``Vine-to-Tree'' parallelization comparisons show that this parallelized DSW algorithm performs much better compared to its counterpart sequential DSW algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

Parallelize DSW Algorithm

Lin

Zhang

2019

Preprint

View full text Add to dashboard Cite

show abstract

Fringe analysis of synchronized parallel insertion algorithms in 2–3 Trees

Baeza-Yates

Gabarró

Messeguer

2003

Theoretical Computer Science

View full text Add to dashboard Cite

The fringe analysis studies the distribution of bottom subtrees or fringe of trees under the assumption of random selection of keys, yielding an average case analysis of the fringe of trees. We a r e i n terested in the fringe analysis of the synchronized parallel insertion algorithms of Paul, Vishkin, and Wagener (PVW) on 2{3 trees. This algorithm inserts k keys with k processors into a tree of size n with time O(log n + l o g k). As the direct analysis of this algorithm is very difcult we t a c kle this problem by i n troducing a new family of algorithms, denoted MacroSplit algorithms, and our main theorem proves that two algorithms of this family, denoted MaxMacroSplit and MinMacroSplit, u pper and lower bounds the fringe of the PVW algorithm. Published papers deal with the fringe analysis of sequential algorithms and it was an open problem for parallel algorithms on search trees. We extend the fringe analysis to parallel algorithms and we get a rich mathematical structure giving new interpretations even in the sequential case. We prove that the random selection of keys generates a binomial distribution of them between leaves, that the synchronized insertions of keys can be modeled by a Markov c hain, and that the coe cients of the transition matrix of the Markov Chain are related with the expected local behavior of our algorithm. Finally, w e show that the coe cients of the power expansion of this matrix over (n+1) ;1 are the binomial transform of the expected local behavior of the algorithm.

show abstract

Parallel dictionaries with local rules on AVL and brother trees

Cited by 2 publications

References 6 publications

Parallelize DSW Algorithm

Parallelize DSW Algorithm

Fringe analysis of synchronized parallel insertion algorithms in 2–3 Trees

Contact Info

Product

Resources

About