Predicting Cache Contention with Setvectors

  title={Predicting Cache Contention with Setvectors},
  author={Michael Zwick and Florian Obermeier and Klaus Diepold},
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. 

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

Predicting inter-thread cache contention on a chip multi-processor architecture

11th International Symposium on High-Performance Computer Architecture • 2005
View 8 Excerpts
Highly Influenced

MCCCSim - A Highly Configurable Multi Core Cache Contention Simulator

M. Zwick, M. Durkovic, F. Obermeier, W. Bamberger, K. Diepold
Technical Report - Technische Universität München, • 2009
View 2 Excerpts

Hitting the memory wall: implications of the obvious

SIGARCH Computer Architecture News • 1995
View 2 Excerpts

Evaluating Associativity in CPU Caches

IEEE Trans. Computers • 1989
View 2 Excerpts

Similar Papers

Loading similar papers…