Model-Driven Automatic Tiling with Cache Associativity Lattices

@article{Adjiashvili2015ModelDrivenAT,
  title={Model-Driven Automatic Tiling with Cache Associativity Lattices},
  author={David Adjiashvili and Utz-Uwe Haus and Adrian Tate},
  journal={CoRR},
  year={2015},
  volume={abs/1511.05585}
}
Traditional compiler optimization theory distinguishes three separate classes of cache miss – Cold, Conflict and Capacity. Tiling for cache is typically guided by capacity miss counts. Models of cache function have not been effectively used to guide cache tiling optimizations due to model error and expense. Instead, heuristic or empirical approaches are… CONTINUE READING