loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
6th Australasian Computer Systems Architecture Conference (AustCSAC'01)
Two Cache Lines Prediction for a Wide-Issue Micro-architecture
Gold Coast, Queensland, Australia
January 29-January 30
ISBN: 0-7695-0954-1
Shu-Lin Hwang, MinGchi Institute of Technology
Feipei Lai, National Taiwan University
Modern micro-architectures employ superscalar techniques to enhance system performance. The superscalar micrprocessors must fetch at least one instruction cache line at a time to support high issue rate and large amount speculative executions. In this paper, we propose the Grouped Branch Prediction (GBP) that can recognize and preduct multiple branches in the same instruction cache line a wide-issue micro-architecture. Several configurations of the GBP with different group sizes are sumulated. The simulation results show that the branch penalty of the group size 4 with 2048-entry is under 0.65 clock cycle. In our design, we choose the two-group scheme with group size 4. This feature achieves an average of 4.9 IPC_f (the number of instructions feteched per cycle for a machine front-end). Furthernore, we extend the GBP to achieve Two Cache Lines Predictions with two fetch units. The scheme of the 2048-entry 2-group with group size 4 can produce an average of 8.4 IPC_f. The performance is approximately 66.5% better than the original 2-group GBP's. The added hardware cost (41.4k bits) is less than 40%.
Citation:
Shu-Lin Hwang, Feipei Lai, "Two Cache Lines Prediction for a Wide-Issue Micro-architecture," austcsac, pp.71, 6th Australasian Computer Systems Architecture Conference (AustCSAC'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.