A Uniform Representation of Single-and Multistage Interconnection Networks Used in SIMD Machines
- 1 September 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-29 (9) , 777-791
- https://doi.org/10.1109/tc.1980.1675677
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.Keywords
This publication has 12 references indexed in Scilit:
- Banyan networks for partitioning multiprocessor systemsPublished by Association for Computing Machinery (ACM) ,1998
- Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address MasksIEEE Transactions on Computers, 1977
- Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange NetworkIEEE Transactions on Computers, 1976
- A Shuffle-Exchange Network with Simplified ControlIEEE Transactions on Computers, 1976
- Access and Alignment of Data in an Array ProcessorIEEE Transactions on Computers, 1975
- Data Manipulating Functions in Parallel Processors and Their ImplementationsIEEE Transactions on Computers, 1974
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- The ILLIAC IV ComputerIEEE Transactions on Computers, 1968
- An Adaptation of the Fast Fourier Transform for Parallel ProcessingJournal of the ACM, 1968
- On a Theory of Boolean FunctionsJournal of the Society for Industrial and Applied Mathematics, 1959