On the Near-Optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling
Modern architectures allow multiple instructions to be issued at once and have other complex features. To account for this, compilers perform instruction scheduling after generating the output code. The instruction scheduling problem is to find an optimal schedule given the limitations and capab...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
University of Waterloo
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/2936 |