Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches

Abstract

This paper investigates the problem of partitioning a shared cache between multiple concurrently executing applications. The commonly used LRU policy implicitly partitions a shared cache on a demand basis, giving more cache resources to the application that has a high demand and fewer cache resources to the application that has a low demand. However, a… (More)
DOI: 10.1109/MICRO.2006.49

Topics

16 Figures and Tables

Statistics

050100'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

694 Citations

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

See our FAQ for additional information.

Cite this paper

@article{Qureshi2006UtilityBasedCP, title={Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches}, author={Moinuddin K. Qureshi and Yale N. Patt}, journal={2006 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06)}, year={2006}, pages={423-432} }