The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1988 vol.21)
pp: 47-55
ABSTRACT
<p>A probabilistic model is developed to quantify the performance effects of the branch penalty in a typical pipeline. The branch penalty is analyzed as a function of the relative number of branch instructions executed and the probability that a branch is taken. The resulting model shows the fraction of maximum performance achievable under the given conditions. Techniques to reduce the branch penalty include static and dynamic branch prediction, the branch target buffer, the delayed branch, branch bypassing and multiple prefetching, branch folding, resolution of branch decision early in the pipeline, using multiple independent instruction streams in a shared pipeline, and the prepare-to-branch instruction.</p>
CITATION
David J. Lalja, "Reducing the Branch Penalty in Pipelined Processors", Computer, vol.21, no. 7, pp. 47-55, July 1988, doi:10.1109/2.68
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool