Affiliation:
1. Carnegie Mellon University, Pittsburgh, PA, USA
2. Karlsruhe Institute of Technology, Karlsruhe, Germany
3. University of California, Riverside, CA, USA
Abstract
In this article, we show how a single function,
join
, can be used to implement parallel
balanced binary search trees
(
BSTs
) simply and efficiently. Based on
join
, our approach applies to multiple balanced tree data structures, and a variety of functions for ordered sets and maps. We describe our technique as an algorithmic framework called
join-based algorithms
. We show that the
join
function fully captures what is needed for rebalancing trees for a variety of tree algorithms, as long as the balancing scheme satisfies certain properties, which we refer to as
joinable
trees. We discuss four balancing schemes that are joinable: AVL trees, red-black trees, weight-balanced trees, and treaps. We present a variety of tree algorithms that apply to joinable trees, including
insert
,
delete
,
union
,
intersection
,
difference
,
split
,
range
,
filter
, and so on, most of them also parallel. These algorithms are generic across balancing schemes. Many algorithms are optimal in the comparison model, and we provide a general proof to show the efficiency in work for joinable trees. The algorithms are highly parallel, all with polylogarithmic span (parallel dependence). Specifically, the set-set operations
union
,
intersection
, and
difference
have work
\( O(m\log (\frac{n}{m}+1)) \)
and polylogarithmic span for input set sizes
\( n \)
and
\( m\le n \)
.
We implemented and tested our algorithms on the four balancing schemes. In general, all four schemes have quite similar performance, but the weight-balanced tree slightly outperforms the others. They have the same speedup characteristics, getting around 73
\( \times \)
speedup on 72 cores (144 hyperthreads). Experimental results also show that our implementation outperforms existing parallel implementations, and our sequential version achieves close or much better performance than the sequential merging algorithm in C++ Standard Template Library (STL) on various input sizes.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Modeling and Simulation,Software
Reference68 articles.
1. [n. d.]. TPC Benchmarks. ([n. d.]). Retrieved April 2019 from http://tpc.org/.
2. Stephen Adams. 1992. Implementing Sets Effciently in a Functional Language. Technical Report CSTR 92-10. University of Southampton.
3. Functional Pearls Efficient sets—a balancing act
4. An algorithm for the organization of information;Adelson-Velsky Georgy;USSR Academy of Sciences,1962
5. Kunal Agrawal, Jeremy T. Fineman, Kefu Lu, Brendan Sheridan, Jim Sukha, and Robert Utterback. 2014. Provably good scheduling for parallel programs that use data structures through implicit batching. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’14). 84–95.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Fast and Space-Efficient Parallel Algorithms for Influence Maximization;Proceedings of the VLDB Endowment;2023-11
2. Parallel Longest Increasing Subsequence and van Emde Boas Trees;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17