Skip to main content
SpringerLink
Log in

Efficient analytical modelling of multi-level set-associative caches

  • Track C3: Computational Science
  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1593))

Included in the following conference series:

Abstract

The time a program takes to execute is significantly affected by the efficiency with which it utilises cache memory. Moreover the cache miss behaviour of a program is highly unstable, in that small changes to input parameters can cause large changes in the number of misses. In this paper we describe novel analytical methods of predicting the cache miss ratio of numerical programs, for sequential hierarchies of setassociative caches. The methods are demonstrated to be applicable to most loop nests. They are also shown to be highly accurate, yet able to be evaluated orders of magnitude faster than a comparable simulation.

This work is funded in part by DARPA contract N66001-97-C-8530, awarded under the Performance Technology Initiative administered by NOSC.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Agarwal, M. Horowitz and J. Hennessy. An analytical cache model. ACM Trans. Comput. Syst., 7(2):184–215, May 1989.

    Article  Google Scholar 

  2. D. H. Bailey, E. Barszcz, J. T. Barton, D. S. Browning, R. L. Carter, D. Dagum, R. A. Fatoohi, P. O. Frederickson, T. A. Lasinski, R. S. Schreiber, H. D. Simon, V. Venkatakrishnan, and S. K. Weeratunga. The NAS Parallel Benchmarks. The International Journal of Supercomputer Applications, 5(3):63–73, Fall 1991.

    Article  Google Scholar 

  3. J. Ferrante, V. Sarkar, and W. Thrash. On estimating and enhancing cache effectiveness. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Proceedings of Languages and Compilers for Parallel Computing, volume 589 of LNCS, pages 328–343, Berlin, Germany, Aug. 1992, Springer.

    Chapter  Google Scholar 

  4. S. Ghosh, M. Martonosi, and S. Malik. Cache miss equations: An analytical representation of cache misses. In Proceedings of the 11th ACM International Conference on Supercomputing, Vienna, Austria, July 1997.

    Google Scholar 

  5. J. S. Harper, D. J. Kerbyson, and G. R. Nudd. Analytical modeling of setassociative cache behavior. To appear in IEEE Transactions on Computers.

    Google Scholar 

  6. D. J. Kerbyson, E. Papaefstathiou, and G. R. Nudd. Application execution steering using on-the-fly performance prediction. In High-Performance Computing and Networking, volume 1401 of LNCS, pages 718–727. Springer, 1998.

    Google Scholar 

  7. M. S. Lam, E. E. Rothberg, and M. E. Wolf. The cache performance and optimizations of blocked algorithms. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 63–74, Santa Clara, California, 1991.

    Google Scholar 

  8. G. R. Nudd, D. J. Kerbyson, e. Papaefstathiou, J. S. Harper, S. C. Perry, and D. V. Wilcox. PACE: A toolset for the performance prediction of parallel and distributed systems. Journal of High Performance and Scientific Applications, 1999.

    Google Scholar 

  9. E. Papaefstathiou, D. J. Kerbyson, G. R. Nudd, D. V. Wilcox, J. S. Harper, and S. C. Perry. A common workload interface for performance prediction of high performance systems. In Workshop on Performance Analysis and its Impact on Design (PAID98), Barcelona, Spain, June 1998.

    Google Scholar 

  10. J. P. Singh, H. S. Stone, and D. F. Thiebaut. A model of workloads and its use in miss-rate prediction for fully associative caches. IEEE Trans. Comput., 41(7):811–825, July 1992.

    Article  Google Scholar 

  11. O. Temam, C. Fricker, and W. Jalby. Cache interference phenomena. In Proceeding of ACM SIGMETRICS, pages 261–271, 1994.

    Google Scholar 

  12. M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In Proceedings of the SIGPLAN '91 Confernce on Programming Language Design and Implementation, volume 26, pages 30–44, June 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. High Performance Systems Group, University of Warwick, CV4 7AL, Coventry, UK

    John S. Harper, Darren J. Kerbyson & Graham R. Nudd

Authors
  1. John S. Harper
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Darren J. Kerbyson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Graham R. Nudd
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Sloot Marian Bubak Alfons Hoekstra Bob Hertzberger

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Harper, J.S., Kerbyson, D.J., Nudd, G.R. (1999). Efficient analytical modelling of multi-level set-associative caches. In: Sloot, P., Bubak, M., Hoekstra, A., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1999. Lecture Notes in Computer Science, vol 1593. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0100608

Download citation

  • DOI: https://doi.org/10.1007/BFb0100608

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65821-4

  • Online ISBN: 978-3-540-48933-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation