Just Join for Parallel Ordered Sets

@article{Blelloch2016JustJF,
  title={Just Join for Parallel Ordered Sets},
  author={G. Blelloch and Daniel Ferizovic and Y. Sun},
  journal={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures},
  year={2016}
}
Ordered sets (and maps when data is associated with each key) are one of the most important and useful data types. The set-set functions union, intersection and difference are particularly useful in certain applications. Brown and Tarjan first described an algorithm for these functions, based on 2-3 trees, that meet the optimal Θ(m log (n/m+1)) time bounds in the comparison model (n and m ≤ n are the input sizes). Later Adams showed very elegant algorithms for the functions, and others, based… Expand
32 Citations
Proposal : Parallel Balanced Binary Trees Using Just Join
  • Highly Influenced
  • PDF
Implementing parallel and concurrent tree structures
  • 1
  • PDF
Parallel Working-Set Search Structures
  • 4
  • PDF
PAM: parallel augmented maps
  • 24
  • PDF
Parallel Range and Segment Queries with Augmented Maps
  • 6
Parallel Range, Segment and Rectangle Queries with Augmented Maps
  • 3
  • PDF
Optimal Multithreaded Batch-Parallel 2-3 Trees
  • W. Q. Lim
  • Computer Science, Mathematics
  • ArXiv
  • 2019
  • 1
  • PDF
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem
  • PDF
Optimal Parallel Algorithms in the Binary-Forking Model
  • 12
  • PDF
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model
  • 3
  • PDF
...
1
2
3
4
...

References

SHOWING 1-3 OF 3 REFERENCES
Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates
  • 26
  • Highly Influential
Fast Parallel Operations on Search Trees
  • 19
  • Highly Influential
  • PDF
Parallelization of Bulk Operations for STL Dictionaries
  • 21
  • Highly Influential
  • PDF