TY - GEN
T1 - A Verification Framework for Streamlining Empirical Auto-Tuning
AU - Hirasawa, Shoichi
AU - Takizawa, Hiroyuki
AU - Kobayashi, Hiroaki
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2016/3/2
Y1 - 2016/3/2
N2 - Empirical auto-Tuning is getting attention in the field of high-performance computing (HPC) because it effectively reduces programmers' burden to improve the execution performance of an application. In the tuning process, a programmer selects a high-performance kernel variant of the application by evaluating the performances of multiple kernel variants. Since HPC applications need quite a huge number of floating-point operations, not all kernel variants produce exactly the same computation result as the original code. Although it is possible to verify the correctness of each kernel variant by executing the whole application to the end, it takes a long time to verify the final computation results of all kernel variants especially in the cases of long-running applications. Therefore, this paper proposes a framework that reduces the time for verifying the computation result on tuning a large-scale application. The framework uses user-specified information of the final computation result of the application to verify the correctness of every kernel variant. The framework also automatically skips unnecessary verifications to reduce the overall verification time. As a result, the framework streamlines empirical auto-Tuning.
AB - Empirical auto-Tuning is getting attention in the field of high-performance computing (HPC) because it effectively reduces programmers' burden to improve the execution performance of an application. In the tuning process, a programmer selects a high-performance kernel variant of the application by evaluating the performances of multiple kernel variants. Since HPC applications need quite a huge number of floating-point operations, not all kernel variants produce exactly the same computation result as the original code. Although it is possible to verify the correctness of each kernel variant by executing the whole application to the end, it takes a long time to verify the final computation results of all kernel variants especially in the cases of long-running applications. Therefore, this paper proposes a framework that reduces the time for verifying the computation result on tuning a large-scale application. The framework uses user-specified information of the final computation result of the application to verify the correctness of every kernel variant. The framework also automatically skips unnecessary verifications to reduce the overall verification time. As a result, the framework streamlines empirical auto-Tuning.
KW - Correctness
KW - Empirical auto-Tuning
KW - Verification
UR - http://www.scopus.com/inward/record.url?scp=84964749495&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84964749495&partnerID=8YFLogxK
U2 - 10.1109/CANDAR.2015.115
DO - 10.1109/CANDAR.2015.115
M3 - Conference contribution
AN - SCOPUS:84964749495
T3 - Proceedings - 2015 3rd International Symposium on Computing and Networking, CANDAR 2015
SP - 508
EP - 514
BT - Proceedings - 2015 3rd International Symposium on Computing and Networking, CANDAR 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd International Symposium on Computing and Networking, CANDAR 2015
Y2 - 8 December 2015 through 11 December 2015
ER -