TY  - JOUR
AU  - Geimer, M.
AU  - Wolf, F.
AU  - Wylie, B.
AU  - Mohr, B.
TI  - A scalable tool architecture for diagnosing wait states in massively parallel applications
JO  - Parallel computing
VL  - 35
SN  - 0167-8191
CY  - Amsterdam [u.a.]
PB  - North-Holland, Elsevier Science
M1  - PreJuSER-6609
SP  - 375 - 388
PY  - 2009
N1  - This work was supported by the Helmholtz Association under Grants No. VH-NG-118 and No. VH-VI-228. Also, we would like to thank Marek Behr, Mike Nicolai, and Markus Probst from the Chair for Computational Analysis of Technical Systems at RWTH Aachen University for giving us access to their code.
AB  - When scaling message-passing applications to thousands of processors, their performance is often affected by wait states that occur when processes fail to reach synchronization points simultaneously. As a first step in reducing the performance impact, we have shown in our earlier work that wait states can be diagnosed by searching event traces for characteristic patterns. However, our initial sequential search method did not scale beyond several hundred processes. Here, we present a scalable approach, based on a parallel replay of the target application's communication behavior, that can efficiently identify wait states at the previously inaccessible scale of 65,536 processes and that has potential for even larger configurations. We explain how our new approach has been integrated into a comprehensive parallel tool architecture, which we use to demonstrate that wait states may consume a major fraction of the execution time at larger scales. (C) 2009 Elsevier B.V. All rights reserved.
KW  - J (WoSType)
LB  - PUB:(DE-HGF)16
UR  - <Go to ISI:>//WOS:000268438000001
DO  - DOI:10.1016/j.parco.2009.02.003
UR  - https://juser.fz-juelich.de/record/6609
ER  -