Interconnection networks: improved routing methods for Clos and Benes networks

Thesis/Dissertation · Thu Jan 01 04:00:00 EST 1987

OSTI ID:6445478

Carpinelli, J D

Interconnection networks for use by multiprocessor systems are optimal in terms of area, but the routing algorithms used to set up these networks are suboptimal. This work improves routing on these networks using a four-fold approach. First, routing is examined in the matrix-decomposition domain; the new characteristic of partitioning is used to improve current algorithms in this class and to develop an algorithm that does not require backtracking. Second, edge coloring and matching on bipartite multigraphs are applied to routing on Clos networks. The regularity of the bipartite multigraph for routing applications is exploited to optimize a more-general edge-coloring algorithm. Third, double-coset decomposition is used to identify new properties of Benes networks and speed up routing for some permutations. Finally, the Tree-Connected Computer is used to parallelize the Looping Algorithm and reduce the setup time for Benes networks by a factor of O(lgN). It is also used to reduce the bandwidth requirements for the fastest current setup algorithm for the Complementary Benes network.

• Research Organization: Rensselaer Polytechnic Inst., Troy, NY (USA)
• OSTI ID: 6445478
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMPUTER NETWORKS
MATHEMATICAL LOGIC
PARALLEL PROCESSING
PROGRAMMING
ROUTING