Document Type
Conference Proceeding
Publication Date
1-1-2011
Abstract
Tiling is a key program transformation to achieve effective data reuse. But the performance of tiled programs can vary considerably with different tile sizes. Hence the selection of good tile sizes is crucial. Although there has been considerable research on analytical models for selecting tile sizes, they have not been shown to be effective in finding optimal tile sizes across a range of programs and target architectures. Auto-tuning is a viable alternative that is often used in practice, and involves the execution of different combinations of tile sizes in a systematic fashion to find the best ones. But this is sometimes infeasible for instance when the program is to be run on unknown platforms (e.g., cloud environments). We propose a novel approach for generating code to enable dynamic tile size selection, based on monitoring the performance of a few loop iterations. The selection operates at run time on the production run, without any a priori knowledge of the execution environment. We discuss the theory and implementation of a parametric tiled code generator that enables run-time tile size tuning and describe a search strategy to determine effective tile sizes. Experimental results demonstrate the effectiveness of the approach. © 2011 IEEE.
Publication Source (Journal or Book title)
18th International Conference on High Performance Computing, HiPC 2011
Recommended Citation
Tavarageri, S., Pouchet, L., Ramanujam, J., Rountev, A., & Sadayappan, P. (2011). Dynamic selection of tile sizes. 18th International Conference on High Performance Computing, HiPC 2011 https://doi.org/10.1109/HiPC.2011.6152742