Fast Path-Based Neural Branch Prediction
|
|
- Brianna George
- 6 years ago
- Views:
Transcription
1 Fast Path-Based Neral Branch Prediction Daniel A. Jiménez Department of Compter Science Rtgers, The State University of New Jersey
2 Overview The context: microarchitectre Branch prediction Neral branch prediction The problem: It's too slow! The soltion: A path-based neral branch predictor Reslts and analysis Conclsions 2
3 The Context I'll be discssing the implementation of microprocessors Microarchitectre I stdy deeply pipelined, high clock freqency CPUs The goal is to improve performance Make the program go faster How can we exploit program behavior to make it go faster? Remove control dependences Increase instrction-level parallelism 3
4 How an Instrction is Processed Processing can be divided into several stages: Instrction fetch Instrction decode Execte Memory access Write back 4
5 Instrction-Level Parallelism To speed p the process, pipelining overlaps exection of mltiple instrctions, exploiting parallelism between instrctions Instrction fetch Instrction decode Execte Memory access Write back 5
6 Control Hazards: Branches Conditional branches create a problem for pipelining: the next instrction can't be fetched ntil the branch has exected, several stages later. Branch instrction 6
7 Pipelining and Branches Pipelining overlaps instrctions to exploit parallelism, allowing the clock rate to be increased. Branches case bbbles in the pipeline, where some stages are left idle. Instrction fetch Instrction decode Execte Memory access Write back Unresolved branch instrction 7
8 Branch Prediction A branch predictor allows the processor to speclatively fetch and execte instrctions down the predicted path. Instrction fetch Instrction decode Execte Memory access Write back Speclative exection Branch predictors mst be highly accrate to avoid mispredictions! 8
9 Branch Predictors Mst Improve The cost of a misprediction is proportional to pipeline depth As pipelines deepen, we need more accrate branch predictors Pentim 4 pipeline has 20 stages Ftre pipelines will have > 32 stages Deeper pipelines allow higher clock rates by decreasing the delay of each pipeline stage Decreasing misprediction rate from 9% to 4% reslts in 31% speedp for 32 stage pipeline Simlations with SimpleScalar/Alpha 9
10 Branch Prediction Backgrond The basic mechanism: 2-level adaptive prediction [Yeh & Patt `91] Uses correlations between branch history and otcome Examples: gshare [McFarling `93] agree [Sprangle et al. `97] hybrid predictors [Evers et al. `96] This scheme is highly accrate in practice 10
11 Neral Branch Prediction Observed that branch prediction is a machine learning problem The perceptron predictor [Jiménez & Lin 2001 (HPCA), 2003 (TOCS)] A novel branch predictor based on neral learning Able to exploit longer histories than most 2-level schemes High accracy, bt high delay Overriding was proposed as a soltion to the delay problem, bt it does not scale [Jiménez, 2003 (HPCA)] 11
12 Branch-Predicting Perceptron Inpts (x s) are from branch history register Weights (w s) are small integers learned by on-line training Otpt (y) gives prediction; dot prodct of x s and w s Training finds correlations between history and otcome w 0 is the bias weight, learning only the bias of the branch 12
13 Prediction Algorithm h is the history length W[0..n-1,0..h] is a table of perceptrons (weights vectors) Weights are 8-bit integers W[i,0..h] is the i'th perceptron G[1..h] is a global history shift register 13
14 Update Algorithm Strengthens correlations between branch history and otcome Highly parallel 14
15 Perceptron Predictor Accracy Very accrate 15
16 The Problem: It's Too Slow! Example otpt comptation: 12 weights, Wallace tree of depth 6 followed by 14-bit carry-lookahead adder Carry-save adders have O(1) depth, carry-lookahead adder has O(log n) depth Delay can be 7 cycles for long histories 16
17 Impact of Delay Even sing latency-mitigation techniqe, performance sffers 32-stage pipeline, 8 FO4 clock period, overriding 2K-entry bimodal predictor 17
18 Soltion: A Path-Based Neral Predictor Instead of compting the prediction all at once... Stagger the comptation in time, sing weights fond along the path to the branch being predicted [Jiménez 2003 (MICRO)] 18
19 Intitive Description Neron for branch b t has weights x 0 throgh x 7 for both predictors original perceptron predictor path-based neral predictor 19
20 Algorithm Overview Components of algorithm Terms Prediction Speclative Update Non-speclative pdate / training h, n, W as before SR is a shift vector of ints that accmlates partial sms SR[j] holds the sm for the (h-j)th branch in the ftre SG is the speclative global history R and G are non-speclative versions of SR and SG 20
21 Prediction Algorithm i = branch PC mod n y = SR[h] + W[i,0], i.e., final comptation in dot prodct if y >= 0 predict taken, otherwise predict not taken 21
22 Speclative Update Algorithm Update each partial sm in SR in parallel: for j in 1..h in parallel do SR'[h-j+1] = SR[h-j] + prediction? W[i,j] : -W[i,j] end for SR := SR' Speclatively pdate SG with prediction 22
23 Non-Speclative Update / Training Non-speclatively pdate R sing otcome Let H be the history sed to predict this branch Train the bias weight for this branch: If otcome = taken, W[i,0]++ else W[i,0]-- Train the rest of the weights based on correlation with history: for j in 1..h in parallel do let k j be the vale of i, j branches ago if H[j] = otcome then W[k j,j]++ else W[k j,j]-- end for 23
24 Experimental Evalation Used a modified version of SimpleScalar/Alpha wide processor, 32-stage pipeline Used HSPICE + CACTI 3.0 for delay estimates Compared against overriding versions of: 2Bc-gskew [Seznec et al. '02] Fixed-length path predictor [Stark et al. '98] Global/local perceptron predictor [Jiménez & Lin '03] Also sed single-cycle pipelined gshare [McFarling '93],[Jiménez '03] Measred misprediction rates and instrctions per cycle (IPC) All 12 SPECint from '95 not dplicated in
25 Reslts: Accracy Path-based neral predictor is the most accrate (of corse) 25
26 Reslts: IPC Path-based neral predictor yields best performance 26
27 IPC Per Benchmark: 8KB Bdget Best on 15 of 17 benchmarks 27
28 Analysis: Linear Separability Perceptrons can learn well only linearly separable fnctions Bt half of all branches are linearly inseparable! 28
29 Analysis cont. Almost all mispredictions come from inseparable branches! Path-based neral predictor can predict these branches well n = path based neral p = perceptron g = gshare history length = 10 29
30 Conclsions & Ftre Work Neral branch predictors are a viable technology Neral predictors offer performance beyond traditional conter-based schemes Design space for path-based neral predictors can be frther explored, e.g.: Global/local Static/dynamic Overriding with partial sms Applications beyond branch prediction... 30
31 The End 31
32 Prediction Algorithm SR[0..h] is a vector of h+1 integers that hold speclative partial sms Think of SR[] as a pipeline of partial sms; zeros go in and the dot prodct of the weights and history bits come ot (mins the bias weights) 32
33 Update Algorithm Maintains non-speclative partial sms for misprediction recovery Increments or decrements weights corresponding to nerons for positive or negative correlation 33
34 History Length Tning Tned predictors for optimal history length Path-based histories were shorter than perceptron 34
35 Delay Estimates Used HSPICE and CACTI 3.0 to estimate latencies for predictors Based on 90 nm technology, aggressive 8 fan-ot-of-4 inverter delays 35
36 Intitive Description cont. Weights are chosen ahead of time, based on the path leading to branch b t (x 0 is the bias weight) 36
37 Neral Branch Predictors Are Feasible Most branch predictors are based on tables of two-bit conters Neral predictors se a sperior prediction technology Accracy is better than table-based approaches However, latency of comptation makes them impractical We propose a new algorithm for compting neral prediction Almost all work is done ahead of time, so latency is greatly improved Incorporates path information, so accracy is improved Yields speedp of 16% over perceptron predictor, 4% over 2Bc-gskew 37
38 Branch Prediction is a Machine Learning Problem So why not apply a machine learning algorithm? Replace 2-bit conters with a more accrate predictor Tight constraints on prediction mechanism Mst be fast and small enogh to work as a component of a microprocessor Artificial neral networks Simple model of neral networks in brain cells Learn to recognize and classify patterns Most neral nets are slow and complex relative to tables For branch prediction, we need a small and fast neral method 38
39 Accracy Per Benchmark: 8KB Bdget Best on 14 of the 17 benchmarks, not conting perceptron predictor 39
Pipelined Datapath. Reading. Sections Practice Problems: 1, 3, 8, 12 (2) Lecture notes from MKP, H. H. Lee and S.
Pipelined Datapath Lectre notes from KP, H. H. Lee and S. Yalamanchili Sections 4.5 4. Practice Problems:, 3, 8, 2 Reading (2) Pipeline Performance Assme time for stages is v ps for register read or write
More informationPortland State University ECE 587/687. Branch Prediction
Portland State University ECE 587/687 Branch Prediction Copyright by Alaa Alameldeen and Haitham Akkary 2015 Branch Penalty Example: Comparing perfect branch prediction to 90%, 95%, 99% prediction accuracy,
More informationFast Path-Based Neural Branch Prediction
Appears in the Proceedings of the 36 Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-36) Fast Path-Based Neural Branch Prediction Daniel A Jiménez Department of Computer Science Rutgers
More informationBranch Prediction using Advanced Neural Methods
Branch Prediction using Advanced Neural Methods Sunghoon Kim Department of Mechanical Engineering University of California, Berkeley shkim@newton.berkeley.edu Abstract Among the hardware techniques, two-level
More informationTopics: A multiple cycle implementation. Distributed Notes
COSC 22: Compter Organization Instrctor: Dr. Amir Asif Department of Compter Science York University Handot # lticycle Implementation of a IPS Processor Topics: A mltiple cycle implementation Distribted
More informationReview. Combined Datapath
Review Topics:. A single cycle implementation 2. State Diagrams. A mltiple cycle implementation COSC 22: Compter Organization Instrctor: Dr. Amir Asif Department of Compter Science York University Handot
More informationDesigning Single-Cycle MIPS Processor
CSE 32: Introdction to Compter Architectre Designing Single-Cycle IPS Processor Presentation G Stdy:.-. Gojko Babić 2/9/28 Introdction We're now ready to look at an implementation of the system that incldes
More informationDesigning MIPS Processor
CSE 675.: Introdction to Compter Architectre Designing IPS Processor (lti-cycle) Presentation H Reading Assignment: 5.5,5.6 lti-cycle Design Principles Break p eection of each instrction into steps. The
More informationConcepts Introduced. Digital Electronics. Logic Blocks. Truth Tables
Concepts Introdced Digital Electronics trth tables, logic eqations, and gates combinational logic seqential logic Digital electronics operate at either high or low voltage. Compters se a binary representation
More informationInstruction register. Data. Registers. Register # Memory data register
Where we are headed Single Cycle Problems: what if we had a more complicated instrction like floating point? wastefl of area One Soltion: se a smaller cycle time have different instrctions take different
More informationChapter 4 Supervised learning:
Chapter 4 Spervised learning: Mltilayer Networks II Madaline Other Feedforward Networks Mltiple adalines of a sort as hidden nodes Weight change follows minimm distrbance principle Adaptive mlti-layer
More informationLecture 12: Pipelined Implementations: Control Hazards and Resolutions
18-447 Lectre 12: Pipelined Implementations: Control Hazards and Resoltions S 09 L12-1 James C. Hoe Dept of ECE, CU arch 2, 2009 Annoncements: Spring break net week!! Project 2 de the week after spring
More informationOn the circuit complexity of the standard and the Karatsuba methods of multiplying integers
On the circit complexity of the standard and the Karatsba methods of mltiplying integers arxiv:1602.02362v1 [cs.ds] 7 Feb 2016 Igor S. Sergeev The goal of the present paper is to obtain accrate estimates
More informationA Novel Meta Predictor Design for Hybrid Branch Prediction
A Novel Meta Predictor Design for Hybrid Branch Prediction YOUNG JUNG AHN, DAE YON HWANG, YONG SUK LEE, JIN-YOUNG CHOI AND GYUNGHO LEE The Dept. of Computer Science & Engineering Korea University Anam-dong
More informationUnit 6: Branch Prediction
CIS 501: Computer Architecture Unit 6: Branch Prediction Slides developed by Joe Devie/, Milo Mar4n & Amir Roth at Upenn with sources that included University of Wisconsin slides by Mark Hill, Guri Sohi,
More informationBETTER BRANCH PREDICTION THROUGH PROPHET/CRITIC HYBRIDS
BETTER BRANCH PREDICTION THROUGH PROPHET/CRITIC HYBRIDS THE PROPHET/CRITIC HYBRID CONDITIONAL BRANCH PREDICTOR HAS TWO COMPONENT PREDICTORS. THE PROPHET USES A BRANCH S HISTORY TO PREDICT ITS DIRECTION.
More informationLecture 9: Control Hazard and Resolution. James C. Hoe Department of ECE Carnegie Mellon University
18 447 Lectre 9: Control Hazard and Resoltion James C. Hoe Department of ECE Carnegie ellon University 18 447 S18 L09 S1, James C. Hoe, CU/ECE/CALC, 2018 Yor goal today Hosekeeping simple control flow
More informationApplying Fuzzy Set Approach into Achieving Quality Improvement for Qualitative Quality Response
Proceedings of the 007 WSES International Conference on Compter Engineering and pplications, Gold Coast, stralia, Janary 17-19, 007 5 pplying Fzzy Set pproach into chieving Qality Improvement for Qalitative
More informationLecture Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2
BIJU PATNAIK UNIVERSITY OF TECHNOLOGY, ODISHA Lectre Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2 Prepared by, Dr. Sbhend Kmar Rath, BPUT, Odisha. Tring Machine- Miscellany UNIT 2 TURING MACHINE
More informationOutline. Model Predictive Control: Current Status and Future Challenges. Separation of the control problem. Separation of the control problem
Otline Model Predictive Control: Crrent Stats and Ftre Challenges James B. Rawlings Department of Chemical and Biological Engineering University of Wisconsin Madison UCLA Control Symposim May, 6 Overview
More informationDiscontinuous Fluctuation Distribution for Time-Dependent Problems
Discontinos Flctation Distribtion for Time-Dependent Problems Matthew Hbbard School of Compting, University of Leeds, Leeds, LS2 9JT, UK meh@comp.leeds.ac.k Introdction For some years now, the flctation
More informationSequential Classification Algorithms
Prde University Prde e-pbs LARS Symposia Laboratory for Applications of Remote Sensing 1-1-1981 Seqential Classification Algorithms R. Krishnan K. R. Rao Follow this and additional works at: http://docs.lib.prde.ed/lars_symp
More informationSystem identification of buildings equipped with closed-loop control devices
System identification of bildings eqipped with closed-loop control devices Akira Mita a, Masako Kamibayashi b a Keio University, 3-14-1 Hiyoshi, Kohok-k, Yokohama 223-8522, Japan b East Japan Railway Company
More informationNEURAL CONTROLLERS FOR NONLINEAR SYSTEMS IN MATLAB
NEURAL CONTROLLERS FOR NONLINEAR SYSTEMS IN MATLAB S.Kajan Institte of Control and Indstrial Informatics, Faclt of Electrical Engineering and Information Technolog, Slovak Universit of Technolog in Bratislava,
More informationControl Performance Monitoring of State-Dependent Nonlinear Processes
Control Performance Monitoring of State-Dependent Nonlinear Processes Lis F. Recalde*, Hong Ye Wind Energy and Control Centre, Department of Electronic and Electrical Engineering, University of Strathclyde,
More informationLinear System Theory (Fall 2011): Homework 1. Solutions
Linear System Theory (Fall 20): Homework Soltions De Sep. 29, 20 Exercise (C.T. Chen: Ex.3-8). Consider a linear system with inpt and otpt y. Three experiments are performed on this system sing the inpts
More informationStudy on the impulsive pressure of tank oscillating by force towards multiple degrees of freedom
EPJ Web of Conferences 80, 0034 (08) EFM 07 Stdy on the implsive pressre of tank oscillating by force towards mltiple degrees of freedom Shigeyki Hibi,* The ational Defense Academy, Department of Mechanical
More informationBayes and Naïve Bayes Classifiers CS434
Bayes and Naïve Bayes Classifiers CS434 In this lectre 1. Review some basic probability concepts 2. Introdce a sefl probabilistic rle - Bayes rle 3. Introdce the learning algorithm based on Bayes rle (ths
More informationChapter 3 MATHEMATICAL MODELING OF DYNAMIC SYSTEMS
Chapter 3 MATHEMATICAL MODELING OF DYNAMIC SYSTEMS 3. System Modeling Mathematical Modeling In designing control systems we mst be able to model engineered system dynamics. The model of a dynamic system
More informationLinear and Nonlinear Model Predictive Control of Quadruple Tank Process
Linear and Nonlinear Model Predictive Control of Qadrple Tank Process P.Srinivasarao Research scholar Dr.M.G.R.University Chennai, India P.Sbbaiah, PhD. Prof of Dhanalaxmi college of Engineering Thambaram
More informationCPU DESIGN The Single-Cycle Implementation
22 ompter Organization Seqential vs. ombinational ircits Digital circits can be classified into two categories: DESIGN The Single-ycle Implementation. ombinational ircits: m, 2. Seqential ircits: flip-flops,
More informationFRTN10 Exercise 12. Synthesis by Convex Optimization
FRTN Exercise 2. 2. We want to design a controller C for the stable SISO process P as shown in Figre 2. sing the Yola parametrization and convex optimization. To do this, the control loop mst first be
More informationFast Algorithms for Restoration of Color Wireless Capsule Endoscopy Images
Fast Algorithms for Restoration of Color Wireless Capsle Endoscopy Images Haiying Li, W.-S. L, and Max Q.-H. Meng School of Control Science and Engineering, Shangdon University, Jinan, China Dept. of Electrical
More informationChapter 4 Linear Models
Chapter 4 Linear Models General Linear Model Recall signal + WG case: x[n] s[n;] + w[n] x s( + w Here, dependence on is general ow we consider a special case: Linear Observations : s( H + b known observation
More informationIntrodction Finite elds play an increasingly important role in modern digital commnication systems. Typical areas of applications are cryptographic sc
A New Architectre for a Parallel Finite Field Mltiplier with Low Complexity Based on Composite Fields Christof Paar y IEEE Transactions on Compters, Jly 996, vol 45, no 7, pp 856-86 Abstract In this paper
More informationOptimal Control of a Heterogeneous Two Server System with Consideration for Power and Performance
Optimal Control of a Heterogeneos Two Server System with Consideration for Power and Performance by Jiazheng Li A thesis presented to the University of Waterloo in flfilment of the thesis reqirement for
More informationLambdaMF: Learning Nonsmooth Ranking Functions in Matrix Factorization Using Lambda
2015 IEEE International Conference on Data Mining LambdaMF: Learning Nonsmooth Ranking Fnctions in Matrix Factorization Using Lambda Gang-He Lee Department of Compter Science and Information Engineering
More informationPREDICTABILITY OF SOLID STATE ZENER REFERENCES
PREDICTABILITY OF SOLID STATE ZENER REFERENCES David Deaver Flke Corporation PO Box 99 Everett, WA 986 45-446-6434 David.Deaver@Flke.com Abstract - With the advent of ISO/IEC 175 and the growth in laboratory
More informationFall 2011 Prof. Hyesoon Kim
Fall 2011 Prof. Hyesoon Kim Add: 2 cycles FE_stage add r1, r2, r3 FE L ID L EX L MEM L WB L add add sub r4, r1, r3 sub sub add add mul r5, r2, r3 mul sub sub add add mul sub sub add add mul sub sub add
More information1. Tractable and Intractable Computational Problems So far in the course we have seen many problems that have polynomial-time solutions; that is, on
. Tractable and Intractable Comptational Problems So far in the corse we have seen many problems that have polynomial-time soltions; that is, on a problem instance of size n, the rnning time T (n) = O(n
More informationComputer Architecture 10. Fast Adders
Computer Architecture 10 Fast s Ma d e wi t h Op e n Of f i c e. o r g 1 Carry Problem Addition is primary mechanism in implementing arithmetic operations Slow addition directly affects the total performance
More informationProblem Class 4. More State Machines (Problem Sheet 3 con t)
Problem Class 4 More State Machines (Problem Sheet 3 con t) Peter Cheng Department of Electrical & Electronic Engineering Imperial College London URL: www.ee.imperial.ac.k/pcheng/ee2_digital/ E-mail: p.cheng@imperial.ac.k
More informationDepartment of Industrial Engineering Statistical Quality Control presented by Dr. Eng. Abed Schokry
Department of Indstrial Engineering Statistical Qality Control presented by Dr. Eng. Abed Schokry Department of Indstrial Engineering Statistical Qality Control C and U Chart presented by Dr. Eng. Abed
More informationSimulation Based Analysis of Two Different Control Strategies for PMSM
International Jornal of Engineering Trends and Technology (IJETT) - Volme4Isse4- April 23 Simlation Based Analysis of Two Different Control Strategies for PMSM Lindita Dhamo #, Aida Spahi #2 # Department
More informationOnline Solution of State Dependent Riccati Equation for Nonlinear System Stabilization
> REPLACE American HIS Control LINE Conference WIH YOUR PAPER IDENIFICAION NUMBER (DOUBLE-CLICK HERE O EDI) FrC3. Marriott Waterfront, Baltimore, MD, USA Jne 3-Jly, Online Soltion of State Dependent Riccati
More informationThe spreading residue harmonic balance method for nonlinear vibration of an electrostatically actuated microbeam
J.L. Pan W.Y. Zh Nonlinear Sci. Lett. Vol.8 No. pp.- September The spreading reside harmonic balance method for nonlinear vibration of an electrostatically actated microbeam J. L. Pan W. Y. Zh * College
More informationControl of a Power Assisted Lifting Device
Proceedings of the RAAD 212 21th International Workshop on Robotics in Alpe-Adria-Danbe Region eptember 1-13, 212, Napoli, Italy Control of a Power Assisted Lifting Device Dimeas otios a, Kostompardis
More informationReducing Conservatism in Flutterometer Predictions Using Volterra Modeling with Modal Parameter Estimation
JOURNAL OF AIRCRAFT Vol. 42, No. 4, Jly Agst 2005 Redcing Conservatism in Fltterometer Predictions Using Volterra Modeling with Modal Parameter Estimation Rick Lind and Joao Pedro Mortaga University of
More informationHybrid modelling and model reduction for control & optimisation
Hybrid modelling and model redction for control & optimisation based on research done by RWTH-Aachen and TU Delft presented by Johan Grievink Models for control and optimiation market and environmental
More informationIII. Demonstration of a seismometer response with amplitude and phase responses at:
GG5330, Spring semester 006 Assignment #1, Seismometry and Grond Motions De 30 Janary 006. 1. Calibration Of A Seismometer Using Java: A really nifty se of Java is now available for demonstrating the seismic
More informationElectron Phase Slip in an Undulator with Dipole Field and BPM Errors
CS-T--14 October 3, Electron Phase Slip in an Undlator with Dipole Field and BPM Errors Pal Emma SAC ABSTRACT A statistical analysis of a corrected electron trajectory throgh a planar ndlator is sed to
More informationConvergence analysis of ant colony learning
Delft University of Technology Delft Center for Systems and Control Technical report 11-012 Convergence analysis of ant colony learning J van Ast R Babška and B De Schtter If yo want to cite this report
More informationGen Hebb Learn PPaplinski Generalized Hebbian Learning and its pplication in Dimensionality Redction Illstrative Example ndrew P Paplinski Department
Faclty of Compting and Information Technology Department of Digital Systems Technical Report 9-2 Generalized Hebbian Learning and its pplication in Dimensionality Redction Illstrative Example ndrew P Paplinski
More informationChapter 5. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 5 <1>
Chapter 5 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 5 Chapter 5 :: Topics Introduction Arithmetic Circuits umber Systems Sequential Building
More informationNew Fourth Order Explicit Group Method in the Solution of the Helmholtz Equation Norhashidah Hj. Mohd Ali, Teng Wai Ping
World Academy of Science, Engineering and Tecnology International Jornal of Matematical and Comptational Sciences Vol:9, No:, 05 New Fort Order Eplicit Grop Metod in te Soltion of te elmoltz Eqation Norasida.
More informationExploiting Bias in the Hysteresis Bit of 2-bit Saturating Counters in Branch Predictors
Journal of Instruction-Level Parallelism 5(23) -32 Submitted 2/2; published 6/3 Exploiting Bias in the Hysteresis Bit of 2-bit Saturating Counters in Branch Predictors Gabriel H. Loh Dana S. Henry Arvind
More informationA New Approach for Small Satellite Gyroscope and Star Tracker Fusion
Indian Jornal of Science and echnology, Vol 9(7), DOI: 0.7485/ijst/06/v9i7/9363, May 06 ISSN (Print) : 09746846 ISSN (Online) : 09745645 A New Approach for Small Satellite Gyroscope and Star racer Fsion
More informationA Model-Free Adaptive Control of Pulsed GTAW
A Model-Free Adaptive Control of Plsed GTAW F.L. Lv 1, S.B. Chen 1, and S.W. Dai 1 Institte of Welding Technology, Shanghai Jiao Tong University, Shanghai 00030, P.R. China Department of Atomatic Control,
More informationAndrew W. Moore Professor School of Computer Science Carnegie Mellon University
Spport Vector Machines Note to other teachers and sers of these slides. Andrew wold be delighted if yo fond this sorce material sefl in giving yor own lectres. Feel free to se these slides verbatim, or
More informationStudy on the Mathematic Model of Product Modular System Orienting the Modular Design
Natre and Science, 2(, 2004, Zhong, et al, Stdy on the Mathematic Model Stdy on the Mathematic Model of Prodct Modlar Orienting the Modlar Design Shisheng Zhong 1, Jiang Li 1, Jin Li 2, Lin Lin 1 (1. College
More informationTrustSVD: Collaborative Filtering with Both the Explicit and Implicit Influence of User Trust and of Item Ratings
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence TrstSVD: Collaborative Filtering with Both the Explicit and Implicit Inflence of User Trst and of Item Ratings Gibing Go Jie Zhang
More informationAn Investigation into Estimating Type B Degrees of Freedom
An Investigation into Estimating Type B Degrees of H. Castrp President, Integrated Sciences Grop Jne, 00 Backgrond The degrees of freedom associated with an ncertainty estimate qantifies the amont of information
More informationEXPT. 5 DETERMINATION OF pk a OF AN INDICATOR USING SPECTROPHOTOMETRY
EXPT. 5 DETERMITIO OF pk a OF IDICTOR USIG SPECTROPHOTOMETRY Strctre 5.1 Introdction Objectives 5.2 Principle 5.3 Spectrophotometric Determination of pka Vale of Indicator 5.4 Reqirements 5.5 Soltions
More informationPattern History Table. Global History Register. Pattern History Table. Branch History Pattern Pattern History Bits
An Enhanced Two-Level Adaptive Multiple Branch Prediction for Superscalar Processors Jong-bok Lee, Soo-Mook Moon and Wonyong Sung fjblee@mpeg,smoon@altair,wysung@dspg.snu.ac.kr School of Electrical Engineering,
More informationÁrpád Gellért Lucian N. Vinţan Adrian Florea. A Systematic Approach to Predict Unbiased Branches
Árpád Gellért Lucian N. Vinţan Adrian Florea A Systematic Approach to Predict Unbiased Branches Lucian Blaga University Press Sibiu 2007 Tiparul executat la: Compartimentul de Multiplicare al Editurii
More informationBLOOM S TAXONOMY. Following Bloom s Taxonomy to Assess Students
BLOOM S TAXONOMY Topic Following Bloom s Taonomy to Assess Stdents Smmary A handot for stdents to eplain Bloom s taonomy that is sed for item writing and test constrction to test stdents to see if they
More informationUniversal Scheme for Optimal Search and Stop
Universal Scheme for Optimal Search and Stop Sirin Nitinawarat Qalcomm Technologies, Inc. 5775 Morehose Drive San Diego, CA 92121, USA Email: sirin.nitinawarat@gmail.com Vengopal V. Veeravalli Coordinated
More informationCMPEN 411 VLSI Digital Circuits Spring Lecture 19: Adder Design
CMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 19: Adder Design [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan, B. Nikolic] Sp11 CMPEN 411 L19
More informationBranch History Matching: Branch Predictor Warmup for Sampled Simulation
Branch History Matching: Branch Predictor Warmup for Sampled Simulation Simon Kluyskens Lieven Eeckhout ELIS Department, Ghent University Sint-Pietersnieuwstraat 41, B-9000 Gent, Belgium Email: leeckhou@elis.ugent.be
More informationFINITE ELEMENT MODELING OF EDDY CURRENT PROBES FOR EDGE EFFECT
FIITE ELEMET MODELIG OF EDDY CURRET PROBES FOR EDGE EFFECT REDUCTIO Sarit Sharma, Ibrahim Elshafiey, Lalita Udpa, and Satish Udpa Department of Electrical and Compter Engineering Iowa State University
More informationData-Efficient Control Policy Search using Residual Dynamics Learning
Data-Efficient Control Policy Search sing Residal Dynamics Learning Matteo Saveriano 1, Ychao Yin 1, Pietro Falco 1 and Donghei Lee 1,2 Abstract In this work, we propose a model-based and data efficient
More informationOptimization in Predictive Control Algorithm
Latest rends in Circits, Systems, Sinal Processin and Atomatic Control Optimization in Predictive Control Alorithm JAN ANOŠ, MAREK KUBALČÍK omas Bata University in Zlín, Faclty of Applied Informatics Nám..
More informationDevelopment of Second Order Plus Time Delay (SOPTD) Model from Orthonormal Basis Filter (OBF) Model
Development of Second Order Pls Time Delay (SOPTD) Model from Orthonormal Basis Filter (OBF) Model Lemma D. Tfa*, M. Ramasamy*, Sachin C. Patwardhan **, M. Shhaimi* *Chemical Engineering Department, Universiti
More information[2] Predicting the direction of a branch is not enough. What else is necessary?
[2] When we talk about the number of operands in an instruction (a 1-operand or a 2-operand instruction, for example), what do we mean? [2] What are the two main ways to define performance? [2] Predicting
More informationTed Pedersen. Southern Methodist University. large sample assumptions implicit in traditional goodness
Appears in the Proceedings of the Soth-Central SAS Users Grop Conference (SCSUG-96), Astin, TX, Oct 27-29, 1996 Fishing for Exactness Ted Pedersen Department of Compter Science & Engineering Sothern Methodist
More informationMulti-Voltage Floorplan Design with Optimal Voltage Assignment
Mlti-Voltage Floorplan Design with Optimal Voltage Assignment ABSTRACT Qian Zaichen Department of CSE The Chinese University of Hong Kong Shatin,N.T., Hong Kong zcqian@cse.chk.ed.hk In this paper, we stdy
More informationQuantum Key Distribution Using Decoy State Protocol
American J. of Engineering and Applied Sciences 2 (4): 694-698, 2009 ISSN 94-7020 2009 Science Pblications Qantm Key Distribtion sing Decoy State Protocol,2 Sellami Ali, 2 Shhairi Sahardin and,2 M.R.B.
More informationFOUNTAIN codes [3], [4] provide an efficient solution
Inactivation Decoding of LT and Raptor Codes: Analysis and Code Design Francisco Lázaro, Stdent Member, IEEE, Gianligi Liva, Senior Member, IEEE, Gerhard Bach, Fellow, IEEE arxiv:176.5814v1 [cs.it 19 Jn
More informationSetting The K Value And Polarization Mode Of The Delta Undulator
LCLS-TN-4- Setting The Vale And Polarization Mode Of The Delta Undlator Zachary Wolf, Heinz-Dieter Nhn SLAC September 4, 04 Abstract This note provides the details for setting the longitdinal positions
More informationUNCERTAINTY FOCUSED STRENGTH ANALYSIS MODEL
8th International DAAAM Baltic Conference "INDUSTRIAL ENGINEERING - 19-1 April 01, Tallinn, Estonia UNCERTAINTY FOCUSED STRENGTH ANALYSIS MODEL Põdra, P. & Laaneots, R. Abstract: Strength analysis is a
More informationCMP 334: Seventh Class
CMP 334: Seventh Class Performance HW 5 solution Averages and weighted averages (review) Amdahl's law Ripple-carry adder circuits Binary addition Half-adder circuits Full-adder circuits Subtraction, negative
More information[2] Predicting the direction of a branch is not enough. What else is necessary?
[2] What are the two main ways to define performance? [2] Predicting the direction of a branch is not enough. What else is necessary? [2] The power consumed by a chip has increased over time, but the clock
More informationCreating a Sliding Mode in a Motion Control System by Adopting a Dynamic Defuzzification Strategy in an Adaptive Neuro Fuzzy Inference System
Creating a Sliding Mode in a Motion Control System by Adopting a Dynamic Defzzification Strategy in an Adaptive Nero Fzzy Inference System M. Onder Efe Bogazici University, Electrical and Electronic Engineering
More informationwhere v ij = [v ij,1,..., v ij,v ] is the vector of resource
Echo State Transfer Learning for ata Correlation Aware Resorce Allocation in Wireless Virtal Reality Mingzhe Chen, Walid Saad, Changchan Yin, and Méroane ebbah Beijing Laboratory of Advanced Information
More informationTechnical Note. ODiSI-B Sensor Strain Gage Factor Uncertainty
Technical Note EN-FY160 Revision November 30, 016 ODiSI-B Sensor Strain Gage Factor Uncertainty Abstract Lna has pdated or strain sensor calibration tool to spport NIST-traceable measrements, to compte
More informationDigital Integrated Circuits A Design Perspective. Arithmetic Circuits. Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic.
Digital Integrated Circuits A Design Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic Arithmetic Circuits January, 2003 1 A Generic Digital Processor MEM ORY INPUT-OUTPUT CONTROL DATAPATH
More informationSolving a System of Equations
Solving a System of Eqations Objectives Understand how to solve a system of eqations with: - Gass Elimination Method - LU Decomposition Method - Gass-Seidel Method - Jacobi Method A system of linear algebraic
More informationMath 116 First Midterm October 14, 2009
Math 116 First Midterm October 14, 9 Name: EXAM SOLUTIONS Instrctor: Section: 1. Do not open this exam ntil yo are told to do so.. This exam has 1 pages inclding this cover. There are 9 problems. Note
More informationSimplified Identification Scheme for Structures on a Flexible Base
Simplified Identification Scheme for Strctres on a Flexible Base L.M. Star California State University, Long Beach G. Mylonais University of Patras, Greece J.P. Stewart University of California, Los Angeles
More informationPipeline no Prediction. Branch Delay Slots A. From before branch B. From branch target C. From fall through. Branch Prediction
Pipeline no Prediction Branching completes in 2 cycles We know the target address after the second stage? PC fetch Instruction Memory Decode Check the condition Calculate the branch target address PC+4
More information/ : Computer Architecture and Design
16.482 / 16.561: Computer Architecture and Design Summer 2015 Homework #5 Solution 1. Dynamic scheduling (30 points) Given the loop below: DADDI R3, R0, #4 outer: DADDI R2, R1, #32 inner: L.D F0, 0(R1)
More informationarxiv: v2 [cs.dc] 2 Apr 2016
Sbgraph Conting: Color Coding Beyond Trees Venkatesan T. Chakaravarthy 1, Michael Kapralov 2, Prakash Mrali 1, Fabrizio Petrini 3, Xiny Qe 3, Yogish Sabharwal 1, and Barch Schieber 3 arxiv:1602.04478v2
More informationLow-Power, High-Performance Analog Neural Branch Prediction
Appears in the Proceedings of the 41 st Annual IEEE/ACM International Symposium on Microarchitecture Low-Power, High-Performance Analog Neural Branch Prediction Renée St. Amant Department of Computer Sciences
More informationVLSI Design. [Adapted from Rabaey s Digital Integrated Circuits, 2002, J. Rabaey et al.] ECE 4121 VLSI DEsign.1
VLSI Design Adder Design [Adapted from Rabaey s Digital Integrated Circuits, 2002, J. Rabaey et al.] ECE 4121 VLSI DEsign.1 Major Components of a Computer Processor Devices Control Memory Input Datapath
More informationAPPENDIX B MATRIX NOTATION. The Definition of Matrix Notation is the Definition of Matrix Multiplication B.1 INTRODUCTION
APPENDIX B MAIX NOAION he Deinition o Matrix Notation is the Deinition o Matrix Mltiplication B. INODUCION { XE "Matrix Mltiplication" }{ XE "Matrix Notation" }he se o matrix notations is not necessary
More information1. State-Space Linear Systems 2. Block Diagrams 3. Exercises
LECTURE 1 State-Space Linear Sstems This lectre introdces state-space linear sstems, which are the main focs of this book. Contents 1. State-Space Linear Sstems 2. Block Diagrams 3. Exercises 1.1 State-Space
More informationSareban: Evaluation of Three Common Algorithms for Structure Active Control
Engineering, Technology & Applied Science Research Vol. 7, No. 3, 2017, 1638-1646 1638 Evalation of Three Common Algorithms for Strctre Active Control Mohammad Sareban Department of Civil Engineering Shahrood
More informationAssignment Fall 2014
Assignment 5.086 Fall 04 De: Wednesday, 0 December at 5 PM. Upload yor soltion to corse website as a zip file YOURNAME_ASSIGNMENT_5 which incldes the script for each qestion as well as all Matlab fnctions
More informationState Space Models Basic Concepts
Chapter 2 State Space Models Basic Concepts Related reading in Bay: Chapter Section Sbsection 1 (Models of Linear Systems) 1.1 1.1.1 1.1.2 1.1.3 1.1.5 1.2 1.2.1 1.2.2 1.3 In this Chapter we provide some
More information10.4 Solving Equations in Quadratic Form, Equations Reducible to Quadratics
. Solving Eqations in Qadratic Form, Eqations Redcible to Qadratics Now that we can solve all qadratic eqations we want to solve eqations that are not eactl qadratic bt can either be made to look qadratic
More information