Adaptive routing on the recursive diagonal torus

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages171-182
Number of pages12
Volume1336
ISBN (Print)3540637664, 9783540637660
DOIs
Publication statusPublished - 1997
EventInternational Symposium on High Performance Computing, ISHPC 1997 - Fukuoka, Japan
Duration: 1997 Nov 41997 Nov 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1336
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Symposium on High Performance Computing, ISHPC 1997
CountryJapan
CityFukuoka
Period97/11/497/11/6

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Adaptive routing on the recursive diagonal torus'. Together they form a unique fingerprint.

  • Cite this

    Funahashi, A., Hanawa, T., Kudoh, T., & Amano, H. (1997). Adaptive routing on the recursive diagonal torus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1336, pp. 171-182). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1336). Springer Verlag. https://doi.org/10.1007/BFb0024214