On a Class of Multistage Interconnection Networks
- 1 August 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-29 (8) , 694-702
- https://doi.org/10.1109/tc.1980.1675651
Abstract
A baseline network and a configuration concept are introduced to evaluate relationships among some proposed multistage interconnection networks. It is proven that the data manipulator (modified version), flip network, omega network, indirect binary n-cube network, and regular SW banyan network (S = F = 2) are topologically equivalent. The configuration concept facilitates developing a homogeneous routing algorithm which allows one-to-one and one- to-many connections from an arbitrary side of a network to the other side. This routing algorithm is extended to full communication which allows connections between terminals on the same side of a network. A conflict resolution scheme is also included. Some practical implications of our results are presented for further research.Keywords
This publication has 10 references indexed in Scilit:
- Study of multistage SIMD interconnection networksPublished by Association for Computing Machinery (ACM) ,1978
- Interconnection Networks from Three State CellsIEEE Transactions on Computers, 1977
- The Indirect Binary n-Cube Microprocessor ArrayIEEE Transactions on Computers, 1977
- Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address MasksIEEE Transactions on Computers, 1977
- A large scale, homogeneous, fully distributed parallel machine, IPublished by Association for Computing Machinery (ACM) ,1977
- 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
- Interconnection networksPublished by Association for Computing Machinery (ACM) ,1974
- Banyan networks for partitioning multiprocessor systemsPublished by Association for Computing Machinery (ACM) ,1973
- On a Class of Rearrangeable Switching Networks Part I: Control AlgorithmBell System Technical Journal, 1971