5th JILP Workshop on Computer Architecture Competitions

Slides:



Advertisements
Similar presentations
Copyright © 2013 School Nutrition Association Succeed with SNAs STEPS Challenge!
Advertisements

Perceptron Branch Prediction with Separated T/NT Weight Tables Guangyu Shi and Mikko Lipasti University of Wisconsin-Madison June 4, 2011.
Dead Block Replacement and Bypass with a Sampling Predictor Daniel A. Jiménez Department of Computer Science The University of Texas at San Antonio.
A 2bcgskew Fused by a RHSP Veerle Desmet Hans Vandierendonck Koen De Bosschere Ghent University Member HiPEAC.
André Seznec Caps Team IRISA/INRIA 1 Looking for limits in branch prediction with the GTL predictor André Seznec IRISA/INRIA/HIPEAC.
H-Pattern: A Hybrid Pattern Based Dynamic Branch Predictor with Performance Based Adaptation Samir Otiv Second Year Undergraduate Kaushik Garikipati Second.
Hardware-based Devirtualization (VPC Prediction) Hyesoon Kim, Jose A. Joao, Onur Mutlu ++, Chang Joo Lee, Yale N. Patt, Robert Cohn* ++ *
1 A Hybrid Adaptive Feedback Based Prefetcher Santhosh Verma, David Koppelman and Lu Peng Louisiana State University.
Exploring Correlation for Indirect Branch Prediction 1 Nikunj Bhansali, Chintan Panirwala, Huiyang Zhou Department of Electrical and Computer Engineering.
Computer Science Department University of Central Florida Adaptive Information Processing: An Effective Way to Improve Perceptron Predictors Hongliang.
André Seznec Caps Team IRISA/INRIA 1 The O-GEHL branch predictor Optimized GEometric History Length André Seznec IRISA/INRIA/HIPEAC.
Exploiting Spatial Locality in Data Caches using Spatial Footprints Sanjeev Kumar, Princeton University Christopher Wilkerson, MRL, Intel.
Yue Hu David M. Koppelman Lu Peng A Penalty-Sensitive Branch Predictor Department of Electrical and Computer Engineering Louisiana State University.
TAGE-SC-L Branch Predictors
Dibakar Gope and Mikko H. Lipasti University of Wisconsin – Madison Championship Branch Prediction 2014 Bias-Free Neural Predictor.
1 Applying Perceptrons to Speculation in Computer Architecture Michael Black Dissertation Defense April 2, 2007.
VLSI Project Neural Networks based Branch Prediction Alexander ZlotnikMarcel Apfelbaum Supervised by: Michael Behar, Spring 2005.
Combining Branch Predictors
Perceptrons Branch Prediction and its’ recent developments
Neural Methods for Dynamic Branch Prediction Daniel A. Jiménez Department of Computer Science Rutgers University.
Optimized Hybrid Scaled Neural Analog Predictor Daniel A. Jiménez Department of Computer Science The University of Texas at San Antonio.
Improving the Performance of Object-Oriented Languages with Dynamic Predication of Indirect Jumps José A. Joao *‡ Onur Mutlu ‡* Hyesoon Kim § Rishi Agarwal.
+ ORB Master Trainer Workshop Mithila K. Bayside 4-H ORB Master Training Workshop, 2015, Mithila K.
1 Storage Free Confidence Estimator for the TAGE predictor André Seznec IRISA/INRIA.
4th JILP Workshop on Computer Architecture Competitions Championship Branch Prediction (CBP-4) -Moinuddin Qureshi (GT)
1 A 64 Kbytes ITTAGE indirect branch predictor André Seznec INRIA/IRISA.
Analysis of Branch Predictors
Microprocessor Arch. 김인식 - 인사
1 Two research studies related to branch prediction and instruction sequencing André Seznec INRIA/IRISA.
André Seznec Caps Team IRISA/INRIA 1 Analysis of the O-GEHL branch predictor Optimized GEometric History Length André Seznec IRISA/INRIA/HIPEAC.
TAC O » ACM Transactions on Architecture and Code Optimization (TACO) ˃Volume 5 Issue 3, Nov 2008 » Author: ˃Hans Vandierendonck Ghent University, Gent,
1 A New Case for the TAGE Predictor André Seznec INRIA/IRISA.
1 Revisiting the perceptron predictor André Seznec IRISA/ INRIA.
Think Quest Educational Program By Oracle Dorin Calin, 2008.
The Journal of Instruction Level Parallelism Championship Branch Prediction website: Dan Connors, Univ. of Colorado Tom Conte,
Opening Up Automatic Structural Design Space Exploration by Fixing Modular Simulation VEERLE DESMET SYLVAIN GIRBAL OLIVIER TEMAM Ghent University Thales.
T-BAG: Bootstrap Aggregating the TAGE Predictor Ibrahim Burak Karsli, Resit Sendag University of Rhode Island.
André Seznec Caps Team IRISA/INRIA 1 A 256 Kbits L-TAGE branch predictor André Seznec IRISA/INRIA/HIPEAC.
Idealized Piecewise Linear Branch Prediction Daniel A. Jiménez Department of Computer Science Rutgers University.
1 The Inner Most Loop Iteration counter a new dimension in branch history André Seznec, Joshua San Miguel, Jorge Albericio.
Temporal Stream Branch Predictor (TS Predictor) Yongming Shen, Michael Ferdman.
Branch Prediction Perspectives Using Machine Learning Veerle Desmet Ghent University.
4th JILP Workshop on Computer Architecture Competitions Championship Branch Prediction (CBP-4) -Moinuddin Qureshi (GT)
André Seznec Caps Team IRISA/INRIA 1 Analysis of the O-GEHL branch predictor Optimized GEometric History Length André Seznec IRISA/INRIA/HIPEAC.
JILP RESULTS 1. JILP Experimental Framework Goal Simplicity of a trace based simulator Flexibility to model special predictors ( e.g., using data values)
Fast Path-Based Neural Branch Prediction Daniel A. Jimenez Presented by: Ioana Burcea.
Samira Khan University of Virginia April 12, 2016
Multiperspective Perceptron Predictor Daniel A. Jiménez Department of Computer Science & Engineering Texas A&M University.
Page 1 SARC Samsung Austin R&D Center SARC Maximizing Branch Behavior Coverage for a Limited Simulation Budget Maximilien Breughe 06/18/2016 Championship.
Welcome to the 2016 Championship Branch Prediction Contest Program Trevor Mudge Seoul, South Korea June 18 th, 2016.
Multilayer Perceptron based Branch Predictor
Business Booster Opportunity !
The 2nd Cache Replacement Championship (CRC-2)
Multiperspective Perceptron Predictor with TAGE
Dynamically Sizing the TAGE Branch Predictor
FA-TAGE Frequency Aware TAgged GEometric History Length Branch Predictor Boyu Zhang, Christopher Bodden, Dillon Skeehan ECE/CS 752 Advanced Computer Architecture.
Come and be a member of our website.
Exploring Value Prediction with the EVES predictor
Looking for limits in branch prediction with the GTL predictor
Cost-Effective Physical Register Sharing
Welcome to the 1st Championship Value Prediction (CVP) Workshop
نظام الفارابي لإدارة جودة التعليم والتعلم
Sponsored by JILP and Intel’s Academic Research Office
Phase Capture and Prediction with Applications
Scaled Neural Indirect Predictor
Industrial Training Provider ,
TAGE-SC-L Again MTAGE-SC
EE 193: Parallel Computing
The O-GEHL branch predictor
Chris Wilkerson, MRL/MTL Intel
Presentation transcript:

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!