Torus assignment for an interconnection network recursive diagonal torus

Qin Fan, Yulu Yang, Akira Funahashi, Hideharu Amano

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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
Externally publishedYes

Fingerprint

Communication

ASJC Scopus subject areas

  • Engineering(all)

Cite this

@article{b587e5c027e148ccbef8c9487d6a156e,
title = "Torus assignment for an interconnection network recursive diagonal torus",
abstract = "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.",
author = "Qin Fan and Yulu Yang and Akira Funahashi and Hideharu Amano",
year = "1999",
language = "English",
pages = "74--79",
journal = "Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN",
issn = "1087-4089",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Torus assignment for an interconnection network recursive diagonal torus

AU - Fan, Qin

AU - Yang, Yulu

AU - Funahashi, Akira

AU - Amano, Hideharu

PY - 1999

Y1 - 1999

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

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

UR - http://www.scopus.com/inward/record.url?scp=0033360479&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033360479&partnerID=8YFLogxK

M3 - Article

SP - 74

EP - 79

JO - Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

JF - Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

SN - 1087-4089

ER -