5th JILP Workshop on Computer Architecture Competitions Championship Branch Prediction (CBP-5) James Dundas (Samsung SARC)
Drum Rolls The Rewards Certificate for winner in each category Dinner for all accepted competitors
For the 8KB category.... Andre Seznec 4.191 MPKI (4.991 train) Daniel Jimenez (2) 4.386 MPKI (5.226 train) Stephen Pruett et al. 4.521 MPKI (5.370 train) Daniel Jimenez (1) 4.522 MPKI (5.336 train) MIN-ALL 4.149 MPKI (4.946 train) (1) “Multiperspective Perceptron Predictor” (2) “Multiperspective Perceptron Predictor with TAGE”
For the 64KB category.... Andre Seznec 3.344 MPKI (3.986 train) Daniel Jimenez (2) 3.398 MPKI (4.049 train) Daniel Jimenez (1) 3.508 MPKI (4.148 train) Stephen Pruett et al. 3.598 MPKI (4.265 train) MIN-ALL 3.302 MPKI (3.936 train) (1) “Multiperspective Perceptron Predictor” (2) “Multiperspective Perceptron Predictor with TAGE”
For the unlimited category.... Andre Seznec 2.284 MPKI (2.592 train) Daniel Jimenez (2) 2.626 MPKI (2.967 train) Daniel Jimenez (1) 2.832 MPKI (3.239 train) MIN-ALL 2.283 MPKI (2.592 train) [MichaudSeznec2014] 2.372 MPKI (2.713 train) Winning predictor of CBP-5 reduced MPKI by 3.71% (4.46% train) (1) “Multiperspective Perceptron Predictor” (2) “Multiperspective Perceptron Predictor with TAGE”
CBP-6 Open Discussion 120 Members of the Google group, few submissions Call for more industry trace submissions with hard to predict branches and large footprints Add more information to the traces? Reduce storage budget penalty for branch marker and bias weights, etc? Bits in weight tables, etc, are much more expensive than marker or bias bits Provide a free marking structure of N bits per branch? Infinite number of entries or fixed size for each category? No local history or any other state that would require repair on mis-speculation?
End notes Code, papers, presentations and spreadsheet with all training and evaluation results will be uploaded to the CBP-5 website after the conference Branch prediction remains a very important problem Thanks for participating!