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.

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.

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

Similar questions

True/False The number of local sequential devices (flops, latches) would need to increase from a nonpipelined machine to a pipelined machine.
5
1A.What condition needs to be satisfied so that converting from a nonpipelied to a pipelined machine the throughput goes up by ‘N’, where ‘N’ is the number of stages in the pipeline? 1B.Is that practical? If not practical, why?
Give the count range for the following sized up-counters: 8-bits, 12-bits, 16-bits, 20-bits, 32-bits For each size of a counter in part 1, assuming a 1 Hz clock, how much time would pass before the counter wraps around? Use the most appropriate units for each answer (seconds, minutes, hours, days, weeks, months, or years).
CLK Do C lo 20 D₁ C 2₁ 2₁ D₂ C 2₂ Figure 1 . Using the asynchronous ripple counter in Figure 1 and assuming that the propagation delay from an input clock to a change in the output of Q is 9ns, what is the worst-case delay (i.e. longest delay) between an input clock pulse and the counter being in a final state. Give which state(s) of the counter have the worst-case delay.
Draw a side-by-side bar chart to display the distribution of gender for each award the students would prefer to win for the 200 students.
Solve number 2