Lecture
Register Allocation Using Graph Coloring
Related lectures (32)
Integer Programming Basics
Introduces the basics of integer programming, including binary integer programs and constraint strategies.
Register Allocation: Tail Calls
Covers register allocation techniques, including interference graph examples, coloring, spilling, and coalescing.
Solving Linear Programs: SIMPLEX Method
Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.
Simplex Algorithm: Basics
Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.
Graph Coloring III
Explores properties of clusters and colorability threshold in graph coloring, including average connectivity and rigidity.
Linear Programming Duality
Explores the concept of duality in linear programming and its practical implications in optimization.
Optimization Programs: Piecewise Linear Cost Functions
Covers the formulation of optimization programs for minimizing piecewise linear cost functions.
Closure Conversion and Dataflow Analysis
Explores closure conversion, function hoisting, and dataflow analysis for program optimization.
Optimization: Register Allocation
Covers advanced compiler construction topics on optimization techniques like dead code elimination, constant folding, and register allocation.
Linear Programming: Optimization and Constraints
Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.