Torus assignment for an interconnection network recursive diagonal torus

Qin Fan; Yulu Yang; Akira Funahashi; Hideharu Amano

Torus assignment for an interconnection network recursive diagonal torus

Qin Fan, Yulu Yang, Akira Funahashi, Hideharu Amano

研究成果: Conference article › 査読

抄録

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 2¹⁶ 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.

本文言語	English
ページ（範囲）	74-79
ページ数	6
ジャーナル	Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
出版ステータス	Published - 1999 12 1
外部発表	はい
イベント	Proceedings of the 1999 4th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) - Perth/Fremantle, Aust 継続期間: 1999 6 23 → 1999 6 25

ASJC Scopus subject areas

Computer Science(all)

他のファイルとリンク

フィンガープリント「Torus assignment for an interconnection network recursive diagonal torus」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル

@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",

month = dec,

day = "1",

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.",

note = "Proceedings of the 1999 4th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) ; Conference date: 23-06-1999 Through 25-06-1999",

}

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/12/1

Y1 - 1999/12/1

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 - Conference article

AN - SCOPUS:0033360479

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

T2 - Proceedings of the 1999 4th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)

Y2 - 23 June 1999 through 25 June 1999

ER -