Handling Global Constraints in Compiler Strategy

  • Authors:

  • Erven Rohou;François Bodin;Christine Eisenbeis;André Seznec

  • Affiliations:

  • ST Microelectronics, 60 Rue Lavoisier, 38330 Mont Bonnot St. Martin, France. Erven.Rohou@st.com;IRISA, Campus Universitaire de Beaulieu, 35042 Rennes, France. {Bodin,Seznec}@irisa.fr;INRIA Centre de Rocquencourt, Domaine de Voluceau-Rocquencourt, BP 105, 78153 Le Chesnay, France. Christine.Eisenbeis@inria.fr;IRISA, Campus Universitaire de Beaulieu, 35042 Rennes, France. {Bodin,Seznec}@irisa.fr

  • Venue:
  • International Journal of Parallel Programming
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

To achieve high-performance on processors featuring ILP, most compilers apply locally a set of heuristics. This leads to a potentially high-performance on separate code fragments. Unfortunately, most optimizations also increase code size, which may lead to a global net performance loss. In this paper, we propose a Global Constraints-Driven Strategy (GCDS) for guiding code optimization. When using GCDS, the final code optimization decision is taken according to global criteria rather than local criteria. For instance, such criteria might be performance, code size, instruction cache behavior, etc. The performance/code size trade-off is a particularly important problem for embedded systems. We show how GCDS can be used to master code size while optimizing performance.