Effective Padding of Multi-Dimensional Arrays to Avoid Cache Conflict Misses
Caches are used to significantly improve performance. Even with high degrees of set-associativity, the number of accessed data elements mapping to the same set in a cache can easily exceed the degree of associativity, causing conflict misses and lowered performance, even if the working set is much smaller than cache capacity. Array padding (increasing the size of array dimensions) is a well known optimization technique that can reduce conflict misses. In this paper, we develop the first algorithms for optimal padding of arrays for a set associative cache for arbitrary tile sizes, In addition, we develop the first solution to padding for nested tiles and multi-level caches. The techniques are in implemented in PAdvisor tool. Experimental results with multiple benchmarks demonstrate significant performance improvement from use of PAdvisor for padding.
- Research Organization:
- Pacific Northwest National Laboratory (PNNL), Richland, WA (US)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1339895
- Report Number(s):
- PNNL-SA-115708; KJ0402000
- Country of Publication:
- United States
- Language:
- English
Similar Records
To copy or not to copy: A compile-time technique for assessing when data copying should be used to eliminate cache conflicts
Lightweight Detection of Cache Conflicts
A one`s complement cache memory
Book
·
Thu Dec 30 23:00:00 EST 1993
·
OSTI ID:46236
Lightweight Detection of Cache Conflicts
Conference
·
Fri Feb 23 23:00:00 EST 2018
·
OSTI ID:1617870
A one`s complement cache memory
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:98913