Fast, Effective Dynamic Compilation

J. Auslander, M. Philipose, C. Chambers, S. Eggers, and B. Bershad.

Department of Computer Science and Engineering
University of Washington

In the proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), May 1996, pp. 149-158.

ACM's Copyright Policy.

  • PostScript (190kB)
  • Compressed PostScript (compress, 83kB)
  • Compressed PostScript (gzip, 58kB)
  • PDF (80kB)
  • To save the paper to a file using Netscape Navigator, right click on one of the links at the left and select "Save Link As..."


    Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these run- time constants, a dynamic compiler can eliminate their memory loads, perform constant propagation and folding, remove branches they determine, and fully unroll loops they bound. However, the performance benefits of the more efficient, dynamically-compiled code are offset by the run-time cost of the dynamic compile. Our approach to dynamic compilation strives for both fast dynamic compilation and high-quality dynamically-compiled code: the programmer annotates regions of the programs that should be compiled dynamically; a static, optimizing compiler automatically produces pre-optimized machine-code templates, using a pair of dataflow analyses that identify which variables will be constant at run-time; and a simple, dynamic compiler copies the templates, patching in the computed values of the run-time constants, to produce optimized, executable code. Our work targets general- purpose, imperative programming languages, initially C. Initial experiments applying dynamic compilation to C programs have produced speedups ranging from 1.2 to 1.8.

    Last updated June 17, 1997.
    Brian Grant (