高性能处理器体系结构推测执行分支预测技术.ppt

* * 性能比较 @SPEC89 * * 混合预测算法的例子：Alpha 21264的分支预测器 Global PHT (1?12) Global BHR per-set BHT global PHT n=10 k =10 k = 12 Local history prediction Global history prediction SAg(10) GAg(12) Selector CS258 S99 * CS of USTC AN Hong Lecture on  High Performance Processor Architecture (CS05162) 推测执行：分支预测技术(2) * * Dynamic Prediction(1)：利用单个分支自身历史（基于模式的预测） Dynamic Prediction ：Use run-time information to make prediction example: Branch Prediction Buffer(1-位预测器) * * Dynamic Prediction： 1-bit BHT Branch History Table Lower bits of PC address index table of 1-bit values Says whether or not branch taken last time No address check Problem: in a loop, 1-bit BHT will cause two mispredictions : End of loop case, when it exits instead of looping as before First time through loop on next time through code, when it predicts exit instead of looping * * Dynamic Prediction：1-bit BHT （Branch Prediction Buffer） Pros: Small. 1 bit per entry can fit lots of entries Always returns a prediction Cons: aliasing between branches one bit of state mispredicts many branches for (I =0; I10; I++) { a = a + 1; } Two mispredictions per loop invocation * * Solution: 2-bit predictor where change prediction only if get misprediction twice: Use extra state to reduce mispredictions at loop ends Red: stop, not taken Green: go, taken Adds hysteresis to decision making process T T NT NT Predict Taken Predict Not Taken Predict Taken Predict Not Taken T NT T NT Dynamic Prediction(2)：Bimodal Branch Prediction Scheme（2bits BHT, 2-位饱和预测器） 11 10 00 01 ? BHT T = Taken N = Not Taken 2-bit Saturating Up-down Counter * * Bimodal Branch Prediction Scheme Strategy: Based on the direction the branch went the last few times it was executed. Based on a little self-history pattern Based on a counter Works well: when each branch is strongly biased in a particular direction. For scientific/engineering applications where program execution is dominated by inner-loops. * * Bimodal Branch Prediction Scheme 例1：…NNNT