Improving trace cache hit rates using the sliding window fill mechanism and fill select table

As superscalar processors become increasingly wide, it is inevitable that the large set of instructions to be fetched every cycle will span multiple noncontiguous basic blocks. The mechanism to fetch, align, and pass this set of instructions down the pipeline must do so as efficiently as possible. The concept of trace cache has emerged as the most promising technique to meet this high-bandwidth, low-latency fetch requirement. A new fill unit scheme, the Sliding Window Fill Mechanism, is proposed as a method to efficiently populate the trace cache. This method exploits trace continuity and identifies probable start regions to improve trace cache hit rate. Simulation yields a 7% average hit rate increase over the Rotenberg fill mechanism. When combined with branch promotion, trace cache hit rates experienced a 19% average increase along with a 17% average improvement in fetch bandwidth. Categories and Subject Description B.3.2 [Memory Structures]: Design Styles – Cache Memory C.0 [Com...

• Type: Conference
• Year: 2004
• Where: ACMMSP
• Authors: Muhammad Shaaban, Edward Mulrane
• Keywords: ACMMSP 2004, Cache Hit Rates, Superscalar Processors, Trace Cache