Shifted Recursive Torus interconnection for high performance computing

We propose the Shifted Recursive Torus (SRT) interconnection network for high performance computing. By adding multi level links to the torus network recursively, the SRT can achieve excellent interconnection features such as a smaller diameter, a limited number of links per node, an easy implementation in VLSI, and an expandible hierarchical structure. The paper considers the problem of achieving an efficient routing on the SRT. It proposes a recursive routing algorithm on the SRT whose performance is almost the same as optimal routing. A high performance computing of FFT is discussed by embedding the data structure into the SRT.