Torus assignment for an interconnection network recursive diagonal torus

Qin Fan, Yulu Yang, Akira Funahashi, Hideharu Amano

研究成果: Conference article

6 引用 (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.

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

ASJC Scopus subject areas

  • Computer Science(all)

フィンガープリント Torus assignment for an interconnection network recursive diagonal torus' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用