loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 IEEE International Symposium on Performance Analysis of Systems and Software
Characterizing the branch misprediction penalty
Austin, TX, USA
March 19-March 21
ISBN: 1-4244-0186-0
S. Eyerman, ELIS, Ghent Univ., Belgium
Despite years of study, branch mispredictions remain as a significant performance impediment in pipelined superscalar processors. In general, the branch misprediction penalty can be substantially larger than the frontend pipeline length (which is often equated with the misprediction penalty). We identify and quantify five contributors to the branch misprediction penalty: (i) the frontend pipeline length, (ii) the number of instructions since the last miss event (branch misprediction, I-cache miss, long D-cache miss)-this is related to the burstiness of miss events, (iii) the inherent ILP of the program, (iv) the functional unit latencies, and (v) the number of short (LI) D-cache misses. The characterizations done in this paper are driven by 'interval analysis', an analytical approach that models superscalar processor performance as a sequence of inter-miss intervals.
Index Terms:
superscalar processor performance modeling, branch misprediction penalty, pipelined superscalar processors, frontend pipeline length, last miss event, functional unit latency, interval analysis
Citation:
S. Eyerman, J.E. Smith, L. Eeckhout, "Characterizing the branch misprediction penalty," ispass, pp.48-58, 2006 IEEE International Symposium on Performance Analysis of Systems and Software, 2006
Usage of this product signifies your acceptance of the Terms of Use.