CS-5544: Compiler Optimizations
Description: Overview of compilation and compiler optimizations. Design and internal organization of the Low-Level Virtual Machine compiler infrastructure. Static Single Assignment. Data-flow analysis and techniques for reaching definitions, live variable analysis, and available expressions. Lattice theory and iterative algorithms for general frameworks. Non-separable dataflow analysis including constant propagation and folding, faint variable analysis, and points-to may/must analysis. Loop-invariant code motion and lazy code motion. Static Single Assignment construction and optimizations. Register allocation and coalescing. Pointer analysis using Anderson’s and Steensgaard’s algorithms, and liveness analysis of heap data. Pre: Graduate standing.
Pathways: N/A
Course Hours: 3 credits
Sections Taught: 3
Average GPA: 3.76 (A)
Strict A Rate (No A-) : 55.83%
Average Withdrawal Rate: 0.00%
| Binoy Ravindran | 2024 | 75.8% | 24.2% | 0.0% | 0.0% | 0.0% | 0.0% | 3.76 | 3 |