Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
IEEE Transactions on Computers
Programming cellular permutation networks through decomposition of symmetric groups
IEEE Transactions on Computers
A New Benes Network Control Algorithm
IEEE Transactions on Computers
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
A Markov chain approximation for the analysis of banyan networks
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
ATM networks (2nd ed.): concepts, protocols, applications
ATM networks (2nd ed.): concepts, protocols, applications
Performance Analysis of Finite-Buffered Asynchronous Multistage Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Journal of the ACM (JACM)
Interconnection Networks for Parallel and Distributed Processing
Interconnection Networks for Parallel and Distributed Processing
Reconfiguration with Time Division Multiplexed MIN's for Multiprocessor Communications
IEEE Transactions on Parallel and Distributed Systems
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Study of multistage SIMD interconnection networks
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Nonlockability in Multirings and Hypercubes at Serial Transmission of Data Blocks
Automation and Remote Control
A "Single-Box" Re-routing Architecture for a 3-Stage Rearrangeable CLOS Interconnection Networks
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
IEEE Transactions on Parallel and Distributed Systems
Routing Permutations on Baseline Networks with Node-Disjoint Paths
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
In this paper, we present an algorithm for performing permutations of messages on multistage interconnection networks. Permutations of messages are needed in many parallel algorithms. The proposed algorithm is feasible for any networks that can connect each input to each output using a set of $N$ nonblocking connections, where $N$ is the number of ports on the network. Messages are segmented into $N$ submessages that are sent independently in each time step. For any permutation, the settings of switches are changed with fixed patterns. Partitioning of the network into independent subnetworks is also supported, each capable of simultaneously routing a different permutation.