DocumentCode :
1973356
Title :
On a class of (2n-1)-stage rearrangeable interconnection networks
Author :
Hsia, J. Calvin ; Chen, C.Y.R.
Author_Institution :
Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA
fYear :
1989
fDate :
2-4 Oct 1989
Firstpage :
452
Lastpage :
455
Abstract :
A class of (2n-1)-stage rearrangeable multistage interconnection networks (MINs) that includes all the previously proposed 2n-1 stage MINs as special cases or subsets is proposed. Both permutation routing and generalized distributed tag routing algorithms of this class of MINs are proposed. It is shown that previously proposed routing algorithms for some specific rearrangeable networks are just special cases of the general routing algorithm
Keywords :
multiprocessor interconnection networks; (2n-1)-stage rearrangeable multistage interconnection networks; MINs; distributed tag routing algorithms; permutation routing; Automata; Broadcasting; Distributed computing; Genetic mutations; Multiprocessor interconnection networks; Network topology; Routing; Scanning probe microscopy;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Design: VLSI in Computers and Processors, 1989. ICCD '89. Proceedings., 1989 IEEE International Conference on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-8186-1971-6
Type :
conf
DOI :
10.1109/ICCD.1989.63407
Filename :
63407
Link To Document :
بازگشت