Manikantan, R and Rajan, Kaushik and Govindarajan, R (2012) Probabilistic Shared Cache Management (PriSM). In: 39th Annual International Symposium on Computer Architecture (ISCA), JUN 09-13, 2012 , Portland, OR, USA, pp. 428-439.
isca_2012.pdf - Published Version
Restricted to Registered users only
Download (218Kb) | Request a copy
Effective sharing of the last level cache has a significant influence on the overall performance of a multicore system. We observe that existing solutions control cache occupancy at a coarser granularity, do not scale well to large core counts and in some cases lack the flexibility to support a variety of performance goals. In this paper, we propose Probabilistic Shared Cache Management (PriSM), a framework to manage the cache occupancy of different cores at cache block granularity by controlling their eviction probabilities. The proposed framework requires only simple hardware changes to implement, can scale to larger core count and is flexible enough to support a variety of performance goals. We demonstrate the flexibility of PriSM, by computing the eviction probabilities needed to achieve goals like hit-maximization, fairness and QOS. PriSM-HitMax improves performance by 18.7% over LRU and 11.8% over previously proposed schemes in a sixteen core machine. PriSM-Fairness improves fairness over existing solutions by 23.3% along with a performance improvement of 19.0%. PriSM-QOS successfully achieves the desired QOS targets.
|Item Type:||Conference Proceedings|
|Additional Information:||Copyright for theis article belongs to IEEE|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Division of Information Sciences > Supercomputer Education & Research Centre
|Date Deposited:||08 Nov 2012 11:17|
|Last Modified:||08 Nov 2012 11:19|
Actions (login required)