Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Abstract : Point-to-point latency is one of the most important metrics for high performance computer networks and is used widely in communication performance modeling, link-failure detection, and application optimization. However, it is often hard to determine the full-scale point-to-point latency of large scale HPC networks since it often requires measurements to the square of the number of terminal nodes. In this paper, we propose an efficient method to generate measurement plans for arbitrary indirect HPC networks and reduces the measurement requirements from $$O(n^2)$$ to m, which is often O(n) in modern indirect networks containing n nodes and m links, thus significantly reduces the latency measure overhead. Both analysis and experiments show that the proposed method can reduce the overhead of large-scale fat-tree networks by orders of magnitudes.
https://hal.inria.fr/hal-02279556 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Thursday, September 5, 2019 - 1:31:24 PM Last modification on : Wednesday, November 3, 2021 - 6:39:10 AM Long-term archiving on: : Thursday, February 6, 2020 - 5:00:48 AM
Chengchun Liu, Zhang yang, Limin Xiao, Baicheng yan, Zhihao Wang, et al.. An Efficient Method for Determining Full Point-to-Point Latency of Arbitrary Indirect HPC Networks. 15th IFIP International Conference on Network and Parallel Computing (NPC), Nov 2018, Muroran, Japan. pp.52-63, ⟨10.1007/978-3-030-05677-3_5⟩. ⟨hal-02279556⟩