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

The University of Texas at Austin

Indexed incrossref

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 higher demand for cache resources does not always correlate with a higher performance from additional cache resources. It is beneficial for performance to invest cache resources in the application that benefits more from the cache resources rather than in the application that has more demand for the cache resources. This paper proposes utility-based cache…

Citation impact

1,090
total citations
FWCI
28.42
Percentile
100%
References
26
Citations per year

Authors

2

Topics & keywords

Keywords
  • Cache
  • Computer science
  • Cache pollution
  • Cache invalidation
  • Cache algorithms
  • Smart Cache
  • Cache coloring
  • Page cache
No related works found for this paper.