Optimal Parallel Algorithms in the Binary-Forking Model
2020
In this paper we develop optimal algorithms in the binary-forking model for a variety of fundamental problems, including sorting, semisorting, list ranking, tree contraction, range minima, and ordered set union, intersection and difference. In the binary-forking model, tasks can only fork into two child tasks, but can do so recursively and asynchronously. The tasks share memory, supporting reads, writes and test-and-sets. Costs are measured in terms of work (total number of instructions), and span (longest dependence chain).
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
67
References
0
Citations
NaN
KQI