Branch Prediction with Speculative History and Its Effective Recovery Method


The KIPS Transactions:PartA, Vol. 15, No. 4, pp. 217-226, Aug. 2008
10.3745/KIPSTA.2008.15.4.217,   PDF Download:

Abstract

Branch prediction accuracy is critical for system performance in modern microprocessor architectures. The use of speculative update branch history provides substantial accuracy improvement in branch prediction. However, speculative update branch history is the information about uncommitted branch instruction and thus it may hurts program correctness, in case of miss-speculative execution. Therefore, speculative update branch history requires suitable recovery mechanisms to provide program correctness as well as performance improvement. In this paper, we propose recovery logics for speculative update branch history. The proposed solutions are recovery logics for both global history and local history. In simulation results, our solution provides performance improvement up to 5.64%. In addition, it guarantees the program correctness and almost 90% of additional hardware overhead is reduced, compared to previous works.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. W. Kwak, "Branch Prediction with Speculative History and Its Effective Recovery Method," The KIPS Transactions:PartA, vol. 15, no. 4, pp. 217-226, 2008. DOI: 10.3745/KIPSTA.2008.15.4.217.

[ACM Style]
Jong Wook Kwak. 2008. Branch Prediction with Speculative History and Its Effective Recovery Method. The KIPS Transactions:PartA, 15, 4, (2008), 217-226. DOI: 10.3745/KIPSTA.2008.15.4.217.