— Code Generation & Optimization
Compiler optimizations for performance, code size and power reduction. Topics include control- and data-flow analysis, redundancy elimination, loop and cache optimizations, register allocation, local and global instruction scheduling, and modulo scheduling.
Topics
- control- and data-flow analysis
- redundancy elimination
- loop and cache optimizations
- register allocation
- local and global instruction scheduling
- and modulo scheduling
Topics explicitly listed in official catalogue description
Prerequisites & course information
Course Description: Compiler optimizations for performance, code size and power reduction. Topics include control- and data-flow analysis, redundancy elimination, loop and cache optimizations, register allocation, local and global instruction scheduling, and modulo scheduling. Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Open to Graduate Students in Computer Science only. Grade Mode: Letter. Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Open to Graduate Students in Computer Science only. Grade Mode: Letter.
Sources
- Course catalogue ↗2026-2027