In recent years, loop tiling has become an increasingly popular techniques for increasing cache effectiveness. This is acomplished by transforming a loop nest so that the temporal and aspatial locality can be better exploited for a given cache size. However, his oprimization only targets the recuctin fo capacity misses. As recenly demonstrated by sevelar groups of researches, conlict mises can still preclude effective cache utilization. Moreover, the severity of cache conclicts can vary greatly with slight variations in problem size and starting addresses, making, performance difficult to even predict, let alone optimize. to reduce confligts can vray greatly with slight varions in problem size and starting adresses, making performance sifficult misses, data copying has been proposed. With this technique, data layout in cache is adjusted by copying array tiles into temporary arrays that exhibit better cache behavior. Although copying has beed proposed . With tehisn techniques,