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
Publication statusPublished - 1996 Aug

Fingerprint

Interconnection Networks
Parallel Computers
Torus
Hypercube
Emulation
Broadcast
3D
Routing

Keywords

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

ASJC Scopus subject areas

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

Cite this

Recursive diagonal torus (RDT) : An interconnection network for the massively parallel computers. / Yang, Yulu; Amano, Hideharu; Shibamura, Hidetomo; Sueyoshi, Toshinori.

In: Systems and Computers in Japan, Vol. 27, No. 9, 08.1996, p. 43-54.

Research output: Contribution to journalArticle

Yang, Yulu ; Amano, Hideharu ; Shibamura, Hidetomo ; Sueyoshi, Toshinori. / Recursive diagonal torus (RDT) : An interconnection network for the massively parallel computers. In: Systems and Computers in Japan. 1996 ; Vol. 27, No. 9. pp. 43-54.
@article{4dd1d8980e7d44aaa5cd91c1883dcd81,
title = "Recursive diagonal torus (RDT): An interconnection network for the massively parallel computers",
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.",
keywords = "Interconnection network, Massively parallel computer, Mesh torus, Routing algorithm",
author = "Yulu Yang and Hideharu Amano and Hidetomo Shibamura and Toshinori Sueyoshi",
year = "1996",
month = "8",
language = "English",
volume = "27",
pages = "43--54",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "9",

}

TY - JOUR

T1 - Recursive diagonal torus (RDT)

T2 - An interconnection network for the massively parallel computers

AU - Yang, Yulu

AU - Amano, Hideharu

AU - Shibamura, Hidetomo

AU - Sueyoshi, Toshinori

PY - 1996/8

Y1 - 1996/8

N2 - 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.

AB - 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.

KW - Interconnection network

KW - Massively parallel computer

KW - Mesh torus

KW - Routing algorithm

UR - http://www.scopus.com/inward/record.url?scp=0030215651&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030215651&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0030215651

VL - 27

SP - 43

EP - 54

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 9

ER -