Given the following sequence of instructions:lw $s3, 40($s1) //1 lw $s2, 40($s0) //2 add $s1, $s2, $s3 //3 sub $s2, $s2, $s3 //4 sw $s1, 20($s0) //5 lw $s4, 80($s2) //6 add $s1, $s4, $s2 //7List the read-after-write (current instruction is reading certain registers which haven’t been written back yet) data dependencies. Please use the format, e.g., 3 on 1 ($s3) to show that instruction 3 has data dependency on instruction 1 since it is reading register $s3.Assume the 5-stage MIPS pipeline with no forwarding, and each stage takes 1 cycle. Instead of inserting NOPs, you let the processor 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 whole program? Sketch a diagram to explain your answer.Assume the 5-stage MIPS pipeline with full forwarding. Will all the stall you saw in Question b be eliminated? If not, insert NOPs instead of stall to eliminate the hazards. Sketch a diagram to illustrate your answer.

Since you are asking multiple questions we are answering first question for you. If you want…

Answered: Given the following sequence of…

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

See similar textbooks

Related questions

Concept explainers

Question

Given the following sequence of instructions:

lw $s3, 40($s1) //1 lw $s2, 40($s0) //2 add $s1, $s2, $s3 //3 sub $s2, $s2, $s3 //4 sw $s1, 20($s0) //5 lw $s4, 80($s2) //6 add $s1, $s4, $s2 //7

List the read-after-write (current instruction is reading certain registers which haven’t been written back yet) data dependencies. Please use the format, e.g., 3 on 1 ($s3) to show that instruction 3 has data dependency on instruction 1 since it is reading register $s3.
Assume the 5-stage MIPS pipeline with no forwarding, and each stage takes 1 cycle. Instead of inserting NOPs, you let the processor 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 whole program? Sketch a diagram to explain your answer.

Assume the 5-stage MIPS pipeline with full forwarding. Will all the stall you saw in Question b be eliminated? If not, insert NOPs instead of stall to eliminate the hazards. Sketch a diagram to illustrate your answer.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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