The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January/February (2006 vol.26)
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
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, January/February 2006, doi:10.1109/MM.2006.27
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool