Title :
Recursive Diagonal Torus: an interconnection network for massively parallel computers
Author :
Yang, Yulu ; Amano, Hideharu ; Shibamura, Hidetomo ; Sueyoshi, Toshinori
Author_Institution :
Dept. of Comput. Sci., Keio Univ., Yokohama, Japan
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 (e.g., it is 11 for 216 nodes) with smaller 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-optima 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
Keywords :
multiprocessor interconnection networks; parallel machines; FFT; RDT; Recursive Diagonal Torus; bitonic sorting algorithm; hypercube; interconnection network; massively parallel computers; mesh structure; remote links; simple routing algorithm; torus network; tree structures; vector routing; Communication networks; Computer networks; Concurrent computing; Hypercubes; Mesh networks; Multiprocessor interconnection networks; Network topology; Routing; Sorting; Tree data structures;
Conference_Titel :
Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-4222-X
DOI :
10.1109/SPDP.1993.395481
