Computing minimum spanning trees on a fat-tree architecture. Master's thesis
Technical Report
·
OSTI ID:6042728
This paper presents two parallel algorithms for computing the minimum spanning forest of an input graph on a fat-tree architecture. One algorithm is deterministic, and the other probabilistic. The deterministic algorithm generates O(cv log/V/) message sets, each of which can be delivered in O(beta (G) delivery cycles. The probabilistic algorithm generates O(sq log/V/) message sets, each of which can be delivered in O(beta(G)) delivery cycles.
- Research Organization:
- Massachusetts Inst. of Tech., Cambridge (USA). Dept. of Electrical Engineering and Computer Science
- OSTI ID:
- 6042728
- Report Number(s):
- AD-A-161434/6/XAB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Randomized routing on fat trees. Interim research report
Improving minimum cost spanning trees by upgrading nodes
Increasing the weight of minimum spanning trees
Technical Report
·
Thu May 01 00:00:00 EDT 1986
·
OSTI ID:6978668
Improving minimum cost spanning trees by upgrading nodes
Technical Report
·
Sat Oct 31 23:00:00 EST 1998
·
OSTI ID:677151
Increasing the weight of minimum spanning trees
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416839