This is an advanced graduate course in compiler technology. The course has several goals. First, it aims to develop a fundamental understanding of the major approaches to program analysis and optimization. Second, it aims to help students understand published research on various novel compiler techniques. Third, during the duration of the course, the students will solve a significant compiler problem, which includes reading the literature and implementing the solution in a real-world compiler, such as LLVM. Finally, the students will learn about recent research directions.
2/14/2019: The MP2 is released!
2/14/2019: Final date: last day of classes
1/22/2019: The MP1 is released!
1/06/2019: The website is up!
This is an advanced graduate reasearch-oriented course. It will include lectures, reading literature and original materials, and a substational research project. We will compute the final grade using the following table:
Activity | Grade | Details |
---|---|---|
Miniquizzes | 10% |
|
Midterm | 15% |
|
Final | 25% |
|
Project | 50% |
|
Extra Credit | 10% | TBD |
Date | Topic | Notes |
---|---|---|
1/15 | Introduction and Control-Flow Review |
Slides |
1/17 | SSA 1 |
Slides |
1/22 | SSA 2 Project 1 out (skeleton) |
Slides |
1/24 | SSA 3 | Slides |
1/29 | SSA Optimizations |
Slides |
1/31 | Iterative Dataflow Framework 1 |
Slides |
2/5 | Iterative Dataflow Framework 2 | Slides |
2/7 | No class (work on the project) |
|
2/12 | No class (work on the project) | |
2/14 | Iterative Dataflow Framework 3 Project 1 due. Project 2 out. |
Slides |
2/19 | Iterative Dataflow Framework 4 |
Slides |
2/21 | Iterative Dataflow Framework 5 |
Slides |
2/26 | Dependence Analysis 1 |
Slides |
2/28 | Dependence Analysis 2 |
Slides |
3/5 | Dependence Transformations 1 |
Slides |
3/7 | Dependence Transformations 2 |
Slides |
3/12 | Compiler Testing and Validation |
Slides |
3/14 | Midterm |
|
3/19 | Spring Break |
|
3/21 | Spring Break |
|
3/26 | Pointer Analysis 1 |
Slides |
3/28 | Pointer Analysis 2 |
Slides |
4/2 | Interprocedural Analysis 1 |
Slides |
4/4 | Interprocedural Analysis 2 |
Slides |
4/9 | Abstract Interpretation 1 |
Slides |
4/11 | Abstract Interpretation 2` |
Slides |
4/16 | Compilation of Approximate and Probabilistic Programs |
|
4/18 | Compiler Infrastructures for Machine Learning |
|
4/23 | Efficient Compling: Autotuning and Synthesis |
Slides |
4/25 | Efficient Compiling: JIT, Virtual Machines |
Slides |
4/30 | Final Exam (in-class) |