Efficient hypercube algorithms
Multicomputers are intended to run application programs that are too large or require too many hours of computation to run on a single processor computer. The hypercube is a widely used topology for the interconnection of multicomputers. This thesis investigates the programming issues that arise when one uses an MIMD hypercube multicomputer. To illustrate these issues, the connected components problem is used. The proposed connected components algorithm proves to be efficient on a hypercube multicomputer. Two hypercube algorithms to find the biconnected components of a connected undirected graph are also described and experimentally evaluated on an NCUBE/7 MIMD hypercube computer. Load balancing is one of the important issues to achieve efficient use of a multicomputer. New approaches for load balancing on a hypercube multicomputer are proposed and analyzed.
- Research Organization:
- Minnesota Univ., Minneapolis, MN (USA)
- OSTI ID:
- 5923909
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient algorithms for list ranking and for solving graph problems on the hypercube
First and second generation hypercube performance