A Quantitative Algorithm for Data Locality Optimization
A Quantitative Algorithm for Data Locality Optimization
复制标题
数据局部性优化的定量算法
DOI：
--
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
C. Eisenbeis
中科院分区：
文献类型：
--
作者：
F. Bodin;W. Jalby;D. Windheiser;C. Eisenbeis
在本文中，我们考虑了优化循环数组引用的寄存器分配和高速缓存行为的问题。我们利用最初为数据局部性评估和改进而开发的技术。首先，我们回顾了“参考窗口”的概念，它是数据局部性评估和管理的基本工具。然后我们研究了一些循环重构技术(互换、平铺等)有助于提高数据的局部性。描述了一种可在编译系统中有效实现的基于窗口概念的寄存器分配算法和高速缓存使用优化算法。在RISC处理器IBM RS/6000上的实验加速比测量证明了我们技术的有效性。
In this paper, we consider the problem of optimizing register allocation and cache behavior for loop array references. We exploit techniques developed initially for data locality estimation and improvement. First we review the concept of “reference window” that serves as our basic tool for both data locality evaluation and management. Then we study how some loop restructuring techniques (interchanging, tiling, ...) can help to improve data locality. We describe a register allocation algorithm and a cache usage optimization algorithm based on the window concept which can be effectively implemented in a compiler system. Experimental speedup measurements on a RISC processor, the IBM RS/6000, give evidence of the efficiency of our technique.