On the Design of Efficient Multistage Interconnection Networks

Authors:
Yashovardhan R. Potlapalli;Dharma P. Agrawal
Affiliations:
-;-
Venue:
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Year:
1996

Citing 8
Cited 0

Generalized schemes for access and alignment of data in parallel processors with self-routing interconnection networks

Journal of Parallel and Distributed Computing
Design of nonequivalent self-routing networks based on a matrix model

Journal of Parallel and Distributed Computing
Universal multistage networks via linear permutations

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Self-routing algorithms for strongly regular multistage interconnection networks

Journal of Parallel and Distributed Computing
Design and performance of multipath MIN architectures

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations

IEEE Transactions on Computers
Graph Theoretical Analysis and Design of Multistage Interconnection Networks

IEEE Transactions on Computers
Design and Performance of Generalized Interconnection Networks

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.