Collective Loop Fusion for Array Contraction
Collective Loop Fusion for Array Contraction
复制标题
用于数组收缩的集体循环融合
DOI：
--
复制
发表时间：
1992
期刊：
影响因子：
--
通讯作者：
R. Thekkath
中科院分区：
文献类型：
--
作者：
G. Gao;R. Olsen;Vivek Sarkar;R. Thekkath
在本文中，我们提出了一种专门设计用于增加数组收缩机会的循环融合算法。数组收缩是一种将数组变量转换为循环嵌套内的标量变量的优化。与数组元素相比，标量变量具有更好的缓存行为，并且可以分配到寄存器。在过去的工作中，我们研究了循环交换和循环反转作为增加数组收缩机会的优化[13]。本文通过包含循环融合优化来扩展这项工作。本文讨论的融合方法使用maxflow-mincut算法进行循环聚类。我们的集体循环融合算法非常高效，并且我们通过一个简单的示例演示了它对于数组收缩的有用性。
In this paper we propose a loop fusion algorithm specifically designed to increase opportunities for array contraction. Array contraction is an optimization that transforms array variables into scalar variables within a loop nest. In contrast to array elements, scalar variables have better cache behavior and can be allocated to registers. In past work we investigated loop interchange and loop reversal as optimizations that increase opportunities for array contraction [13]. This paper extends this work by including the loop fusion optimization. The fusion method discussed in this paper uses the maxflow-mincut algorithm to do loop clustering. Our collective loop fusion algorithm is efficient, and we demonstrate its usefulness for array contraction with a simple example.