Tiling Nested Loops into Maximal Rectangular Blocks
Journal
Journal of Parallel and Distributed Computing
Journal Volume
35
Journal Issue
2
Pages
123-132
Date Issued
1996
Date
1996
Author(s)
Abstract
In this paper, an approach to tiling 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 tiling, the proposed method is shown to have several advantages as summarized in the conclusions of this paper. © 1996 Academic Press, Inc.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
11.pdf
Size
288.61 KB
Format
Adobe PDF
Checksum
(MD5):448ea31018d977a88de169fd07a5b064