Two - bit correlating predictor, Computer Engineering

The history file, history.txt, is the branch history of a run of the gcc compiler (the first field is the address of the branch instruction, the second field is the target branch address and the third field is 1 for a branch taken and a 0 for a branch not taken).

Write a program that models a static branch predictor, a one-bit branch predictor,  a two-bit branch predictor, and a two-bit correlating predictor.  The static branch predictor predicts the branch is taken when the branch is backwards and it predicts the branch is not taken when the branch is forwards.  The one-bit predictor predicts that the branch is taken the same way it was taken last time.  The two-bit predictor is described on page C-28 of your text book, page 162 : Computer Architecture : A Quantitative Approach Henessy, J, Patterson Fifth Edition.

For the static predictor, calculate the percentage of times it correctly predicts the branch.

The accuracy of the one- and two-but predictors depends, in part, on the number of entries in the branch prediction table.  The number of entries corresponds to powers of two.  The specific entry used to predict a branch is indicated by the lower n bits of the address of the branch instruction where 2n is the number of entries in the table.

On the same graph, plot the accuracy (100 * correct predictions /total branches) of your one- and two-bit branch predictors for branch prediction table sizes from 4 to 65536 entries

Posted Date: 4/2/2013 1:16:53 AM | Location : United States







Related Discussions:- Two - bit correlating predictor, Assignment Help, Ask Question on Two - bit correlating predictor, Get Answer, Expert's Help, Two - bit correlating predictor Discussions

Write discussion on Two - bit correlating predictor
Your posts are moderated
Related Questions
What does formal verification mean? Formal verification uses Mathematical techniques by proving the design by assertions or properties. Correctness of the design can be achiev

Arc Consistency: There have been many advances in how constraint solvers search for solutions (remember this means an assignment of a value to each variable in such a way that

? XML can be used to explain and recognize information accurately and unambiguously, in a way that computers can be programmed to? Understand? (Well, at least influence as if they

Q. Execute a reduce operation over members of specified group? int info = pvm_reduce( void (*func)(), void *data, int count, int datatype, int msgtag, char    *group, int root

WebLogic JMS handles cluster-wide, transparent access to destinations from any server in the cluster. A system administrator can set up cluster-wide, transparent access to destinat

State about movable joystick In another type of movable joystick, the stick is used to activate switches that cause the screen cursor to move at a constant rate in the selected

Determine the uses of Programming Language Interface PLI  is  used  for  implementing  system  calls  that would  have  been  hard  to  do  otherwise  (or impossible) using Ve

What are the different kinds of lock modes? There are three types of lock modes:- Shared lock Exclusive lock. Extended exclusive list.

Explain dataflow computation model An option to the von Neumann model of computation is a dataflow computation model. In a dataflow model the control is tied to the flow of dat

Solve the problem in page 346 of the paper on cell formation by Boctor using the MIP method.  Use 4 cells and no more than 3 machines per cell. Solve the problem using the MIP m