This Article 
 Bibliographic References 
 Add to: 
Dynamic Predication of Indirect Jumps
July-December 2007 (vol. 6 no. 2)
pp. 25-28
Indirect jumps are used to implement increasingly common programming language constructs such as virtual function calls, switch-case statements, jump tables, and interface calls. Unfortunately, the prediction accuracy of indirect jumps has remained low because many indirect jumps have multiple targets that are difficult to predict even with specialized hardware. This paper proposes a new way of handling hard-to-predict indirect jumps: dynamically predicating them. The compiler identifies indirect jumps that are suitable for predication along with their control-flow merge (CFM) points. The microarchitecture predicates the instructions between different targets of the jump and its CFM point if the jump turns out to be hardto-predict at run time. We describe the new indirect jump predication architecture, provide code examples showing why it could reduce the performance impact of jumps, derive an analytical cost-benefit model for deciding which jumps and targets to predicate, and present preliminary evaluation results.
Index Terms:
Processor Architectures, Computer Systems Organization, Pipeline processors, Single Data Stream Architectures, Instruction fetch, Micro-architecture implementation considerations, Superscalar, dynamically-scheduled, and statically-scheduled implementation, Micro-architecture implementation considerations
José A. Joao, Onur Mutlu, Hyesoon Kim, Yale N. Patt, "Dynamic Predication of Indirect Jumps," IEEE Computer Architecture Letters, vol. 6, no. 2, pp. 25-28, July-Dec. 2007, doi:10.1109/L-CA.2007.7
Usage of this product signifies your acceptance of the Terms of Use.