Improving Cache Management Policies Using Dynamic Reuse Distances Nam Duong1, Dali Zhao1, Taesu Kim1, Rosario Cammarota1, Mateo Valero2, Alexander V. Veidenbaum1 1University of California Irvine, 2Universitat Politecnica de Catalunya and Barcelona Supercomputing Center Proposed new cache replacement and partitioning policies with a better balance between reuse and pollution Cache lines must be kept long enough to be reused Cache lines pollute the cache if kept too long without reuse Introduced a new concept, Protecting Distance (PD), that is based on a reuse distance balancing reuse and pollution An inserted line cannot be evicted for PD accesses to its set Can be guaranteed if cache bypass is used Developed single- and multi-core hit rate models as a function of PD, cache configuration and program behavior The models’ inputs are collected during execution and used to dynamically compute the PD maximizing hit rate For multi-core shared cache the partitioning problem is shown to be solved by computing a set of pre-thread PDs Showed that PD-based cache management policies improve performance for both single- and multi-core systems PD