论文信息 - On the design of efficient multistage interconnection networks

On the design of efficient multistage interconnection networks

We present an algorithm that characterizes the set of permutations realizable in a single pass by a buddy-type MIN. We use the algorithm to develop a procedure that defines a buddy-type network which will realize a given set of permutations in a single pass through the network. We also present an algorithm to define a biped-type network which realizes a given set of permutations in a single pass. This algorithm is useful when the set of permutations cannot be realized by any buddy-type network in a single pass.

Dharma P. Agrawal | Yashovardhan R. Potlapalli

[1] Dharma P. Agrawal,et al. Graph Theoretical Analysis and Design of Multistage Interconnection Networks , 1983, IEEE Transactions on Computers.

[2] Jacques Lenfant,et al. Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations , 1978, IEEE Transactions on Computers.

[3] Dharma P. Agrawal,et al. Design and Performance of Generalized Interconnection Networks , 1983, IEEE Transactions on Computers.

[4] Cauligi S. Raghavendra,et al. Generalized Schemes for Access and Alignment of Data in Parallel Processors with Self-Routing Interconnection Networks , 1991, J. Parallel Distributed Comput..

[5] Frederic T. Chong,et al. Design and performance of multipath MIN architectures , 1992, SPAA '92.

[6] P. Navaneethan,et al. Design of Nonequivalent Self-Routing Networks Based on a Matrix Model , 1991, J. Parallel Distributed Comput..

[7] Subir Bandyopadhyay,et al. Self-Routing Algorithms for Strongly Regular Multistage Interconnection Networks , 1992, J. Parallel Distributed Comput..

[8] Elaine M. Jacobson,et al. Universal multistage networks via linear permutations , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).