2) Consider the following sequence of instructions: 123456 1. lw $s2, 0($s1) 2. lw $s1, 40($s6) 3. sub $s6, $s1, $s2 4. add $s6, $s2, $s2 5. or $s3, $s6, $zero 6. SW $s6, 50($s1) a) b) List all of the data dependencies. The first is given to you - use this format when listing all of the others. 3 depends on 1 ($s2) Assume that a 5-stage MIPS pipeline is being used with no forwarding and each stage takes 1 cycle. Instead of inserting NOPS you let the process stall on hazards. How many times does the processor stall? How long is each stall (in cycles)? What is the execution time (in cycles) for the entire program? Assume that full-forwarding has been added. write the program with NOPs to eliminate the hazards. Note: Delay slots are not used.

C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter1: Fundamentals Of C++ Programming
Section1.4: Preliminary Four: Algorithms
Problem 6E: (Numerical) a. Write a set of detailed, step-by-step instructions in English to calculate the fewest...
icon
Related questions
Question

Refer to the screenshot to solve the questions on MIPS / PIPELINING:

2) Consider the following sequence of instructions:
123456
1.
lw
$s2, 0($s1)
2.
lw
$s1, 40($s6)
3.
sub
$s6, $s1, $s2
4.
add
$s6, $s2, $s2
5.
or
$s3, $s6, $zero
6.
SW
$s6, 50($s1)
a)
b)
List all of the data dependencies. The first is given to you - use this format when
listing all of the others.
3 depends on 1 ($s2)
Assume that a 5-stage MIPS pipeline is being used with no forwarding and each
stage takes 1 cycle. Instead of inserting NOPS you let the process stall on
hazards. How many times does the processor stall? How long is each stall (in
cycles)? What is the execution time (in cycles) for the entire program?
Assume that full-forwarding has been added. write the program with NOPs to
eliminate the hazards. Note: Delay slots are not used.
Transcribed Image Text:2) Consider the following sequence of instructions: 123456 1. lw $s2, 0($s1) 2. lw $s1, 40($s6) 3. sub $s6, $s1, $s2 4. add $s6, $s2, $s2 5. or $s3, $s6, $zero 6. SW $s6, 50($s1) a) b) List all of the data dependencies. The first is given to you - use this format when listing all of the others. 3 depends on 1 ($s2) Assume that a 5-stage MIPS pipeline is being used with no forwarding and each stage takes 1 cycle. Instead of inserting NOPS you let the process stall on hazards. How many times does the processor stall? How long is each stall (in cycles)? What is the execution time (in cycles) for the entire program? Assume that full-forwarding has been added. write the program with NOPs to eliminate the hazards. Note: Delay slots are not used.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
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
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning