Recursive diagonal torus: An interconnection network for massively parallel computers

Yulu Yang, Akira Funahashi, Akiya Jouraku, Hiroaki Nishi, Hideharu Amano, Toshinori Sueyoshi

Research output: Contribution to journalArticle

52 Citations (Scopus)

Abstract

Recursive Diagonal Torus (RDT), a class of interconnection network is proposed for massively parallel computers with up to 2 16 nodes. By making the best use of a recursively structured diagonal mesh (torus) connection, the RDT has a smaller diameter (e.g., it is 11 for 2 16 nodes) with a smaller number of links per node (i.e., 8 links per node) than those of the hypercube, A simple routing algorithm, called vector routing, which is near-optimal and easy to implement is also proposed. Although the congestion on upper rank tori sometimes degrades the performance under the random traffic, the RDT provides much better performance than that of a 2D/3D torus in most cases and, under hot spot traffic, the RDT provides much better performance than that of a 2D/3D/4D torus. The RDT router chip which provides a message multicast for maintaining cache consistency is available. Using the 0.5μm BiCMOS SOG technology, versatile functions, including hierarchical multicasting, combining acknowledge packets, shooting down/restart mechanism, and time-out/setup mechanisms, work at a 60MHz clock rate.

Original languageEnglish
Pages (from-to)701-715
Number of pages15
JournalIEEE Transactions on Parallel and Distributed Systems
Volume12
Issue number7
DOIs
Publication statusPublished - 2001 Jul

    Fingerprint

Keywords

  • Interconnection network
  • Massively parallel computer
  • Mesh network
  • Message multicast
  • Router chip
  • Routing algorithm
  • Torus network

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this