Improving Cache Management Policies Using Dynamic Reuse Distances

@article{Duong2012ImprovingCM,
  title={Improving Cache Management Policies Using Dynamic Reuse Distances},
  author={Nam Duong and Dali Zhao and Taesu Kim and Rosario Cammarota and Mateo Valero and Alexander V. Veidenbaum},
  journal={2012 45th Annual IEEE/ACM International Symposium on Microarchitecture},
  year={2012},
  pages={389-400}
}
Cache management policies such as replacement, bypass, or shared cache partitioning have been relying on data reuse behavior to predict the future. This paper proposes a new way to use dynamic reuse distances to further improve such policies. A new replacement policy is proposed which prevents replacing a cache line until a certain number of accesses to its cache set, called a Protecting Distance (PD). The policy protects a cache line long enough for it to be reused, but not beyond that to… CONTINUE READING

15 Figures & Tables

Topics

Statistics

0102030201320142015201620172018
Citations per Year

103 Citations

Semantic Scholar estimates that this publication has 103 citations based on the available data.

See our FAQ for additional information.