Show simple item record

dc.contributor.authorRamaswamy, Subramanian
dc.contributor.authorYalamanchili, Sudhakar
dc.date.accessioned2007-05-11T19:56:51Z
dc.date.available2007-05-11T19:56:51Z
dc.date.issued2007
dc.identifier.urihttp://hdl.handle.net/1853/14353
dc.description.abstractThe central data structures for many applications in scientific computing are large multidimensional arrays. These arrays dominate memory accesses and are often accessed with strides that vary across orthogonal dimensions posing a central and critical challenge to develop effective caching strategies. We propose a novel technique to optimize cache placement for multidimensional arrays with the focus on minimizing conflict misses in the cache hierarchy. We propose architectural extensions for adaptive cache placement that are exercised under software control to reduce conflict misses for various access patterns to array data structures. Adaptive cache placement complements existing compiler optimizations, offering a new degree of freedom in optimizing the memory system performance and can be used by dynamic optimizers. Our implementation is compared to traditional caches for a range of common scientific loop based kernels and applications, and is observed to reduce, and in some cases, eliminate conflict misses in the L2 cache to array data structures. We explore the effect of cache parameters such as cache size and associativity on global miss rates, average memory access time, area and power for these benchmarks.en
dc.language.isoen_USen
dc.publisherGeorgia Institute of Technologyen
dc.relation.ispartofseriesCERCS;GIT-CERCS-07-03en
dc.subjectAdaptive cache placementen
dc.subjectCaching strategiesen
dc.subjectData structuresen
dc.subjectConflict missesen
dc.subjectMultidimensional arraysen
dc.subjectOptimizationen
dc.titleAdaptive Cache Placement for Scientific Computationen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record