Sciweavers

Share
CASES
2001
ACM

Combined partitioning and data padding for scheduling multiple loop nests

10 years 3 months ago
Combined partitioning and data padding for scheduling multiple loop nests
With the widening performance gap between processors and main memory, efficient memory accessing behavior is necessary for good program performance. Loop partition is an effective way to exploit the data locality. Traditional loop partition techniques, however, consider only a singleton nested loop. This paper presents multiple loop partition scheduling technique, which combines the loop partition and data padding to generate the detailed partition schedule. The computation and data prefetching are balanced in the partition schedule, such that the long memory latency can be hidden efficiently. Multiple loop partition scheduling explores parallelism among computations, and exploit the data locality between different loop nests as well in each loop nest. Data padding is applied in our technique to eliminate the cache interference, which overcomes the problem of cache conflict misses arisen from loop partition. Therefore, our technique can be applied in architectures with low associativi...
Zhong Wang, Edwin Hsing-Mean Sha, Xiaobo Hu
Added 23 Aug 2010
Updated 23 Aug 2010
Type Conference
Year 2001
Where CASES
Authors Zhong Wang, Edwin Hsing-Mean Sha, Xiaobo Hu
Comments (0)
books