This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
August 1980 (vol. 29 no. 8)
pp. 694-702
null Chuan-Lin Wu, Department of Computer Science, Wright State University
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.
Index Terms:
SIMD machine, Array processing, computer architecture, conflict resolution, interconnection networks, MIMD machine, multiple- processor systems, network configurations, parallel processing, routing techniques
Citation:
null Chuan-Lin Wu, null Tse-Yun Feng, "On a Class of Multistage Interconnection Networks," IEEE Transactions on Computers, vol. 29, no. 8, pp. 694-702, Aug. 1980, doi:10.1109/TC.1980.1675651
Usage of this product signifies your acceptance of the Terms of Use.