DocumentCode
1142990
Title
The Reverse-Exchange Interconnection Network
Author
Wu, Chuan-lin ; Feng, Tse-yun
Author_Institution
Department of Computer Science, Wright State University
Issue
9
fYear
1980
Firstpage
801
Lastpage
811
Abstract
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.
Keywords
Admissible permutations; baseline network; multiple-pass realization; multistage interconnection networks; parallel processing systems; permutation network; reconfiguration; recursive control algorithm; reverse-exchange network; routing techniques; Computer science; Control systems; Costs; Intelligent networks; Multiprocessor interconnection networks; Parallel processing; Routing; Admissible permutations; baseline network; multiple-pass realization; multistage interconnection networks; parallel processing systems; permutation network; reconfiguration; recursive control algorithm; reverse-exchange network; routing techniques;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1980.1675679
Filename
1675679
Link To Document