Finding level-ancestors in trees
Journal of Computer and System Sciences
On the parallel time complexity of undirected connectivity and minimum spanning trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Incomparability in parallel computation
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Parallel image processing with the block data parallel architecture
IBM Journal of Research and Development
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
Theoretical Computer Science
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up
Theory of Computing Systems
| Hi-index | 0.00 |
We study two parallel scheduling problems and their use in designing parallel algorithms. First, we define a novel scheduling problem; it is solved by repeated, rapid, approximate reschedulings. This leads to a first optimal PRAM algorithm for list ranking, which runs in logarithmic time. Our second scheduling result is for computing prefix sums of logn bit numbers. We give an optimal parallel algorithm for the problem which runs in sublogarithmic time. These two scheduling results together lead to logarithmic time PRAM algorithms for the connectivity, biconnectivity and minimum spanning tree problems. The connectivity and biconnectivity algorithms are optimal unless m = o(nlog*n), in graphs of n vertices and m edges.