TY - GEN
T1 - Recursive diagonal torus
T2 - Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
AU - Yang, Yu Lu
AU - Amano, Hideharu
AU - Shibamura, Hidetomo
AU - Sueyoshi, Toshinori
PY - 1993/12/1
Y1 - 1993/12/1
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
T3 - Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
SP - 591
EP - 594
BT - Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
A2 - Anon, null
PB - Publ by IEEE
Y2 - 1 December 1993 through 4 December 1993
ER -