An Efficient Strip-Mining Algorithm for Improving SRF Bandwidth Utilization on Imagine

Strip-mining is a crucial technique for memory hierarchy optimization. In this paper, we propose an efficient strip-mining algorithm for improving SRF bandwidth utilization on Imagine. Firstly, we present how to determine the optimal kernel set for strip-mining. The process is based on a novel structure proposed by us, namely kernel reuse graph. Secondly, we select the optimal strip size, so as to achieve the tradeoff between stream reuse and stream prefetching. Finally, we propose the efficient strip-mining algorithm, which is implemented in Scompiler. The experiment results show that our strip-mining algorithm is a practical and promising solution to improve SRF locality and hide the memory access overhead effectively on Imagine.