Compiling with Optimization

Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)


ILDJIT translates the CIL program given as input to its intermediate representation (IR). Several code optimization algorithms can be applied to IR code before producing the correspondent machine code. This chapter starts by describing the general idea behind code optimization algorithms in order to better describe how they can be applied inside the ILDJIT compilation framework, which organizes them in optimization levels.


Code optimizations Code optimization levels Compilation framework extensions 


  1. 1.
    Appel, A.W.: Modern compiler implementation in Java. Cambridge University Press, Cambridge (2002)Google Scholar
  2. 2.
    Aho, A.V., Sethi, R., Ullman, J.D.: Compilers Principles, Techniques and Tools. Prentice Hall, NJ (2003)Google Scholar
  3. 3.
    Campanoni, S., Agosta, G., Crespi-Reghizzi, S., Di Biagio, A. A highly flexible, parallel virtual machine: design and experience of ILDJIT. Software: Practice and Experience. pp. 177–207 (2010)Google Scholar
  4. 4.
    Campanoni, S., Sykora, M., Agosta, G., Crespi-Reghizzi, S. Dynamic look ahead compilation: a technique to hide JIT compilation latencies in multicore environment. International conference on compiler construction. pp. 220–235 (2009)Google Scholar

Copyright information

© Simone Campanoni 2011

Authors and Affiliations

  1. 1.Department of Engineering and Applied SciencesHarvard UniversityCambridgeUSA

Personalised recommendations