%0 Conference Proceedings
%T An Efficient Method for Determining Full Point-to-Point Latency of Arbitrary Indirect HPC Networks
%+ School of Computer Science and Engineering [Beijing]
%+ Institute of Applied Physics and Computational Mathematics - IACM (Beijing, China))
%A Liu, Chengchun
%A Yang, Zhang
%A Xiao, Limin
%A Yan, Baicheng
%A Wang, Zhihao
%A Tian, Hongyun
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 15th IFIP International Conference on Network and Parallel Computing (NPC)
%C Muroran, Japan
%Y Feng Zhang
%Y Jidong Zhai
%Y Marc Snir
%Y Hai Jin
%Y Hironori Kasahara
%Y Mateo Valero
%I Springer International Publishing
%3 Network and Parallel Computing
%V LNCS-11276
%P 52-63
%8 2018-11-29
%D 2018
%R 10.1007/978-3-030-05677-3_5
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-02279556/document
%2 https://inria.hal.science/hal-02279556/file/477597_1_En_5_Chapter.pdf
%L hal-02279556
%U https://inria.hal.science/hal-02279556
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3
%~ IFIP-LNCS-11276