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.
No takes yet. Share an insight, caveat, or question.
Gross et al. (1982) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: