Combinatorial Problems in Compiler Optimization
Several important compiler optimizations such as instruction scheduling and register allocation are fundamentally hard and are usually solved using heuristics or approximate solutions. In contrast, this thesis examines optimal solutions to three combinatorial problems in compiler optimization. The f...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/7423 |