Contents
I.3. Basics on instruction-level parallelism processor architectures
Part 1 Prolog: Optimizing Compilation
1 On The Decidability Of Phase Ordering In Optimizing Compilation
1.1. Introduction to the phase ordering problem
1.2. Background on phase ordering
1.3. Toward a theoretical model for the phase ordering problem
1.4. Examples of decidable simplified cases
1.5. Compiler optimization parameter space exploration
1.6. Conclusion on phase ordering in optimizing compilation
2 Instruction Scheduling Problems And Overview
2.1. VLIW instruction scheduling problems
2.3. Instruction scheduling and register allocation
3 Applications Of Machine Scheduling To Instruction Scheduling
3.1. Advances in machine scheduling
3.2. List scheduling algorithms
3.3. Time-indexed scheduling problem formulations
4 Instruction Scheduling Before Register Allocation
4.1. Instruction scheduling for an ILP processor: case of a VLIW architecture
4.2. Large neighborhood search for the resource-constrained modulo scheduling problem
4.3. Resource-constrained modulo scheduling problem
4.4. Time-indexed integer programming formulations
4.5. Large neighborhood search heuristic
5 Instruction Scheduling After Register Allocation
5.2. Local instruction scheduling
Get Advanced Backend Optimization now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.