Wish Branches: Enabling Adaptive and Aggressive Predicated Execution

IEEE Micro(2006)

引用 16|浏览29
暂无评分
摘要
We propose a mechanism in which the compiler generates code that can be executed either as predicated code or nonpredicated code. The compiler-generated code is the same as predicated code, except the predicated conditional branches are not removed - they are left intact in the program code. These conditional branches are called wish branches. 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
更多
查看译文
关键词
branch prediction,easy-to-predict dynamic branches,compiler-generated code,wish branches,wish loop,predicated code,use predication,wish branch,misprediction penalty,adaptive predicated execution,wish loops,hard-to-predict dynamic branch,predicated execution,easy-to-predict dynamic branch,program control structures,enabling adaptive,hard-to-predict dynamic branches,nonpredicated code,aggressive predicated execution,program compilers
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要