Loop tiling （or loop blocking） is a well-known loop transformation to improve temporal locality in nested loops which perform matrix computations. When targeting caches that have low associativities, one of the key ...Loop tiling （or loop blocking） is a well-known loop transformation to improve temporal locality in nested loops which perform matrix computations. When targeting caches that have low associativities, one of the key challenges for loop tiling is to simultaneously minimize capacity misses and conflict misses. This paper analyzes the effect of the tile size and the array-dimension size on capacity misses and conflict misses. The analysis supports the approach of combining tile-size selection （to minimize capacity misses） with array padding （to minimize conflict misses）.展开更多
基金This work is sponsored in part by National Science Foundation of USA under Grant Nos.ST-HEC-0444285,CCR-950254,ACI/ITR-0082834 and CCR-9975309,by Indiana 21st Century Fund,and by a donation from Sun Microsystems,Inc.
文摘Loop tiling （or loop blocking） is a well-known loop transformation to improve temporal locality in nested loops which perform matrix computations. When targeting caches that have low associativities, one of the key challenges for loop tiling is to simultaneously minimize capacity misses and conflict misses. This paper analyzes the effect of the tile size and the array-dimension size on capacity misses and conflict misses. The analysis supports the approach of combining tile-size selection （to minimize capacity misses） with array padding （to minimize conflict misses）.
