This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
September 1980 (vol. 29 no. 9)
pp. 801-811
null Chuan-Lin Wu, Department of Computer Science, Wright State University
Properties of the reverse-exchange interconnection network are used to develop a reconfiguration scheme and a two-pass structure for enhancing the efficiency of a class of multistage interconnection networks. Functional relationships among a class of multistage interconnection networks are first derived. According to the functional relationships, we propose a reconfiguration scheme which enables a network to accomplish various interconnection functions of other networks. Then the admissible permutations along with related recursive control algorithms of the reverse-exchange interconnection network are specified through a set of theorems. Using the reverse-exchange property, we also prove that the algorithms actually work. Finally, we prove that arbitrary permutations can be realized in two passes (or 2 ? 1og2N switching steps where N is the network size). By taking advantage of Benes network control algorithms, a way to control the two-pass structure is also developed.
Index Terms:
routing techniques, Admissible permutations, baseline network, multiple-pass realization, multistage interconnection networks, parallel processing systems, permutation network, reconfiguration, recursive control algorithm, reverse-exchange network
Citation:
null Chuan-Lin Wu, null Tse-Yun Feng, "The Reverse-Exchange Interconnection Network," IEEE Transactions on Computers, vol. 29, no. 9, pp. 801-811, Sept. 1980, doi:10.1109/TC.1980.1675679
Usage of this product signifies your acceptance of the Terms of Use.