Automatic performance tuning of a practical application could be time-consuming and sometimes infeasible, because it often needs to evaluate the performances of a large number of code variants to find the best one. In this paper, hence, a light-weight rollback mechanism is proposed to evaluate each of code variants at a low cost. In the proposed mechanism, once one code variant of a target code block is executed, the execution state is rolled back to the previous state of not yet executing the block so as to repeatedly execute only the block to find the best code variant. It also has a feature of terminating a code variant whose execution time is longer than the shortest execution time so far. As a result, it can prevent executing the whole application many times and thus reduces the timing overhead of an auto-tuning process required for finding the best code variant.
Shoichi HIRASAWA
Tohoku University,CREST
Hiroyuki TAKIZAWA
Tohoku University,CREST
Hiroaki KOBAYASHI
Tohoku University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shoichi HIRASAWA, Hiroyuki TAKIZAWA, Hiroaki KOBAYASHI, "A Light-Weight Rollback Mechanism for Testing Kernel Variants in Auto-Tuning" in IEICE TRANSACTIONS on Information,
vol. E98-D, no. 12, pp. 2178-2186, December 2015, doi: 10.1587/transinf.2015PAP0028.
Abstract: Automatic performance tuning of a practical application could be time-consuming and sometimes infeasible, because it often needs to evaluate the performances of a large number of code variants to find the best one. In this paper, hence, a light-weight rollback mechanism is proposed to evaluate each of code variants at a low cost. In the proposed mechanism, once one code variant of a target code block is executed, the execution state is rolled back to the previous state of not yet executing the block so as to repeatedly execute only the block to find the best code variant. It also has a feature of terminating a code variant whose execution time is longer than the shortest execution time so far. As a result, it can prevent executing the whole application many times and thus reduces the timing overhead of an auto-tuning process required for finding the best code variant.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2015PAP0028/_p
Copy
@ARTICLE{e98-d_12_2178,
author={Shoichi HIRASAWA, Hiroyuki TAKIZAWA, Hiroaki KOBAYASHI, },
journal={IEICE TRANSACTIONS on Information},
title={A Light-Weight Rollback Mechanism for Testing Kernel Variants in Auto-Tuning},
year={2015},
volume={E98-D},
number={12},
pages={2178-2186},
abstract={Automatic performance tuning of a practical application could be time-consuming and sometimes infeasible, because it often needs to evaluate the performances of a large number of code variants to find the best one. In this paper, hence, a light-weight rollback mechanism is proposed to evaluate each of code variants at a low cost. In the proposed mechanism, once one code variant of a target code block is executed, the execution state is rolled back to the previous state of not yet executing the block so as to repeatedly execute only the block to find the best code variant. It also has a feature of terminating a code variant whose execution time is longer than the shortest execution time so far. As a result, it can prevent executing the whole application many times and thus reduces the timing overhead of an auto-tuning process required for finding the best code variant.},
keywords={},
doi={10.1587/transinf.2015PAP0028},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - A Light-Weight Rollback Mechanism for Testing Kernel Variants in Auto-Tuning
T2 - IEICE TRANSACTIONS on Information
SP - 2178
EP - 2186
AU - Shoichi HIRASAWA
AU - Hiroyuki TAKIZAWA
AU - Hiroaki KOBAYASHI
PY - 2015
DO - 10.1587/transinf.2015PAP0028
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E98-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2015
AB - Automatic performance tuning of a practical application could be time-consuming and sometimes infeasible, because it often needs to evaluate the performances of a large number of code variants to find the best one. In this paper, hence, a light-weight rollback mechanism is proposed to evaluate each of code variants at a low cost. In the proposed mechanism, once one code variant of a target code block is executed, the execution state is rolled back to the previous state of not yet executing the block so as to repeatedly execute only the block to find the best code variant. It also has a feature of terminating a code variant whose execution time is longer than the shortest execution time so far. As a result, it can prevent executing the whole application many times and thus reduces the timing overhead of an auto-tuning process required for finding the best code variant.
ER -