DocumentCode :
2626668
Title :
Scalable architectures with k-ary n-cube cluster-c organization
Author :
Basak, Debashis ; Panda, Dhabaleswar K.
Author_Institution :
Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
fYear :
1993
fDate :
1-4 Dec 1993
Firstpage :
780
Lastpage :
787
Abstract :
Recent advancements in VLSI and packaging technologies demonstrate attractiveness in building scalable parallel systems using clustered configurations while exploiting communication locality. Clustered architectures using buses or MINs as the inter-cluster interconnection do not satisfy both the above objectives. This paper proposes a new class of k-ary n-cube cluster-c scalable architectures by combining the scalability of k-ary n-cube wormhole-routed networks with the cost-effectiveness of processor cluster designs. This paper focuses on direct cluster interconnection. The interplay between various system parameters and routing schemes are analyzed to determine optimal configurations under the constant bisection bandwidth constraint. Our analysis indicates that small sized clusters with a ring intra-cluster topology and a 2D/3D/4D inter-cluster network connecting these clusters offer best system performance
Keywords :
multiprocessor interconnection networks; parallel architectures; clustered configurations; communication locality; constant bisection bandwidth constraint; direct cluster interconnection; inter-cluster interconnection; k-ary n-cube cluster-c scalable architectures; k-ary n-cube wormhole-routed networks; processor cluster designs; scalable parallel systems; Bandwidth; Buildings; Joining processes; Network topology; Packaging; Performance analysis; Process design; Routing; Scalability; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-4222-X
Type :
conf
DOI :
10.1109/SPDP.1993.395453
Filename :
395453
Link To Document :
بازگشت