The Community for Technology Leaders
Green Image
Issue No. 01 - January/February (2006 vol. 26)
ISSN: 0272-1732
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
ABSTRACT
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

O. Mutlu, J. Stark, H. Kim and Y. N. Patt, "Wish Branches: Enabling Adaptive and Aggressive Predicated Execution," in IEEE Micro, vol. 26, no. , pp. 48-58, 2006.
doi:10.1109/MM.2006.27
95 ms
(Ver 3.3 (11022016))