Course Title: Computer Architecture a) Compare between pipeline machine and non-pipeline machine. suppose there are (X+9

[answerhappygod]

Course Title: Computer Architecture
a) Compare between pipeline machine and non-pipeline machine.
suppose there are (X+9) instructions
in a program. Draw the page table and compute the following: (where
X is the last digit of you ID number) * consider there are 5 stages
and each takes one clock cycle.
• Total time for pipeline and non-pipeline.
• CPI
• Speedup
• Efficiency or utilization
b) Consider a non-pipelined machine with 5 execution stages of
lengths 35 ns,40 ns, 45ns, 30 ns, and
20 ns.
- Find the instruction latency on this machine.
- How much time does it take to execute (i+1010)
instructions?
Suppose we introduce pipelining on this machine. Assume that when
introducing
pipelining.
- What is the instruction latency on the pipelined machine?
- How much time does it take to execute (i+1010)
instructions?
Also calculate the speedup.
(where i is the last two digits of you ID number)
c) This question considers the basic MIPS, 5-stage pipeline (IF,
ID, EXE, MEM, WB).
Assume that you have the following sequence of instructions:
lw $s2, 0($s1) (instr1)
add $s3, $s4, $s2 (instr2)
Sub $s6, $s2, $s3. (instr3)
Show the implementation through 5 stages and explain the
implementation for both pipelined and
non-pipelined design. (explain if there is any pipeline
hazards)
My ID Number = 66