Cache Optimization Methodologies and Automation

  • Francky Catthoor
  • Koen Danckaert
  • Chidamber Kulkarni
  • Erik Brockmeyer
  • Per Gunnar Kjeldsberg
  • Tanja Van Achteren
  • Thierry Omnes
Chapter

Abstract

Architectural techniques for reducing cache misses are expensive to implement and they do not have a global view of the complete program which limits their effectiveness. Thus compiler optimizations are the most attractive alternative which can overcome both the above shortcomings of a hardware implementation. In this chapter, we will investigate the current state-of-the-art in compiler optimizations for caching. Afterwards, we propose a stepwise methodology which allows a designer to perform a global optimization of the program for a given cache organization. Then each of the main cache related steps will be studied in more detail including both problem formulations and techniques to solve them. The effectiveness of these automatable techniques will be substantiated by realistic demonstrators.

Keywords

Main Memory Cache Size Data Cache Memory Hierarchy Tile Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Francky Catthoor
    • 1
  • Koen Danckaert
    • 1
  • Chidamber Kulkarni
    • 1
  • Erik Brockmeyer
    • 1
  • Per Gunnar Kjeldsberg
    • 2
  • Tanja Van Achteren
    • 3
  • Thierry Omnes
    • 1
  1. 1.IMECLeuvenBelgium
  2. 2.Norwegian Univ. of Sc. and Tech. (NTNU)TrondheimNorway
  3. 3.Katholieke Universiteit LeuvenLeuvenBelgium

Personalised recommendations