This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Predication of Indirect Jumps
January-June 2008 (vol. 7 no. 1)
pp. 1-4
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:
Cache memories, Design Styles, B.3 Memory Structures, B Hardware, Multi-core/single-chip multiprocessors, Parallel Architectures, Processor Architectures, Computer Systems Organization
Citation:
José A. Joao, Onur Mutlu, Hyesoon Kim, Yale N. Patt, "Dynamic Predication of Indirect Jumps," IEEE Computer Architecture Letters, vol. 7, no. 1, pp. 1-4, Jan.-June 2008, doi:10.1109/L-CA.2008.2
Usage of this product signifies your acceptance of the Terms of Use.