Question: 1. [5] An ( m , n ) correlating branch predictor uses the behavior of the most recent m executed branches to choose from 2

1. [5] An (m,n) correlating branch predictor uses the behavior of the most recent m executed branches to choose from 2m predictors, each of which is an n-bit predictor. For this exercise, consider a (1,2) correlating predictor that can track four branches. For the following branch outcomes, provide each prediction, the table entry used to make the prediction, any updates to the table as a result of the prediction, and the final miss prediction rate of each predictor. Assume that all branches up to this point have been taken. Initialize each predictor to the following: (Note that please use 2-bit Saturating Counter in to figure out your answer.)

Table 1 Correlating predictor

Entry

Branch

Last outcome

Prediction

0

0

T

T

1

0

NT

NT with one miss prediction

2

1

T

T

3

1

NT

NT with one miss prediction

4

2

T

NT

5

2

NT

T with one miss prediction

6

3

T

T

7

3

NT

T

Branch PC(word address)

Outcome

891

NT

454

T

266

T

454

NT

266

T

891

NT

266

NT

891

NT

454

T

Answer :

Please finish the following tables Branch pc

Branch address

(2 bits)

History bit

(0 or 1)

Entry

(0,1,,or 7)

Prediction

T or NT

Outcome

T or NT

Miss predict

Hit or Miss

Table Update

891

454

266

454

266

891

266

891

454

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!