论文标题
最佳循环图作为低延迟网络拓扑
Optimal circulant graphs as low-latency network topologies
论文作者
论文摘要
通信延迟已成为平行簇性能的决定因素之一。为了设计用于高性能计算簇的低延迟网络拓扑，我们优化了循环拓扑的直径，平均路径长度和一分为二的宽度。我们获得了一系列尺寸$ 2^5 $到$ 2^{10} $的最佳循环拓扑，并将它们与相同尺寸和学位的torus和Hypercube进行比较。我们进一步基于多种应用，包括有效的带宽，FFTE，图500和NAS并行基准测试，以比较最佳的循环拓扑结构和最佳循环拓扑的笛卡尔产品，以及与相应的圆环和超管的完全连接的拓扑结合。仿真结果证明了用于通信密集型应用的最佳循环拓扑的优势。我们还发现，笛卡尔产品在利用特定应用程序或内部算法的数据流量模式来利用全球通信方面的优势。
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.
