Recursive diagonal torus: An interconnection network for massively parallel computers

YuLu 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
EventProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA
Duration: 1993 Dec 11993 Dec 4

Other

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

Fingerprint

Routing algorithms
Sorting
Fast Fourier transforms

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Yang, Y., Amano, H., Shibamura, H., & Sueyoshi, T. (1993). Recursive diagonal torus: An interconnection network for massively parallel computers. In Anon (Ed.), Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing (pp. 591-594). Publ by IEEE.

Recursive diagonal torus : An interconnection network for massively parallel computers. / Yang, YuLu; Amano, Hideharu; Shibamura, Hidetomo; Sueyoshi, Toshinori.

Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing. ed. / Anon. Publ by IEEE, 1993. p. 591-594.

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

Yang, Y, Amano, H, Shibamura, H & Sueyoshi, T 1993, Recursive diagonal torus: An interconnection network for massively parallel computers. in Anon (ed.), Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing. Publ by IEEE, pp. 591-594, Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, USA, 93/12/1.
Yang Y, Amano H, Shibamura H, Sueyoshi T. Recursive diagonal torus: An interconnection network for massively parallel computers. In Anon, editor, Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing. Publ by IEEE. 1993. p. 591-594
Yang, YuLu ; Amano, Hideharu ; Shibamura, Hidetomo ; Sueyoshi, Toshinori. / Recursive diagonal torus : An interconnection network for massively parallel computers. Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing. editor / Anon. Publ by IEEE, 1993. pp. 591-594
@inproceedings{d3e4cc0262154205bbbd9308db2b5e1b,
title = "Recursive diagonal torus: An interconnection network for massively parallel computers",
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.",
author = "YuLu Yang and Hideharu Amano and Hidetomo Shibamura and Toshinori Sueyoshi",
year = "1993",
language = "English",
isbn = "081864222X",
pages = "591--594",
editor = "Anon",
booktitle = "Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Recursive diagonal torus

T2 - An interconnection network for massively parallel computers

AU - Yang, YuLu

AU - Amano, Hideharu

AU - Shibamura, Hidetomo

AU - Sueyoshi, Toshinori

PY - 1993

Y1 - 1993

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:0027810254

SN - 081864222X

SP - 591

EP - 594

BT - Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing

A2 - Anon, null

PB - Publ by IEEE

ER -