DataPath Performance Evaluation: Use the following information for all parts of the question. Please round your answers to 2 decimal places. Memory Access = 680 ps ALU Operations = 340 ps Register Access = 170 ps Note: for this exam, the critical data path for JUMP is just the Instruction Fetch stage. 1. If we implement the DataPath as a single-cycle using variable cycle length, fill in the cycle time for the following statement types (critical data path) in ps. R-Type: = Load Type = Store Type = Branch Type = Jump = ps ps ps ps ps

C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter5: Repetition Statements
Section: Chapter Questions
Problem 2PP: (Mechanics) The deflection at any point along the centerline of a cantilevered beam, such as the one...
icon
Related questions
Question
Please help with this Computer architecture homework question.
DataPath Performance Evaluation: Use the following information for all parts of the question.
Please round your answers to 2 decimal places.
24:01 SHIST
Memory Access = 680 ps
ALU Operations = 340 ps
Register Access = 170 ps
Note: for this exam, the critical data path for JUMP is just the Instruction Fetch stage.
1. If we implement the DataPath as a single-cycle using variable cycle length, fill in the cycle
time for the following statement types (critical data path) in ps.
R-Type: =
Load Type =
Store Type =
Branch Type=
ps
ps
TYPE
R-Type
Load
Store
Branch
Jump
ps
ps
Jump =
2. If we implement the above DataPath using a single-cycle with fixed length, the cycle length
would be
ps.
ps
3. If we are running a program with instruction mix:
R-type = 48%
Load type=19%
Store type = 23%
Branch type=8%
Jump = 2%
%age
the average time to execute an instruction is
Critical Time
notoulart
ps
Weighted Time
Transcribed Image Text:DataPath Performance Evaluation: Use the following information for all parts of the question. Please round your answers to 2 decimal places. 24:01 SHIST Memory Access = 680 ps ALU Operations = 340 ps Register Access = 170 ps Note: for this exam, the critical data path for JUMP is just the Instruction Fetch stage. 1. If we implement the DataPath as a single-cycle using variable cycle length, fill in the cycle time for the following statement types (critical data path) in ps. R-Type: = Load Type = Store Type = Branch Type= ps ps TYPE R-Type Load Store Branch Jump ps ps Jump = 2. If we implement the above DataPath using a single-cycle with fixed length, the cycle length would be ps. ps 3. If we are running a program with instruction mix: R-type = 48% Load type=19% Store type = 23% Branch type=8% Jump = 2% %age the average time to execute an instruction is Critical Time notoulart ps Weighted Time
4. If we implement the Critical DataPath using multiple cycles for each instruction (where each
stage = 1 cycle), fill in the number of cycles required for each instruction type:
R-type: =
Load-type=
Store type=
Branch type=
Jump =
5. Using the same instruction mix as above,
the average number of cycles to execute the Critical DataPath is
6. If we implement the DataPath using a pipelined design using 5 cycles (stages),
the length of one cycle would be
SHO
7. In the pipelined design, the length of time to execute a complete instruction would be
ps.
ps.
8. In evaluating the pipelined implementation, it is useful to find the effective number of cycles
per instruction. (The goal of our pipeline is to get an effective number of cycles to be 1.0)
TYPE
R-Type
Load
Store
Branch
Jump
The given program has:
24% of the load instructions are immediately following by an instruction that uses the result
(requiring a delay), the branch delay on a "misprediction" is 2 clock cycles and 13% of the
branches are mispredicted, and jumps always pay 1 full cycle of delay. All other statements
require only 1 cycle through the pipeline (after the pipeline is loaded).
%agep
cycles (stages)
Use the instruction mix from question #3 to find the average effective number of cycles for the
pipeline.
Average number of effective cycles:
Effective Cycles
edi bat
4 101 an
Weighted Effective Cycles
eleyipns sons
Transcribed Image Text:4. If we implement the Critical DataPath using multiple cycles for each instruction (where each stage = 1 cycle), fill in the number of cycles required for each instruction type: R-type: = Load-type= Store type= Branch type= Jump = 5. Using the same instruction mix as above, the average number of cycles to execute the Critical DataPath is 6. If we implement the DataPath using a pipelined design using 5 cycles (stages), the length of one cycle would be SHO 7. In the pipelined design, the length of time to execute a complete instruction would be ps. ps. 8. In evaluating the pipelined implementation, it is useful to find the effective number of cycles per instruction. (The goal of our pipeline is to get an effective number of cycles to be 1.0) TYPE R-Type Load Store Branch Jump The given program has: 24% of the load instructions are immediately following by an instruction that uses the result (requiring a delay), the branch delay on a "misprediction" is 2 clock cycles and 13% of the branches are mispredicted, and jumps always pay 1 full cycle of delay. All other statements require only 1 cycle through the pipeline (after the pipeline is loaded). %agep cycles (stages) Use the instruction mix from question #3 to find the average effective number of cycles for the pipeline. Average number of effective cycles: Effective Cycles edi bat 4 101 an Weighted Effective Cycles eleyipns sons
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Fundamentals of Computer System
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
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr