The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1980 vol.29)
pp: 777-791
D.K. Pradhan , School of Engineering, Oakland University
ABSTRACT
A switching theoretic framework for the study of interconnection networks is developed. An equivalence relationship between networks is defined. Single-stage and multistage networks that are particularly useful for single-instruction multiple-data stream (SIMD) machines are studied. It is shown that the networks form two distinct equivalence classes under this definition of equivalence relationship. It is shown that any multistage network can be easily modified to realize the permutations that are admissible by any other network which is equivalent to it.
INDEX TERMS
unscrambling of p-ordered vectors, Banyan network, bit-reversal permutation, equivalent networks, flip networks, indirect binary n-cube, Omega network, perfect-shuffle permutations, single-stage networks, switching functions, uniform shift network
CITATION
D.K. Pradhan, K.L. Kodandapani, "A Uniform Representation of Single-and Multistage Interconnection Networks Used in SIMD Machines", IEEE Transactions on Computers, vol.29, no. 9, pp. 777-791, September 1980, doi:10.1109/TC.1980.1675677
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool