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
Define the password methods and Biometric systems for implementing client server network security. In cyberspace, buyers and sellers cannot notice each other. Also within video

Objectives of object oriented analysis After going through this unit, you should be able to: define the concepts of the objects in the system; express desired syste

Q. Hard and Soft Real Time Systems? Hard Real Time Systems that guarantee critical tasks are completed on time. Soft Real Time Systems that are less restrictive type o

The VLSI technology is still developing. More and more powerful microprocessors and more storage space now are being put in single chip. One question that we have still not conside

Explain how a node can be inserted into an AVL tree. We can insert a node into an AVL tree through the insertion algorithm for binary search trees in which we compare the key o

how to prove the partial order R is a total order in discrete mathmetics and structures by topological sorting method in c programming

'On many systems, you can describe a function matherr which will be known as when there are certain floating-point errors, like errors in the math routines in .

1. It is hard even for a highly skilled experts to abstract good situational assessment when he is under time pressure. 2. Expert systems perform well with specific t

Desk Top Publishing (DTP) As word processors develop increasingly more sophisticated features, differences with desk top publishing (DTP) packages becomes more and more blurred