The YAGS branch prediction scheme

被引:60
作者
Eden, AN [1 ]
Mudge, T [1 ]
机构
[1] Univ Michigan, Dept EECS, Ann Arbor, MI 48109 USA
来源
31ST ANNUAL ACM/IEEE INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE, PROCEEDINGS | 1998年
关键词
D O I
10.1109/MICRO.1998.742770
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The importance of an accurate branch prediction mechanism has been well documented. Since the introduction of gshare [1] and the observation that aliasing in the PHT is a major factor in reducing prediction accuracy [2,3,4,5], several schemes have been proposed to reduce aliasing in the PHT[6, 7, 8, 9]. All these schemes are aimed at maximizing the prediction accuracy with the fewest resources. In this paper we introduce Yet Another Global Scheme (YAGS) - a new scheme to reduce the aliasing in the PHT - that combines the strong points of several previous schemes. YAGS introduces tags into the PHT that allows it to be reduced without sacrificing key branch outcome information. The size reduction more than offsets the cast of the tags. Our experimental results show that YAGS gives better prediction accuracy for the SPEC95 benchmark suite than several leading prediction schemes, for the same cost. It also performs better than the other schemes in the presence of a context switch. Finally, YAGS displays good results for the go benchmark which is of special interest since it has a large number of static branches and reflects situations where aliasing in the PHT can be a problem.
引用
收藏
页码:69 / 77
页数:9
相关论文
empty
未找到相关数据