Adaptive routing on the recursive diagonal torus

Akira Funahashi, T. Hanawa, T. Kudoh, Hideharu Amano

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

Recnrsive Diagonal Torus, or RDT consisting of recursively structured tori is an interconnection network tbr massively parMlel computers. By adding remote links to the diagonal directions of the torus network recursively, the diameter can be reduced within log2N with smaller number of links than that of hypercube. For an interconnection network for massively parallel computers, a routing algorithm which can bypass a faulty or congested node are essential. Although the conventional vector routing is a simple and near-optimM method, it can only use a deterministic path. In this paper, adaptive routing algorithms on RDT are proposed and discussed. The first algorithm is based on Duato's necessary and sufficient condition. With this method virtual channels are effectively used while paths with redundant routing steps are prohibited. Another algorithm based on the turn model is proposed. By prohibiting certain turns on RDT, it permits paths with additional hops. Both algorithms are proved to be deadlock free.

本文言語English
ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
出版社Springer Verlag
ページ171-182
ページ数12
1336
ISBN(印刷版)3540637664, 9783540637660
DOI
出版ステータスPublished - 1997
イベントInternational Symposium on High Performance Computing, ISHPC 1997 - Fukuoka, Japan
継続期間: 1997 11 41997 11 6

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1336
ISSN(印刷版)03029743
ISSN(電子版)16113349

Other

OtherInternational Symposium on High Performance Computing, ISHPC 1997
国/地域Japan
CityFukuoka
Period97/11/497/11/6

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)
  • 理論的コンピュータサイエンス

フィンガープリント

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

引用スタイル