Recursive diagonal torus: An interconnection network for massively parallel computers

Yu Lu Yang, Hideharu Amano, Hidetomo Shibamura, Toshinori Sueyoshi

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

11 Citations (Scopus)

Abstract

Recursive Diagonal Torus (RDT), a class of interconnection network is proposed for massively parallel computers with up to 216 nodes. By adding remote links to the diagonal directions of the torus network recursively, the RDT can realize a smaller diameter (eg., it is 11 for 216 nodes) with small number of links per node (i.e., 8 links per node) than that of the hypercube. A simple routing algorithm called vector routing, which is near-optimal and easy to implement is also proposed. The RDT comprises the mesh structure, and emulates hypercube and tree structures easily. FFT and the bitonic sorting algorithm are also easy to implement.

Original languageEnglish
Title of host publicationProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
Editors Anon
PublisherPubl by IEEE
Pages591-594
Number of pages4
ISBN (Print)081864222X
Publication statusPublished - 1993 Dec 1
EventProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA
Duration: 1993 Dec 11993 Dec 4

Publication series

NameProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing

Other

OtherProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
CityDallas, TX, USA
Period93/12/193/12/4

ASJC Scopus subject areas

  • Engineering(all)

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

Cite this