On the Performance of k-ary n-cube Interconnection Networks
William J. Dally · CaltechAUTHORS (California Institute of Technology) · 1986
The performance of k-ary n-cube interconnection networks is analyzed under the assumption of constant wire bisection. It is shown that low-dimensional k-ary n-cube networks (e.g., tori) have lower latency and higher hot-spot throughput than high-dimensional networks (e.g., binary n-cubes) with the same bisection width.