DocumentCode :
3335619
Title :
Uni-directional cube-connected cycles
Author :
Bhattacharya, Sourav ; Choi, Yoon-Hwa ; Tsai, Wei-Tek
Author_Institution :
Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
fYear :
1991
fDate :
1-2 Mar 1991
Firstpage :
266
Lastpage :
271
Abstract :
Cube connected cycles (CCC), a popular and layout/efficient alternative to hypercube, can emulate the performance of hypercube for many parallel algorithms. Recently, interconnection networks based on simplex links rather than duplex have been proposed. The uni-directional architectures have layout advantages and reduces complexity of each processing element (PE). The authors propose directed cube connected cycles (DCCC) as a uni-directional alternative to CCC. They have developed PE-to-PE routing algorithm for DCCC. A method for porting algorithms (designed to run on bi-directional CCC) to DCCC is provided. The extent of slowdown due to using simplex links is evaluated. They also provide loop embedding on DCCC. DCCC is found competitive to CCC in algorithmic performance though DCCC is much layout inexpensive
Keywords :
VLSI; circuit layout CAD; multiprocessor interconnection networks; parallel algorithms; PE-to-PE routing algorithm; VLSI layout; directed cube connected cycles; interconnection networks; loop embedding; porting algorithms; simplex links; uni-directional architectures; Algorithm design and analysis; Bidirectional control; Computer architecture; Computer science; Hypercubes; Parallel algorithms; Routing; Sorting; Topology; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
VLSI, 1991. Proceedings., First Great Lakes Symposium on
Conference_Location :
Kalamazoo, MI
Print_ISBN :
0-8186-2170-2
Type :
conf
DOI :
10.1109/GLSV.1991.143977
Filename :
143977
Link To Document :
بازگشت