Shifted Recursive Torus interconnection for high performancecomputing

摘要

We propose the Shifted Recursive Torus (SRT) interconnectionnetwork for high performance computing. By adding multi level links tothe torus network recursively, the SRT can achieve excellentinterconnection features such as a smaller diameter, a limited number oflinks per node, an easy implementation in VLSI, and an expandiblehierarchical structure. The paper considers the problem of achieving anefficient routing on the SRT. It proposes a recursive routing algorithmon the SRT whose performance is almost the same as optimal routing. Ahigh performance computing of FFT is discussed by embedding the datastructure into the SRT