A scalable tool architecture for diagnosing wait states in massively parallel applications Export

@article{citeulike:4615215, abstract = {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.}, author = {Geimer, Markus and Wolf, Felix and Wylie, Brian J. and Mohr, Bernd}, citeulike-article-id = {4615215}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.parco.2009.02.003}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0167819109000398}, day = {06}, doi = {10.1016/j.parco.2009.02.003}, issn = {01678191}, journal = {Parallel Computing}, keywords = {communication\_algorithms, high-performance\_computing, mpi\_tools, parallel\_programming, performance\_analysis}, month = {March}, posted-at = {2009-07-06 07:08:57}, priority = {2}, title = {A scalable tool architecture for diagnosing wait states in massively parallel applications}, url = {http://dx.doi.org/10.1016/j.parco.2009.02.003}, year = {2009} }

TY - JOUR ID - citeulike:4615215 L3 - citeulike-article-id:4615215 N2 - 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. JF - Parallel Computing SN - 01678191 TI - A scalable tool architecture for diagnosing wait states in massively parallel applications KW - communication_algorithms KW - high-performance_computing KW - mpi_tools KW - parallel_programming KW - performance_analysis AU - Geimer, Markus AU - Wolf, Felix AU - Wylie, Brian AU - Mohr, Bernd PY - 2009/03/06/ UR - http://dx.doi.org/10.1016/j.parco.2009.02.003 ER -