Details

Autor(en) / Beteiligte

• Tao Li
• Yang Yu
• Peng Li
• Jingpeng Xu
• Xirong Ma
• Yulu Yang

Titel

Practical routing and torus assignment for RDT

Ist Teil von

• 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings, 2004, p.30-35

Ort / Verlag

Los Alamitos CA: IEEE

Erscheinungsjahr

2004

Link zum Volltext

• IEEE_Xplore

Quelle

IEL

Beschreibungen/Notizen

• 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.