Toward a Scalable Working Set Size Estimation Method and Its Application for Chip Multiprocessors

• Published in: IEEE transactions on computers 2014-06, Vol.63 (6), p.1567-1579
• Main Authors: Dani, Aparna Mandke, Amrutur, Bharadwaj, Srikant, Y. N.
• Format: Article
• Language: English
• Subjects: Chip multiprocessors (CMPs); Clocks; Estimation; Monitoring; Radiation detectors; Random access memory; Switches; variable cache associativity; working set size (WSS) estimation
• ISSN: 0018-9340; 1557-9956
• DOI: 10.1109/TC.2012.291

It is essential to accurately estimate the working set size (WSS) of an application for various optimizations such as to partition cache among virtual machines or reduce leakage power dissipated in an over-allocated cache by switching it off. However, the state-of-the-art heuristics such as average memory access latency (AMAL) or cache miss ratio (CMR) are poorly correlated to the WSS of an application due to 1) over-sized caches and 2) their dispersed nature. Past studies focus on estimating WSS of an application executing on a uniprocessor platform. Estimating the same for a chip multiprocessor (CMP) with a large dispersed cache is challenging due to the presence of concurrently executing threads/processes. Hence, we propose a scalable, highly accurate method to estimate WSS of an application. We call this method "tagged WSS (TWSS)" estimation method. We demonstrate the use of TWSS to switch-off the over-allocated cache ways in Static and Dynamic NonUniform Cache Architectures (SNUCA, DNUCA) on a tiled CMP. In our implementation of adaptable way SNUCA and DNUCA caches, decision of altering associativity is taken by each L2 controller. Hence,this approach scales better with the number of cores present on a CMP. It gives overall (geometric mean) 26% and 19% higher energy-delay product savings compared to AMAL and CMR heuristics on SNUCA, respectively.