Address-stride assisted approximate load value prediction in GPUs

Wang, Haonan et. al. and Ibrahim, Mohamed and Mittal, Sparsh and Jog, Adwait (2019) Address-stride assisted approximate load value prediction in GPUs. In: 33rd ACM International Conference on Supercomputing, ICS, 26 June 2019, Phoenix, United States.

Full text not available from this repository. (Request a copy)

Abstract

Value prediction holds the promise of significantly improving the performance and energy efficiency. However, if the values are predicted incorrectly, significant performance overheads are observed due to execution rollbacks. To address these overheads, value approximation is introduced, which leverages the observation that the rollbacks are not necessary as long as the application-level loss in quality due to value misprediction is acceptable to the user. However, in the context of Graphics Processing Units (GPUs), our evaluations show that the existing approximate value predictors are not optimal in improving the prediction accuracy as they do not consider memory request order, a key characteristic in determining the accuracy of value prediction. As a result, the overall data movement reduction benefits are capped as it is necessary to limit the percentage of predicted values (i.e., prediction coverage) for an acceptable value of application-level error. To this end, we propose a new Address-Stride Assisted Approximate Value Predictor (ASAP) that explicitly considers the memory addresses and their request order information so as to provide high value prediction accuracy. We take advantage of our new observation that the stride between memory request addresses and the stride between their corresponding data values are highly correlated in several applications. Therefore, ASAP predicts the values only for those requests that have regular strides in their addresses. We evaluate ASAP on a diverse set of GPGPU applications. The results show that ASAP can significantly improve the value prediction accuracy over the previously proposed mechanisms at the same coverage, or can achieve higher coverage (leading to higher performance/energy improvements) under a fixed error threshold.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Mittal, Sparshhttp://orcid.org/0000-0002-2908-993X
Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Approximation, GPU, Scheduling, Value prediction, Indexed in Scopus
Subjects: Computer science
Divisions: Department of Computer Science & Engineering
Depositing User: Team Library
Date Deposited: 18 Nov 2019 05:34
Last Modified: 18 Nov 2019 05:34
URI: http://raiith.iith.ac.in/id/eprint/7023
Publisher URL: http://doi.org/10.1145/3330345.3330362
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 7023 Statistics for this ePrint Item