Approximate parallel scheduling: Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time
Journal Article
·
· SIAM J. Comput.; (United States)
The authors define a novel scheduling problem; it is solved in parallel by repeated, rapid, approximate reschedulings. This leads to the first optimal logarithmic time PRAM algorithm for list ranking. Companion papers show how to apply these results to obtain improved PRAM upper bounds for a variety of problems on graphs, including the following: connectivity, biconnectivity, Euler tour and st-numbering, and a number of problems on trees.
- Research Organization:
- Courant Institute of Mathematical Sciences, New York Univ., New York, NY (US)
- OSTI ID:
- 7020008
- Journal Information:
- SIAM J. Comput.; (United States), Vol. 17:1
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems
Efficient algorithms for list ranking and for solving graph problems on the hypercube
Techniques for the design of parallel graph algorithms
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:7020008
Efficient algorithms for list ranking and for solving graph problems on the hypercube
Journal Article
·
Mon Jan 01 00:00:00 EST 1990
· IEEE Transactions on Parallel and Distributed Systems; (USA)
·
OSTI ID:7020008
Techniques for the design of parallel graph algorithms
Miscellaneous
·
Sun Jan 01 00:00:00 EST 1989
·
OSTI ID:7020008