Predicting Cache Contention with Setvectors
Michael E. Zwick, Florian Obermeier, Klaus J. Diepold · 2010
Abstract—In this paper, we present a new method called setvectors to predict cache contention introduced by co-scheduled applications on a multicore processor system. Additionally, we propose a new metric to compare cache contention prediction methods. Applying this metric, we demonstrate that our setvector method predicts cache contention with about the same accuracy as the most accurate stateof-the-art method. However, our method executes nearly 4000 times as fast.