Write operations occur in the first half of the clock cycle and reads occur in the second half of the clock cycle. The table below shows the pipelining diagram for three instructions. Inst/CC 1 2 3 4 5 6 Inst. 1 IF ID EXE MEM WB Stall Inst. 2 Inst. 3 7 8 IF ID EXE MEM WB IF ID EXE MEM WB Where CC stands for clock cycle, stalls are shown as empty rows, and forwarding is indicated between associated stages using an arrow. LDUR X0, [X0, #5] SUB X2, X0, XO SUB X3, X1, X2 ADD X3, X2, X3 ADD X4, X1, X3 a. First assume forwarding is not available, show a similar table for the following sequence of instructions and indicate stalls with empty rows. How many cycles are needed to execute the above sequence of instructions?

EBK JAVA PROGRAMMING
9th Edition
ISBN:9781337671385
Author:FARRELL
Publisher:FARRELL
Chapter5: Making Decisions
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Can someone help me 

Write operations occur in the first half of the clock cycle and reads occur in the second half of
the clock cycle. The table below shows the pipelining diagram for three instructions.
Inst/CC
1
2
3
4
5
6
Inst. 1
IF
ID
EXE
MEM
WB
Stall
Inst. 2
Inst. 3
7
8
IF
ID
EXE
MEM
WB
IF
ID
EXE
MEM WB
Where CC stands for clock cycle, stalls are shown as empty rows, and forwarding is indicated
between associated stages using an arrow.
LDUR X0, [X0, #5]
SUB X2, X0, XO
SUB X3, X1, X2
ADD X3, X2, X3
ADD X4, X1, X3
a. First assume forwarding is not available, show a similar table for the following sequence
of instructions and indicate stalls with empty rows. How many cycles are needed to
execute the above sequence of instructions?
Transcribed Image Text:Write operations occur in the first half of the clock cycle and reads occur in the second half of the clock cycle. The table below shows the pipelining diagram for three instructions. Inst/CC 1 2 3 4 5 6 Inst. 1 IF ID EXE MEM WB Stall Inst. 2 Inst. 3 7 8 IF ID EXE MEM WB IF ID EXE MEM WB Where CC stands for clock cycle, stalls are shown as empty rows, and forwarding is indicated between associated stages using an arrow. LDUR X0, [X0, #5] SUB X2, X0, XO SUB X3, X1, X2 ADD X3, X2, X3 ADD X4, X1, X3 a. First assume forwarding is not available, show a similar table for the following sequence of instructions and indicate stalls with empty rows. How many cycles are needed to execute the above sequence of instructions?
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:
9780357392676
Author:
FREUND, Steven
Publisher:
CENGAGE L
Principles of Information Systems (MindTap Course…
Principles of Information Systems (MindTap Course…
Computer Science
ISBN:
9781285867168
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr