TY - JOUR
T1 - Scalable performance analysis method for SPMD applications
AU - Tirado, Felipe
AU - Wong, Alvaro
AU - Rexachs, Dolores
AU - Luque, Emilio
N1 - Publisher Copyright:
© 2022, The Author(s).
PY - 2022/11
Y1 - 2022/11
N2 - The analysis of parallel scientific applications allows us to understand their computational and communication behavior. One way of obtaining performance information is through performance tools. One such tool is parallel application signatures for performance prediction (PAS2P), based on parallel application repeatability, focusing on performance analysis and prediction. The same resources that execute the parallel application are used to perform its analysis, creating a machine independent model of the application and identifying its common patterns. However, the analysis is costly in terms of execution time due to the high number of synchronization communications performed by PAS2P, degrading performance as the number of processes increases. To solve this problem, we propose a model that reduces data dependency between processes, reducing the number of communications performed by PAS2P in the analysis stage and taking advantage of the characteristics of single program, multiple sata applications. Our analysis proposal allows us to decrease the analysis time by 29 times when the application scales to 256 processes, while keeping error levels below 11% in the runtime prediction. It is important to mention that the analysis time is not considerably affected by increasing the number of application processes.
AB - The analysis of parallel scientific applications allows us to understand their computational and communication behavior. One way of obtaining performance information is through performance tools. One such tool is parallel application signatures for performance prediction (PAS2P), based on parallel application repeatability, focusing on performance analysis and prediction. The same resources that execute the parallel application are used to perform its analysis, creating a machine independent model of the application and identifying its common patterns. However, the analysis is costly in terms of execution time due to the high number of synchronization communications performed by PAS2P, degrading performance as the number of processes increases. To solve this problem, we propose a model that reduces data dependency between processes, reducing the number of communications performed by PAS2P in the analysis stage and taking advantage of the characteristics of single program, multiple sata applications. Our analysis proposal allows us to decrease the analysis time by 29 times when the application scales to 256 processes, while keeping error levels below 11% in the runtime prediction. It is important to mention that the analysis time is not considerably affected by increasing the number of application processes.
KW - Application performance analysis
KW - Application signature
KW - MPI parallel application
KW - Performance prediction
UR - http://www.scopus.com/inward/record.url?scp=85132136323&partnerID=8YFLogxK
U2 - 10.1007/s11227-022-04588-z
DO - 10.1007/s11227-022-04588-z
M3 - Article
AN - SCOPUS:85132136323
SN - 0920-8542
VL - 78
SP - 19346
EP - 19371
JO - Journal of Supercomputing
JF - Journal of Supercomputing
IS - 17
ER -