Name
Abstract | ||
|---|---|---|
Dynamic Mapping is an approach to cope with the loss of performance due to cache interference and to improve performance predictability of blocked algorithms for modern architectures. An example is matrix multiply: tiling matrix multiply for a data cache of 16KB using optimal tile size achieves an average data-cache miss rate of 3%, but with peaks of 16% due to interference. Dynamic Mapping is a software-hardware approach where the mapping in cache is determined at compile time, by manipulating the address used by the data cache. The reduction of cache misses translates into a 2-fold speed-up for matrix multiply and FFT by eliminating data-cache miss spikes. Dynamic mapping has the same goal as other proposed approaches, but it determines the cache mapping before issuing a load. It uses the computational power of the processor - instead of the memory controller or the data cache mapping - and it has no effect on the access time of memory and cache. It is an approach combining several concepts, such as nonstandard cache mapping functions and data layout reorganization and, potentially, without any overhead. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-24644-2_28 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Cache-oblivious algorithm,Cache invalidation,Cache pollution,Cache,Snoopy cache,Computer science,Parallel computing,Cache algorithms,Cache coloring,Smart Cache | Conference | 2958 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.39 |
References | Authors | |
24 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paolo D’Alberto | 1 | 2 | 0.39 |
| Alexandru Nicolau | 2 | 2265 | 307.74 |
| Alexander V. Veidenbaum | 3 | 757 | 78.24 |