Optimizing delayed branches
Thomas R. Gross, John LeRoy Hennessy · ACM SIGMICRO newsletter/SIGMICRO newsletter/SIGMICRO, TCMICRO newsletter · 1982
Delayed branches are commonly found in micro-architectures. A compiler or assembler can exploit delayed branches. This is achieved by moving code from one of several points to the positions following the branch instruction. We present several strategies for moving code to utilize the branch delay, and discuss the requirements and benefits of these strategies. An algorithm for processing branch delays has been implemented and we give empirical results. The performance data show that a reasonable percentage of these delays can be avoided.
Cited by 72 works. doi:10.1145/1014194.800941
Authors
References
- The 801 minicomputer
- RISC I
- The Inhibition of Potential Parallelism by Conditional Jumps
- Analysis and performance of computer instruction sets
- MIPS: A VLSI Processor Architecture
- Compilers and Computer Architecture
- MIPS
- Code generation and reorganization in the presence of pipeline constraints
- 2 n -way jump microinstruction hardware and an effective instruction binding method
- Analysis and performance of computer instruction sets [Thesis]