LogGP in theory and practice - An in-depth analysis of modern interconnection networks and benchmarking methods for collective operations

被引:13
作者
Hoefler, T. [1 ]
Schneider, T. [1 ]
Lumsdaine, A. [1 ]
机构
[1] Indiana Univ, Open Syst Lab, Bloomington, IN 47405 USA
关键词
LogP; LogGP; Network modeling; Benchmarking; Simulation; Collective operations; PERFORMANCE; ALGORITHMS;
D O I
10.1016/j.simpat.2009.06.007
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Accurate measurement and modeling of network performance is important for predicting and optimizing the running time of high-performance computing applications. Although the LogP family of models has proven to be a valuable tool for assessing the communication performance of parallel architectures, non-intrusive LogP parameter assessment of real systems remains a difficult task. Based on an analysis of accuracy and contention properties of existing measurement methods, we develop a new low-overhead measurement method which also assesses protocol changes in the underlying transport layers. We use the gathered parameters to simulate LogGP models of collective operations and demonstrate the errors in common benchmarking methods for collective operations. The simulations provide new insight into the nature of collective algorithms and their pipelining properties. We show that the error of conventional benchmark methods can grow linearly with the system size. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:1511 / 1521
页数:11
相关论文
共 36 条
[1]   LogGP: Incorporating long messages into the LogP model for parallel computation [J].
Alexandrov, A ;
Ionescu, MF ;
Schauser, KE ;
Scheiman, C .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1997, 44 (01) :71-79
[2]  
[Anonymous], MPI: A Message Passing Interface Standard
[3]  
[Anonymous], P 11 EUR PVM MPI US
[4]  
[Anonymous], 2008, P 22 IEEE INT PAR DI
[5]  
[Anonymous], 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
[6]  
Bell Christian., 2003, IPDPS 03, p28.1
[7]  
Bernaschi M, 1998, CONCURRENCY-PRACT EX, V10, P359, DOI 10.1002/(SICI)1096-9128(19980425)10:5<359::AID-CPE323>3.0.CO
[8]  
2-7
[9]  
BERNASCHI M, 1995, QUASIOPTIMAL COLLECT
[10]  
Bilardi G., 1996, SPAA '96. 8th Annual ACM Symposium on Parallel Algorithms and Architectures, P25, DOI 10.1145/237502.237504