Paper Info
Title
A Verification Framework for Streamlining Empirical Auto-Tuning.
Abstract
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.
Year
DOI
Venue
2015
10.1109/CANDAR.2015.115
CANDAR
Keywords
Field
DocType
Verification,Correctness,Empirical auto-tuning
Kernel (linear algebra),Programmer,Computer science,Correctness,Parallel computing,Auto tuning,Computation
Conference
ISSN
Citations 
PageRank 
2379-1888
0
0.34
References 
Authors
8
3
Name
Order
Citations
PageRank
Shoichi Hirasawa1218.38
Hiroyuki Takizawa227346.54
Hiroaki Kobayashi39816.62