DocumentCode
1695863
Title
On the design of efficient multistage interconnection networks
Author
Potlapalli, Yashovardhan R. ; Agrawal, Dharma P.
Author_Institution
Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA
fYear
1996
Firstpage
140
Lastpage
144
Abstract
We present an algorithm that characterizes the set of permutations realizable in a single pass by a buddy-type MIN. We use the algorithm to develop a procedure that defines a buddy-type network which will realize a given set of permutations in a single pass through the network. We also present an algorithm to define a biped-type network which realizes a given set of permutations in a single pass. This algorithm is useful when the set of permutations cannot be realized by any buddy-type network in a single pass
Keywords
multistage interconnection networks; algorithm; biped-type network; buddy-type network; efficient multistage interconnection network design; permutations; single pass; Algorithm design and analysis; Computer networks; Delay; Fault tolerance; Genetic mutations; Multiprocessor interconnection networks; Partitioning algorithms; Switches; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1996. MASCOTS '96., Proceedings of the Fourth International Workshop on
Conference_Location
San Jose, CA
Print_ISBN
0-8186-7235-8
Type
conf
DOI
10.1109/MASCOT.1996.501007
Filename
501007
Link To Document