Theoretical and experimental analyses of parallel combinatorial algorithms. Doctoral thesis
Technical Report
·
OSTI ID:6963697
This thesis investigates parallel algorithms for a small, but representative, subclass of graph and matrix problems. In some cases, we develop new algorithms which we analyze for theoretical efficiency. In other cases, we modify and implement existing algorithms which we analyze for practical efficiency. We show how n-node, e-edge graphs can be contracted in a manner similar to the parallel tree contraction algorithm due to Miller and Reif. We give an O((n+e)/lg n)-processor deterministic algorithm that contracts a graph in O(lg squared n) time in the EREW PRAM model.
- Research Organization:
- Massachusetts Inst. of Tech., Cambridge, MA (USA). Lab. for Computer Science
- OSTI ID:
- 6963697
- Report Number(s):
- AD-A-216407/7/XAB; MIT/LCS/TR--462
- Country of Publication:
- United States
- Language:
- English
Similar Records
Communication-efficient parallel-graph algorithms. Master's thesis
Parallel graph contraction
Communication-efficient parallel graph algorithms. Technical report
Technical Report
·
Sun Jun 01 00:00:00 EDT 1986
·
OSTI ID:6626901
Parallel graph contraction
Technical Report
·
Mon May 01 00:00:00 EDT 1989
·
OSTI ID:5145457
Communication-efficient parallel graph algorithms. Technical report
Technical Report
·
Sun Nov 30 23:00:00 EST 1986
·
OSTI ID:6488052