Title :
Comments on "Hierarchical cubic networks"
Author :
Yun, Sang Kyun ; Park, Kyu Ho
Author_Institution :
Dept. of Comput. Sci., Seowon Univ., Chungbuk, South Korea
fDate :
4/1/1998 12:00:00 AM
Abstract :
Ghose and Desai (1995) introduced a new interconnection for large-scale distributed memory multiprocessors called the Hierarchical Cubic Network (HCN). The HCN is topologically superior to a comparable hypercube. They also proposed optimal routing algorithms for the HCN and obtained its diameter, which is about three-fourths the diameter of a comparable hypercube. However, their routing algorithm is not distance-optimal. In this paper, we propose an optimal routing algorithm for the HCN and show that HCN has about two-thirds the diameter of a comparable hypercube.
Keywords :
distributed memory systems; hypercube networks; multiprocessor interconnection networks; Hierarchical Cubic Network; distributed memory multiprocessors; hypercube; interconnection; optimal routing algorithm; Clustering algorithms; Computer networks; Concurrent computing; Hypercubes; Large-scale systems; Multiprocessor interconnection networks; Optimized production technology; Routing;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
