Optimal circulant graphs as low-latency network topologies

• Published in: The Journal of supercomputing Vol. 78; no. 11; pp. 13491 - 13510
• Main Authors: Huang, Xiaolong, F. Ramos, Alexandre, Deng, Yuefan
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.07.2022; Springer Nature B.V
• Subjects: Algorithms; Benchmarks; Cartesian coordinates; Clusters; Communications traffic; Compilers; Computer Science; Data communication; Hypercubes; Interpreters; Network latency; Network topologies; Optimization; Processor Architectures; Programming Languages; Toruses; Circulant graph; Benchmarks; Network topology; Optimization; Latency
• ISSN: 0920-8542; 1573-0484; 1573-0484
• DOI: 10.1007/s11227-022-04396-5

Communication latency has become one of the determining factors for the performance of parallel clusters. To design low-latency network topologies for high-performance computing clusters, we optimize the diameters, mean path lengths, and bisection widths of circulant topologies. We obtain a series of optimal circulant topologies of size 2 5 through 2 10 and compare them with torus and hypercube of the same sizes and degrees. We further benchmark on a broad variety of applications including effective bandwidth, FFTE, Graph 500 and NAS parallel benchmarks to compare the optimal circulant topologies and Cartesian products of optimal circulant topologies and fully connected topologies with corresponding torus and hypercube. Simulation results demonstrate superior potentials of the optimal circulant topologies for communication-intensive applications. We also find the strengths of the Cartesian products in exploiting global communication with data traffic patterns of specific applications or internal algorithms.