### Abstract

Recursive Diagonal Torus (RDT), a class of interconnection network is proposed for massively parallel computers with up to 2^{16} 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 2^{16} 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 language | English |
---|---|

Title of host publication | Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing |

Editors | Anon |

Publisher | Publ by IEEE |

Pages | 591-594 |

Number of pages | 4 |

ISBN (Print) | 081864222X |

Publication status | Published - 1993 |

Event | Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA Duration: 1993 Dec 1 → 1993 Dec 4 |

### Other

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

City | Dallas, TX, USA |

Period | 93/12/1 → 93/12/4 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

}

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 -