Torus assignment for an interconnection network recursive diagonal torus

Qin Fan, Yulu Yang, Akira Funahashi, Hideharu Amano

Research output: Contribution to journalConference articlepeer-review

6 Citations (Scopus)


Recursive Diagonal Torus (RDT) is a class of interconnection network consisting of recursively overlaid two-dimensional square diagonal tori for massively parallel computers with up to 216 nodes. Connection structures of the RDT vary according to the assignment of upper rank diagonal tori into a node. Although traditional simple assignment called RDT(2, 4, 1)/α shows enough performance under the uniform traffic, the congestion of low rank tori degrades the performance when local communication is dominant. In this paper, RDT(2, 4, 1)/β torus assignment is proposed, focusing on improving the performance for local communication. With a simplified simulation algorithm, results shows that RDT(2, 4, 1)/β improves the average distance compared with RDT(2, 4, 1)/α assignment when considering local area.

Original languageEnglish
Pages (from-to)74-79
Number of pages6
JournalProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
Publication statusPublished - 1999 Dec 1
Externally publishedYes
EventProceedings of the 1999 4th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) - Perth/Fremantle, Aust
Duration: 1999 Jun 231999 Jun 25

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Torus assignment for an interconnection network recursive diagonal torus'. Together they form a unique fingerprint.

Cite this