Home > lambdatheultimate > Automatic Staged Compilation

Automatic Staged Compilation

November 29th, 2010 11:36 admin Leave a comment Go to comments

Automatic Staged Compilation, doctoral dissertation of Matthai Philipose:

[...] The past few years have seen the emergence of staged optimization, which produces run-time optimizations that often have much lower run-time overhead than traditional optimizers, yet do not sacrifice any of their functionality. The key to the technique is a method, called staging, to transfer optimization overhead to static compile time from run time. Unfortunately, developing staged variants of individual optimizations has been highly specialized, labor-intensive work; staging pipelines of optimizations even more so.

This dissertation presents a system called the Staged Compilation Framework (SCF), which automatically stages entire pipelines of compiler optimizations at arguably little additional engineering cost beyond building the slower traditional version of the pipeline. SCF harnesses two powerful but traditionally difficult-to-use techniques, partial evaluation and dead-store elimination, to achieve staging. An implementation of SCF shows that staged compilation can speed up pipelines of classical compiler optimizations by up to an order of magnitude, and more commonly by a factor of 4.5 to 5.

I haven’t read through it all yet, but after a cursory skim it certainly looks interesting.

Source: Automatic Staged Compilation

Related Articles:

  1. WebKit Unifies JavaScript Compilation With LLVM Optimizer
  2. .NET Native Compilation Preview Released
  3. Elon Musk Lays Out His Evidence That NYT Tesla Test Drive Was Staged
  4. AMD To Open-Source Its Linux Execution & Compilation Stack
  5. Background Javascript Compilation Boosts Chrome Performance
blog comments powered by Disqus