This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Wish Branches: Enabling Adaptive and Aggressive Predicated Execution
January/February 2006 (vol. 26 no. 1)
pp. 48-58
Hyesoon Kim, University of Texas at Austin
Onur Mutlu, University of Texas at Austin
Yale N. Patt, University of Texas at Austin
Jared Stark, Intel
The goal of wish branches is to use predicated execution for hard-to-predict dynamic branches, and branch prediction for easy-to-predict dynamic branches, thereby obtaining the best of both worlds. Wish loops, one class of wish branches, use predication to reduce the misprediction penalty for hard-to-predict backward (loop) branches.
Index Terms:
Wish branches, predicated execution, branch prediction, wish loops
Citation:
Hyesoon Kim, Onur Mutlu, Yale N. Patt, Jared Stark, "Wish Branches: Enabling Adaptive and Aggressive Predicated Execution," IEEE Micro, vol. 26, no. 1, pp. 48-58, Jan.-Feb. 2006, doi:10.1109/MM.2006.27
Usage of this product signifies your acceptance of the Terms of Use.