PROBLEM-2: Consider the following code fragment to be executed in an 8-stage pipeline machine with Branch is resolved at the end of the 6th stage. Assume byte addressable memory PC address in hexadecimal 008 00A 100 102 120 122 Instruction PROC XOR How many cycles could be the branch penalty? Answer the following questions. Show your work for each question: L What is the number of pipeline fill cycles? iv. Calculate the Branch target address, in decimal? . BNE R1, R2, +8 INT 21 ENDP AQU X, Y Explain using RTL notation what happens during the Fetch, Decode, and Execute stages of the BNE instruction? w Calculate the CPI when executing the above code, for the following two cases: a. If Branch is never taken b. If Branch is taken.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Please please help with typed answer ??? fast

PROBLEM-2:
Consider the following code fragment to be executed in an 8-stage pipeline machine with Branch is
resolved at the end of the 6th stage. Assume byte addressable memory
PC address in hexadecimal
008
00A
100
102
120
122
Instruction
PROC AQU
XOR
X, Y
ill. How many cycles could be the branch penalty?
.
BNE R1, R2, +8
Answer the following questions. Show your work for each question:
i. What is the number of pipeline fill cycles?
iv. Calculate the Branch target address, in decimal?
INT 21
ENDP
i Explain using RTL notation what happens during the Fetch, Decode, and Execute stages of
the BNE instruction?
v. Calculate the CPI when executing the above code, for the following two cases:
a. If Branch is never taken
b. If Branch is taken.
Transcribed Image Text:PROBLEM-2: Consider the following code fragment to be executed in an 8-stage pipeline machine with Branch is resolved at the end of the 6th stage. Assume byte addressable memory PC address in hexadecimal 008 00A 100 102 120 122 Instruction PROC AQU XOR X, Y ill. How many cycles could be the branch penalty? . BNE R1, R2, +8 Answer the following questions. Show your work for each question: i. What is the number of pipeline fill cycles? iv. Calculate the Branch target address, in decimal? INT 21 ENDP i Explain using RTL notation what happens during the Fetch, Decode, and Execute stages of the BNE instruction? v. Calculate the CPI when executing the above code, for the following two cases: a. If Branch is never taken b. If Branch is taken.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
ALU instructions
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education