Improving performance by branch reordering
- 1 May 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 130-141
- https://doi.org/10.1145/277650.277711
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Interprocedural conditional branch eliminationPublished by Association for Computing Machinery (ACM) ,1997
- Near-optimal intraprocedural branch alignmentPublished by Association for Computing Machinery (ACM) ,1997
- Avoiding conditional branches by code replicationPublished by Association for Computing Machinery (ACM) ,1995
- Improving the accuracy of static branch prediction using branch correlationPublished by Association for Computing Machinery (ACM) ,1994
- Reducing branch costs via branch alignmentPublished by Association for Computing Machinery (ACM) ,1994
- Predicting conditional branch directions from previous runs of a programPublished by Association for Computing Machinery (ACM) ,1992
- A portable global optimizer and linkerPublished by Association for Computing Machinery (ACM) ,1988
- Toward real-time performance benchmarks for AdaCommunications of the ACM, 1986