RT Journal Article
YR 2006
VO 26
SP 48
TI Wish Branches: Enabling Adaptive and Aggressive Predicated Execution
A1 Onur Mutlu,
A1 Jared Stark,
A1 Hyesoon Kim,
A1 Yale N. Patt,
K1 Wish branches
K1 predicated execution
K1 branch prediction
K1 wish loops
AB 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.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 0272-1732
LA English
DO 10.1109/MM.2006.27
LK http://doi.ieeecomputersociety.org/10.1109/MM.2006.27