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
Question 1: You want to perform the task of setting an alarm on your mobile phone. You can assume that the alarm option is accessible from the main menu of your phone. (a) P

Binary Search Now that the basic framework is working, it is time to begin implementing a few alternative search functions. Each of these search algorithms have strengths and

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

At the bottom of the toolbar there is a box with two lesser boxes and an arrow. The uppermost box displays the present foreground color; the lowermost box shows the present backgro

Illustrates about Metal Fix. A Metal Fix implies that only the upper metal interconnects layers are influenced. Connections may be made or broken, but new cells may not be adde

Compare memory mapped I/O with I/O mapped I/O. Memory Mapped I/O Scheme: In this scheme there is only one address space. Address space is stated as all possible addresses tha

Declarative programming languages: We notice that declarative programming languages can have some better compensation over procedural ones. Actually, it is often said that a J

Suppose you work in a network security company, and you need to prepare a survey report of a particular security issue of wireless networking. To start with, select an area of wire

Describe about the Forms- DBMS Forms are generally known as data entry screens as they are user interface that allows data in the tables to be viewed, edited or entered. Forms

Describe the term- Systems Analysis A systems analysis team is every so often brought in to improve on an existing system. Often this involves moving from a paper-based filing