Modeling data sharing in GPU programs is a challenging task because of the massive parallelism and complex data sharing patterns provided by GPU architectures. Better GPU caching efficiency can be achieved through careful task scheduling among different threads. Traditionally, in the field of parallel computing, graph partition models are used to model data communication and guide task scheduling. However, we discover that the previous methods are either inaccurate or expensive when applied to GPU programs. In this paper, we propose a novel task partition model that is accurate and gives rise to the development of fast and high quality task/data reorganization algorithms. We demonstrate the effectiveness of the proposed model by rigorous theoretical analysis of the algorithm bounds and extensive experimental analysis. The experimental results show that it achieves significant performance improvement across a representative set of GPU applications.
@article{arxiv.1605.02043,
title = {A Graph-based Model for GPU Caching Problems},
author = {Lingda Li and Ari B. Hayes and Stephen A. Hackler and Eddy Z. Zhang and Mario Szegedy and Shuaiwen Leon Song},
journal= {arXiv preprint arXiv:1605.02043},
year = {2016}
}