Code scheduling and register allocation in large basic blocks
James R. Goodman, Wei‐Chung Hsu · 2014
We discuss the issues about the interdependency between code scheduling and register allocation. We present two methods as solutions: (1) an integrated code scheduling technique; and (2) a DAG-driven register allocator. The integrated code scheduling method combines two scheduling techniques—one to reduce pipeline delays and the other to minimize register usage—into a single phase. By keeping track of the number of available registers, the scheduler can choose the appropriate scheduling technique to schedule a better code sequence. The DAG-driven register allocator uses a dependency graph to assist in assigning registers; it introduces much less extra dependency than does an ordinary register allocator. For large basic blocks, both approaches were shown to generate more efficient code sequences than conventional techniques in the simulations.
Cited by 177 works. doi:10.1145/2591635.2667158
Authors
References
- Compilers: Principles, Techniques, and Tools
- Trace Scheduling: A Technique for Global Microcode Compaction
- The Generation of Optimal Code for Arithmetic Expressions
- The Architecture of Pipelined Computers
- Detection and Parallel Execution of Independent Instructions
- Advanced compiler optimizations for supercomputers
- Bulldog: A Compiler for VLIW Architectures
- Design of a Computer—The Control Data 6600
- VLSI Processor Architecture
- Postpass Code Optimization of Pipeline Constraints