Efficient Cache Performance Modeling in GPUs Using Reuse Distance Analysis

doi:10.1145/3291051

Efficient Cache Performance Modeling in GPUs Using Reuse Distance Analysis

2018-12-19

0

OA

AI

DOI：10.1145/3291051

原文链接

查看原文

摘要

En 中文

Reuse distance analysis (RDA) is a popular method for calculating locality profiles and modeling cache performance. The present article proposes a framework to apply the RDA algorithm to obtain reuse distance profiles in graphics processing unit (GPU) kernels. To study the implications of hardware-related parameters in RDA, two RDA algorithms were employed, including a high-level cache-independent RDA algorithm, called HLRDA, and a detailed RDA algorithm, called DRDA. DRDA models the effects of reservation fails in cache blocks and miss status holding registers to provide accurate cache-related performance metrics. In this case, the reuse profiles are cache-specific. In a selection of GPU kernels, DRDA obtained the L1 miss-rate breakdowns with an average error of 3.86% and outperformed the state-of-the-art RDA in terms of accuracy. In terms of performance, DRDA is 246,000× slower than the real GPU executions and 11× faster than GPGPU-Sim. HLRDA ignores the cache-related parameters and its obtained reuse profiles are general, which can be used to calculate miss rates in all cache sizes. Moreover, the average error incurred by HLRDA was 16.9%.

Efficient Cache Performance Modeling in GPUs Using Reuse Distance Analysis

摘要

AI总结

期刊

机构

引用论文