Recursive Diagonal Torus: an interconnection network for massively parallel computers

Recursive Diagonal Torus (RDT), a class of interconnection network is proposed for massively parallel computers with up to 2/sup 16/ 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 2/sup 16/ 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.<
>