This resource covers the following topics: Storing values between def and use, Register Allocation, What can be put in a register?, Web-Based Register Allocation, Convex Sets and Live Ranges, Interference, Interference Graph, Register Allocation Using Graph Coloring, Heuristics for Register Coloring, Ideal and Useful Spill Costs, Splitting Rather Than Spilling, Further Optimizations including Register coalescing, Register targeting (pre-coloring), Presplitting of webs, Interprocedural register allocation and various examples related to the topics.