Instruction cache prefetching with extended BTB

Abstract

Instruction cache prefetching is a technique to reduce the penalty caused by instruction cache misses. The prefetching methods generally determines the target fine to be prefetched based on the current fetched fine address. However, as the cache fine becomes wider, there may be multiple branches in a cache fine which hurdles the decision made by these methods. This paper develops a new instruction cache prefetching method in which the prefetch is directed by the prediction on branches. We call it the branch instruction based (BIB) prefetching, In BIB prefetching, the prefetch information is recorded in an extended BTB. Simulation results show that, the BIB prefetching outperforms the traditional sequential prefetching by 7% and other prediction table based prefetching methods by 17% on average, iis the BTB designs become more sophisticated and achieve higher hit and accuracy ratio the BIB prefetching can achieve higher performance.