Optimal Worst Case Formulas Comparing Cache Memory Associativity

@article{Lennerstad2000OptimalWC,
  title={Optimal Worst Case Formulas Comparing Cache Memory Associativity},
  author={H{\aa}kan Lennerstad and Lars Lundberg},
  journal={SIAM J. Comput.},
  year={2000},
  volume={30},
  pages={872-905}
}
In this paper we derive a worst case formula comparing the number of cache hits for two different cache memories. From this various other bounds for cache memory performance may be derived. Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The first cache is set-associative or direct-mapped. It has k sets and u blocks in each set; this is called a (k, u)-cache. The other is a fully associative cache with q blocks—a (1, q)-cache. We derive… CONTINUE READING