Optimizing communication routing in parallel computer architectures.

摘要

This thesis is a research effort to improve on existing algorithms for processor placement and routing on hypercube and 2d-transputer parallel architectures that perform communications through message propagation. Given a set of processors N, randomly distributed on the parallel computer network, the problem is to find an optimal communication routing that minimizes the number of required links and intermediate processors. It was concluded that the spanning tree is the best starting heuristic for the routing problem. For hypercubes an algorithm was developed that outperforms all algorithms in the literature. For 2d-transputers the method of overlap maximization used in VLSI routing, resulted in near optimum solutions.