A case for random shortcut topologies for HPC interconnects

• Main Authors: Koibuchi, M., Matsutani, H., Amano, H., Hsu, D. F., Casanova, H.
• Format: Conference Proceeding
• Language: English
• Subjects: diameter; Fault tolerance; Fault tolerant systems; high performance computing; high-radix switches; Hypercubes; interconnection networks; Network topology; Optical switches; Routing; Topology
• ISSN: 1063-6897; 2575-713X
• DOI: 10.1109/ISCA.2012.6237016

As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance Computing (HPC) systems can exploit low-latency topologies of high-radix switches. In this context, we propose the use of random shortcut topologies, which are generated by augmenting classical topologies with random links. Using graph analysis we find that these topologies, when compared to non-random topologies of the same degree, lead to drastically reduced diameter and average shortest path length. The best results are obtained when adding random links to a ring topology, meaning that good random shortcut topologies can easily be generated for arbitrary numbers of switches. Using flit-level discrete event simulation we find that random shortcut topologies achieve throughput comparable to and latency lower than that of existing non-random topologies such as hypercubes and tori. Finally, we discuss and quantify practical challenges for random shortcut topologies, including routing scalability and larger physical cable lengths.