DocumentCode
2512679
Title
A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network
Author
Kim, Kichul ; Raghavendra, C.S.
Author_Institution
Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
fYear
1991
fDate
30 Apr-2 May 1991
Firstpage
398
Lastpage
403
Abstract
The authors present a simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. Their algorithm is based on balanced matrices and does not require any backtracking. This property is useful when pipelining is used with a single stage network and recirculation of data
Keywords
multiprocessor interconnection networks; parallel processing; 8-input 5-stage shuffle/exchange network; algorithm; balanced matrices; route arbitrary permutations; Genetic mutations; Parallel processing; Pipeline processing; Routing; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1991. Proceedings., Fifth International
Conference_Location
Anaheim, CA
Print_ISBN
0-8186-9167-0
Type
conf
DOI
10.1109/IPPS.1991.153810
Filename
153810
Link To Document