Advertisement

Setvectors – An Efficient Method to Predict Cache Contention

  • Michael ZwickEmail author
Chapter
  • 675 Downloads
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 70)

Abstract

In this chapter, I present a new method called Setvectors to predict cache contention introduced by co-scheduled applications on a multicore processor system. Additionally, I propose a new metric to compare cache contention prediction methods. Applying this metric, I demonstrate that the Setvector method predicts cache contention with about the same accuracy as the most accurate state-of-the-art method. However, the Setvector method executes nearly 4000 times as fast. This chapter is a revised and extended version of Zwick et al. (Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, pp. 244–251, 2010), presented at the MultiConference of Engineers and Computer Scientists in Hong Kong.

Keywords

Cache contention Co-scheduling Setvectors 

References

  1. 1.
    Chandra, D., Guo, F., Kim, S., Solihin, Y.: Predicting inter-thread cache contention on a chip multi-processor architecture. In: Proceedings of the 11th Int’l Symposium on High-Performance Computer Architecture (HPCA-11 2005) (2005) Google Scholar
  2. 2.
    Fedorova, A.: Operating system scheduling for chip multithreaded processors. PhD thesis, Harvard University, Cambridge, Massachusetts (2006) Google Scholar
  3. 3.
    Hill, M.D., Smith, A.J.: Evaluating associativity in CPU caches. IEEE Trans. Comput. 38, (1989) Google Scholar
  4. 4.
    Luk, C.-K., Cohn, R., Muth, R., Patil, H., Klausner, A., Lowney, G., Wallace, S., Reddi, V.J., Hazelwood, K.: Pin: Building customized program analysis tools with dynamic instrumentation. In: Programming Language Design and Implementation (2005) Google Scholar
  5. 5.
    Mattson, R.L., Gecsei, J., Slutz, D.R., Traiger, I.L.: Evaluation techniques for storage hierarchies. IBM Syst. J. 9, (1970) Google Scholar
  6. 6.
    Settle, A., Kihm, J.L., Janiszewski, A., Connors, D.A.: Architectural support for enhanced SMT job scheduling. In: Proceedings of the 13th International Conference of Parallel Architectures and Compilation Techniques (2004) Google Scholar
  7. 7.
    Wulf, W.A., McKee, S.A.: Hitting the memory wall: implications of the obvious. Comput. Arch. News 23(1), (1995) Google Scholar
  8. 8.
    Zwick, M., Obermeier, F., Diepold, K.: Predicting cache contention with setvectors. In: Lecture Notes in Engineering and Computer Science: Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010, Hong Kong, 17–19 March 2010, pp. 244–251 (2010) Google Scholar
  9. 9.
    Zwick, M., Durkovic, M., Obermeier, F., Diepold, K.: Setvectors for memory phase classification. In: International Conference on Computer Science and its Applications (ICCSA’09) (2009) Google Scholar
  10. 10.
    Zwick, M., Durkovic, M., Obermeier, F., Bamberger, W., Diepold, K.: MCCCSim – A highly configurable multi core cache contention simulator. Technical Report – Technische Universität München. https://mediatum2.ub.tum.de/doc/802638/802638.pdf, 2009

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  1. 1.Lehrstuhl für DatenverarbeitungTechnische Universität MünchenMunichGermany

Personalised recommendations