Title :
Practical routing and torus assignment for RDT
Author :
Li, Tao ; Yu, Yang ; Li, Peng ; Xu, Jingpeng ; Ma, Xirong ; Yang, Yulu
Author_Institution :
Dept. of Comput. Sci., Nankai Univ., China
Abstract :
The connection topology of interconnection networks and the routing algorithm often dominate system performance in MPCs. RDT has already been proved to be one of the best interconnection networks used in such systems. It supports a smaller diameter and degree than most at the size of one thousand to tens of thousands nodes. The floating vector routing algorithm is very effective for transferring messages, which also shows good performance. In this paper, a descending vector routing algorithm is proposed. We also proposed a practical torus assignment named RDT(2,2,1)/a and the deadlock-free routing algorithm. RDT(2,2,1)/a mainly focuses on the MPC that has about one thousand nodes. With a simplified simulation and comparison, the results show that RDT(2,2,1)/a has a better performance at the size of one thousand nodes.
Keywords :
message passing; multiprocessor interconnection networks; network routing; network topology; parallel architectures; RDT; connection topology; deadlock-free routing algorithm; descending vector routing algorithm; floating vector routing algorithm; interconnection networks; massively parallel computer systems; message transfer; network nodes; practical routing; torus assignment; Computational modeling; Computer networks; Electronic mail; Multiprocessor interconnection networks; Network topology; Parallel machines; Routing; System performance; System recovery; Tree graphs;
Conference_Titel :
Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on
Print_ISBN :
0-7695-2135-5
DOI :
10.1109/ISPAN.2004.1300453