.png){kind=icon}
返回
Tiling nested loops into maximal rectangular blocks
.png){kind=icon}
OA
AI
DOI：10.1006/jpdc.1996.0075.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, an approach to thing nested loops for maximizing parallelism is proposed, The proposed method aims at aggregating independent computations of a loop nest into rectangular blocks and maximizing the block sizes for maximizing parallelism, At first, all the independent computations that can be executed in the first time unit are identified. These computations are called the initially independent computations, Then it is shown that all of them can be collected as a union of rectangular blocks, So, based on these, the entire iteration space of the loops is partitioned into rectangular blocks for maximizing parallelism, The proposed method is formulated as systematic procedures which can easily be implemented in a parallelizing compiler, It is shown that when the wavefront transformation is combined with the proposed method, the loops can always be tiled so that the tile size is greater than one. In comparison with previous work on thing, the proposed method is shown to have several advantages as summarized in the conclusions of this paper. (C) 1996 Academic Press, Inc.
Keyword:
UNIFORM DEPENDENCIES
TRANSFORMATION
ALGORITHMS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
