Sistema FMUSP-HC: Faculdade de Medicina da Universidade de São Paulo (FMUSP) e Hospital das Clínicas da FMUSPDENG, YuefanGUO, MengRAMOS, Alexandre F.HUANG, XiaolongXU, ZhipengLIU, Weifeng2020-12-162020-12-162020JOURNAL OF SUPERCOMPUTING, v.76, n.12, p.9558-9584, 20200920-8542https://observatorio.fm.usp.br/handle/OPI/38665We propose that clusters interconnected with network topologies having minimal mean path length will increase their processing speeds. We approach our heuristic by constructing clusters of up to 32 nodes having torus, ring, Chvatal, Wagner, Bidiakis and optimal topology for minimal mean path length and by simulating the performance of 256 nodes clusters with the same network topologies. The optimal (or near-optimal) low-latency network topologies are found by minimizing the mean path length of regular graphs. The selected topologies are benchmarked using ping-pong messaging, the MPI collective communications and the standard parallel applications including effective bandwidth, FFTE, Graph 500 and NAS parallel benchmarks. We established strong correlations between the clusters' performances and the network topologies, especially the mean path lengths, for a wide range of applications. In communication-intensive benchmarks, optimal graphs enabled network topologies with multifold performance enhancement in comparison with mainstream graphs. It is striking that mere adjustment of the network topology suffices to reclaim performance from the same computing hardware.engrestrictedAccessNetwork topologyGraph theoryLatencyBenchmarksinterconnection networkhierarchical producthypercubetorusgenerationgraphsarticleCopyright SPRINGER10.1007/s11227-020-03216-yComputer Science, Hardware & ArchitectureComputer Science, Theory & MethodsEngineering, Electrical & Electronic1573-0484