Title :
On the hierarchical hypercube interconnection network
Author :
Q.M. Malluhi;M.A. Bayoumi;T.R.N. Rao
Author_Institution :
Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA
fDate :
6/15/1905 12:00:00 AM
Abstract :
The paper explores the hierarchical hypercube (HHC) interconnection network, suitable for building massively parallel systems with thousands of processors. HHC is self-embedded, that is, an HHC can embed HHCs of lower dimensions. In addition, HHC is a communication-efficient architecture. Two algorithms for data communication in the HHC are presented. The first algorithm is for one-to-one transfer and the second is for one-to-all broadcasting. Both algorithms take O(log k), where, k is the total number of processors in the system. Moreover, the paper shows that the HHC VLSI layout has a relatively small area which is O((log log k).k/sup 2//log k).
Keywords :
"Hypercubes","Multiprocessor interconnection networks","Network topology","Broadcasting","Very large scale integration","Computer networks","Concurrent computing","Artificial intelligence","Scalability","Tides"
Conference_Titel :
Parallel Processing Symposium, 1993., Proceedings of Seventh International
Print_ISBN :
0-8186-3442-1
DOI :
10.1109/IPPS.1993.262822
