Set Utilization Based Dynamic Shared Cache Partitioning

Abstract

Abstract-As the number of processors sharing a cache increases, conflict misses due to interference amongst competing processes have an increasing impact on the individual performance of processes. Cache partitioning is a method of allocating a cache between concurrently executing processes in order to counteract the effects of inter-process conflicts. However, cache partitioning methods commonly divide a shared cache into private partitions dedicated to a single processor, which can lead to underutilized portions of the cache when set accesses are non-uniform.Our proposed method compliments these cache partitioning algorithms by creating an additional shared partition able to be shared amongst all processors. Underutilized areas of the cache are identified by a monitoring circuit and used for the shared partition. Detection of underutilization is based on the number of unique set accesses for a given allocated way. For a 16-way set associative cache, the implementation of our method requires 64 bytes of storage overhead per core in addition to that needed for the method that determines the sizes of the private partitions. For the tested system, our method is able to improve performance over the traditional LRU policy for a number of selected benchmark sets by an average of 1.4% and up to 13.3% for a two core system and an average of 1.4% and up to 7.8% for a four core system, and is able to improve the performance of a conventional cache partitioning method (Utility-Based Cache Partitioning) by an average of 0.1% and up to 0.5% for both a two and four core systems.

Behavior Aware Data Locality for Caches

“…Vantage was derived from analytical models, which allowed it to provide different degrees of isolation by varying the size of the unmanaged region. Deayton et al [22] created an additional shared partition able to be shared amongst all processors, which underutilized areas of the cache are identified by monitoring circuit and used for the shared partition. Detection of underutilization is based on the number of unique set accesses for a given allocated way.…”

“…Such as cache bypassing [2], victim caches [3], stream buffers [3], optimizing default least-recently-used (LRU) cache replacement policy [4][15] [16], which contains insertion policy [5][6] [7][8] [23] and promotion policy [9], and partitioning cache resources among parallel running applications in multicore processors [10] [11][21] [22], which contains static partitioning [13] [20] and dynamic partitioning [12] [14] and so on.…”

A review on shared resource contention in multicores and its mitigating techniques

“…Next, Deayton and Chung (2011) present an idea of shared partitioning of unused ways. The work includes implementing an additionally shared partition amongst processors.…”