Optimizing delayed branches
- 1 December 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMICRO Newsletter
- Vol. 13 (4) , 114-120
- https://doi.org/10.1145/1014194.800941
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Code generation and reorganization in the presence of pipeline constraintsPublished by Association for Computing Machinery (ACM) ,1982
- The 801 minicomputerPublished by Association for Computing Machinery (ACM) ,1982
- Compilers and Computer ArchitectureComputer, 1981
- MIPS: A VLSI Processor ArchitecturePublished by Springer Nature ,1981
- Analysis and performance of computer instruction sets [Thesis]Published by Office of Scientific and Technical Information (OSTI) ,1978