DocumentCode :
3351766
Title :
Regular CC-banyan networks
Author :
Kim, Dong W. ; Lipovski, G. Jack ; Hartmann, A. ; Jenevein, R.
Author_Institution :
Texas Univ., Austin, TX, USA
fYear :
1988
fDate :
30 May-2 Jun 1988
Firstpage :
325
Lastpage :
332
Abstract :
Construction algorithms for rectangular and nonrectangular CC-banyan networks, as well as routing algorithms for double-ended and single-ended rectangular and nonrectangular CC-banyan networks, are presented. The time complexities of the routing algorithms are O(l ), where l is the number of stages in the network
Keywords :
computational complexity; multiprocessor interconnection networks; CC-banyan networks; construction algorithms; routing algorithms; Fault tolerance; Hardware; Labeling; Lifting equipment; Multiprocessing systems; Routing; Switches; Telecommunication traffic; Terminology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Architecture, 1988. Conference Proceedings. 15th Annual International Symposium on
Conference_Location :
Honolulu, HI
Print_ISBN :
0-8186-0861-7
Type :
conf
DOI :
10.1109/ISCA.1988.5243
Filename :
5243
Link To Document :
بازگشت