1. 5th JILP Workshop on Computer Architecture Competitions
Championship Branch Prediction (CBP-5)
James Dundas (Samsung SARC)

2. Drum Rolls The Rewards Certificate for winner in each category
Dinner for all accepted competitors

3. For the 8KB category.... Andre Seznec 4.191 MPKI (4.991 train)
Daniel Jimenez (2) MPKI (5.226 train)
Stephen Pruett et al MPKI (5.370 train)
Daniel Jimenez (1) MPKI (5.336 train)
MIN-ALL MPKI (4.946 train)
(1) “Multiperspective Perceptron Predictor”
(2) “Multiperspective Perceptron Predictor with TAGE”

4. For the 64KB category.... Andre Seznec 3.344 MPKI (3.986 train)
Daniel Jimenez (2) MPKI (4.049 train)
Daniel Jimenez (1) MPKI (4.148 train)
Stephen Pruett et al MPKI (4.265 train)
MIN-ALL MPKI (3.936 train)
(1) “Multiperspective Perceptron Predictor”
(2) “Multiperspective Perceptron Predictor with TAGE”

5. For the unlimited category....
Andre Seznec MPKI (2.592 train)
Daniel Jimenez (2) MPKI (2.967 train)
Daniel Jimenez (1) MPKI (3.239 train)
MIN-ALL MPKI (2.592 train)
[MichaudSeznec2014] 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”

6. 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?

7. 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!