Consider a branch instruction which is executed 8 times in a program. The actual outcomes of the branch are N, T, N, T, N,N,N, T where T = Taken and N = Not taken. Dynamic branch prediction is used to predict the branch outcomes. Show the predictions made for each instance of the branch and calculate the branch prediction accuracy in case of the following two predictors: a) A 1-bit branch predictor which starts in the LNT (Likely Not Taken) state Assume states to be SLT - Strongly Likely to be Taken (11) LT - Likely to be Taken (10) NLT - Not Likely to be taken (01) SNT - Strongly Not Likely to be taken(00) (b) A 2-bit branch predictor which starts in the SNT state N.B. drawing the state diagram can help solve the problem easily.
Consider a branch instruction which is executed 8 times in a program. The actual outcomes of the branch are N, T, N, T, N,N,N, T where T = Taken and N = Not taken. Dynamic branch prediction is used to predict the branch outcomes. Show the predictions made for each instance of the branch and calculate the branch prediction accuracy in case of the following two predictors: a) A 1-bit branch predictor which starts in the LNT (Likely Not Taken) state Assume states to be SLT - Strongly Likely to be Taken (11) LT - Likely to be Taken (10) NLT - Not Likely to be taken (01) SNT - Strongly Not Likely to be taken(00) (b) A 2-bit branch predictor which starts in the SNT state N.B. drawing the state diagram can help solve the problem easily.
Chapter4: Processor Technology And Architecture
Section: Chapter Questions
Problem 15VE: A(n) ________________ instruction always alters the instruction execution sequence. A(n)...
Related questions
Question
Performance Equations
![Consider a branch instruction which is executed 8 times in a program. The
actual outcomes of the branch are N, T, N, T, N,N,N, T where T =
Taken and N = Not taken. Dynamic branch prediction is used to predict the
branch outcomes. Show the predictions made for each instance of the
branch and calculate the branch prediction accuracy in case of the
following two predictors:
a) A 1-bit branch predictor which starts in the LNT (Likely Not Taken)
state
Assume states to be
SLT - Strongly Likely to be Taken (11)
LT - Likely to be Taken (10)
NLT - Not Likely to be taken (01) SNT - Strongly
Not Likely to be taken(00)
(b) A 2-bit branch predictor which starts in the SNT state
N.B. drawing the state diagram can help solve the problem easily.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F32a19102-9aa4-41a1-899c-fd92c7409b78%2Fdc348f1f-f932-491d-accb-1ca7e095ae5b%2Ftbw6z0n_processed.png&w=3840&q=75)
Transcribed Image Text:Consider a branch instruction which is executed 8 times in a program. The
actual outcomes of the branch are N, T, N, T, N,N,N, T where T =
Taken and N = Not taken. Dynamic branch prediction is used to predict the
branch outcomes. Show the predictions made for each instance of the
branch and calculate the branch prediction accuracy in case of the
following two predictors:
a) A 1-bit branch predictor which starts in the LNT (Likely Not Taken)
state
Assume states to be
SLT - Strongly Likely to be Taken (11)
LT - Likely to be Taken (10)
NLT - Not Likely to be taken (01) SNT - Strongly
Not Likely to be taken(00)
(b) A 2-bit branch predictor which starts in the SNT state
N.B. drawing the state diagram can help solve the problem easily.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
![EBK JAVA PROGRAMMING](https://www.bartleby.com/isbn_cover_images/9781337671385/9781337671385_smallCoverImage.jpg)
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
![Principles of Information Systems (MindTap Course…](https://www.bartleby.com/isbn_cover_images/9781285867168/9781285867168_smallCoverImage.gif)
Principles of Information Systems (MindTap Course…
Computer Science
ISBN:
9781285867168
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
![EBK JAVA PROGRAMMING](https://www.bartleby.com/isbn_cover_images/9781337671385/9781337671385_smallCoverImage.jpg)
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
![Principles of Information Systems (MindTap Course…](https://www.bartleby.com/isbn_cover_images/9781285867168/9781285867168_smallCoverImage.gif)
Principles of Information Systems (MindTap Course…
Computer Science
ISBN:
9781285867168
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
![C++ for Engineers and Scientists](https://www.bartleby.com/isbn_cover_images/9781133187844/9781133187844_smallCoverImage.gif)
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:
9780357392676
Author:
FREUND, Steven
Publisher:
CENGAGE L
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage