By Topic

Load-balancing branch target cache and prefetch buffer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chi-hung Chi ; Sch. of Comput., Nat. Univ. of Singapore, Singapore ; Jun-Li Yuan

Sophisticated branch prediction and compiler optimization technologies result in a higher predictability of instruction references, thus making the branch target cache and prefetch buffer (BTC+PB) design appealing. However, it is surprising to find that this BTC+PB design actually performs worse than the non-partitioned instruction cache. Further investigation shows that this degradation is mainly due to the limited bus bandwidth available for prefetching. To make up for this situation, we propose two load-balancing mechanisms for the BTC+PB design: multi-blocks target (MBT) and dynamic prefetched instruction placement (DIP) techniques. The basic ideas of these two techniques are to tradeoff cache space for bus bandwidth once the bus is found to be overloaded by prefetching. The resulting cache, called the LB+PB design, is found to have superior performance over current non-partitioned instruction cache designs do. Based on the SPEC95, the memory latency due to instruction references can be reduced by an average of 5% to 15%, with some benchmarks whose improvement can go up to over 50%

Published in:

Computer Design, 1999. (ICCD '99) International Conference on

Date of Conference:

1999