Improving the accuracy of history-based branch prediction

被引：10

作者：

Kaeli, DR ^{[1
]}

Emma, PG ^{[1
]}

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1997年 / 46卷 / 04期

关键词：

history-based branch prediction; BTB; high-level language; execution-driven simulation; call/return stack; case block table;

D O I：

10.1109/12.588060

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we present mechanisms that improve the accuracy and performance of history-based branch prediction. By studying the characteristics of the decision structures present in high-level languages, two mechanisms are proposed that reduce the number of wrong predictions made by a branch target buffer (BTB). Execution-driven modeling is used to evaluate the improvement in branch prediction accuracy, as well as the reduction in overall program execution.

引用

页码：469 / 472

页数：4

共 17 条

[1] [Anonymous], 1991, P 24 ACM IEEE INT S
[2] [Anonymous], P 8 ANN S COMP ARCH
[3] CALDER B, 1994, CONF PROC INT SYMP C, P2
[4] EMMA PG, 1989, Patent No. 4763245
[5] KAELI DR, 1991, ACM COMP AR, V19, P34, DOI 10.1145/115953.115957
[6] KAELI DR, 1992, THESIS RUTGERS U NEW
[7] KAELI DR, 1994, Patent No. 5333283
[8] LILJA DJ, 1988, COMPUTER JUL, P47
[9] PAN ST, 1992, 5TH P INT C ARCH SUP, P76
[10] BRANCH TARGET BUFFER DESIGN AND OPTIMIZATION
PERLEBERG, CH
SMITH, AJ
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (04) : 396 - 412

← 1 2 →