Skip to main content

Caches with Compositional Performance

  • Chapter
  • First Online:
Book cover Embedded Processor Design Challenges (SAMOS 2001)

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

Included in the following conference series:

Abstract

One of the challenges in designing systems is adopting a design method with compositional properties. Compositional functionality guarantees that two components that each perform a task can be integrated without affecting the semantics of either task. Compositional performance means that two components can be integrated so that the timing of neither components changes. In this paper we describe the hardware and software needed in order to build cache memories that have those compositional properties. This partitioned cache allows the system designer to design individual components of an application program in the knowledge that cache performance is fully deterministic; ie. integrating these components will not affect the performance of any component.

This work supported by EPSRC grant GR/L78970.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Smith. A Comparative Study of Set Associative Memory Mapping Algorithms and Their Use for Cache and Main Memory. IEEE Transactions on Software Engineering, March 1978.

    Google Scholar 

  2. N. Jouppi. Improving Direct-Mapped Cache Performance by the Addition of a Small Fully-Associative Cache and Prefetch Buffer. In 17th International Symposium on Computer Architecture, pp 364–373, June 1990.

    Google Scholar 

  3. J. Peterson and K. Hammond, editors. Report on the Porgramming Language Haskell. Yale University, 1996.

    Google Scholar 

  4. Inmos Ltd. Occam-2 Reference Manual. Prentice Hall, 1988.

    Google Scholar 

  5. J. Kowalik. Parallel MIMD Computation: The HEP Supercomputer and its Applications. MIT Press, 1985.

    Google Scholar 

  6. R. Nikhil, G. Papadopoulos, and Arvind. T: A Multithreaded Massively Parallel Architecture. In 19th International Symposium on Computer Architecture, pp 156–167, May 1992.

    Google Scholar 

  7. R. Wagner. Compiler-Controlled Cache Mapping Rules. Technical Report CS-1995-31, Duke University, December 1995.

    Google Scholar 

  8. T. Juan, D. Royo, and J. Navarro. Dynamic Cache Splitting. 15th International Conference of the Chilean Computational Society, 1995.

    Google Scholar 

  9. D. Kirk. SMART (Strategic Memory Allocation for Real-Time) Cache Design. In IEEE Symposium on Real-Time Systems, pp 229–237, December 1989.

    Google Scholar 

  10. F. Mueller. Compiler Support for Software-Based Cache Partitioning. In ACM SIGPLAN Workshop on Language, Compiler, and Tool Support for Real-Time Systems, pp 137–145, June 1995.

    Google Scholar 

  11. D. May and H. Muller. Cache Memory. Patent Number WO045269, August 2000.

    Google Scholar 

  12. J. Carter, W. Hseih, L. Stoller, M. Swanson, L. Zhang, E. Brunvard, A. Davis, C. Kuo, R. Kuramkote, M. Parker, L. Schaelicke, and T. Tateyama. Impulse: Building a Smarter Memory Controller. 5th Conference on High Performance Computer Architecture, January 1999.

    Google Scholar 

  13. A. Ki and A. Knowles. Secondary Cache Data Prefetching for Multiprocessors. Technical Report UMCS-97-3-1, Department of Computer Science, University of Manchester, 1997.

    Google Scholar 

  14. J. Fu, J. Patel, and B. Janssens. Stride Directed Prefetching in Scalar Processors. In 25th International Symposium on Microarchitecture, pp 102–110, 1992.

    Google Scholar 

  15. J. Irwin. Systems With Predictable Caching. PhD thesis, Department of Computer Science, University of Bristol, 2001.

    Google Scholar 

  16. D. Page. Effective Use of Partitioned Cache Memories. PhD thesis, Department of Computer Science, University of Bristol, 2001.

    Google Scholar 

  17. F. McMahon. The Livermore Fortran Kernels: A Computer Test Of The Numerical Performance Range. Lawrence Livermore National Laboratory, Livermore, California, December 1986.

    Google Scholar 

  18. R. Arnold. Bounding Instruction Cache Performance. Master’s thesis, Department of Computer Science, Florida State University, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Muller, H., Page, D., Irwin, J., May, D. (2002). Caches with Compositional Performance. In: Deprettere, E.F., Teich, J., Vassiliadis, S. (eds) Embedded Processor Design Challenges. SAMOS 2001. Lecture Notes in Computer Science, vol 2268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45874-3_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45874-3_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45874-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics