Recursive diagonal torus (RDT): An interconnection network for the massively parallel computers

Yulu Yang, Hideharu Amano, Hidetomo Shibamura, Toshinori Sueyoshi

Research output: Contribution to journalArticle

Abstract

This paper proposes the recursive diagonal torus (RDT), which is the interconnection network for the massively parallel computer with 216 or more processors. RDT can realize a small diameter (12 for 16 Knode) with a small number of links compared to the hypercube by adding links recursively along the diagonal direction of the two-dimensional torus. The packet is routed by a simple algorithm called vector routing. RDT not only includes a torus, but also easily implements the emulation of the hypercube or tree as well as the packet broadcast. Considering a typical packet transfer method, the random transfer performance is evaluated. A satisfactory result is obtained compared to the 2-D or 3-D torus, although somewhat inferior to the hypercube with a large number of links.

Original languageEnglish
Pages (from-to)43-54
Number of pages12
JournalSystems and Computers in Japan
Volume27
Issue number9
DOIs
Publication statusPublished - 1996 Aug

Keywords

  • Interconnection network
  • Massively parallel computer
  • Mesh torus
  • Routing algorithm

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Recursive diagonal torus (RDT): An interconnection network for the massively parallel computers'. Together they form a unique fingerprint.

  • Cite this