ANSWER THE QUSTIONS THAT IS WRITEN OR ON THE PICTURE PLEASE Question 6: Suppose in a program there are 120 instructions, and 6 stages are required for each instruction to be processed. Time required in each stage is equivalent to 1 ps. Calculate the speedup of pipeline parallel processing. Question 7: Suppose in a program there are 300 instructions, and 6 stages are required for each instruction to be processed. Time required in each stage is equivalent to 1 ps. Calculate the efficiency of pipeline parallel processing. Question 8: Consider a 5-stage instruction execution in which, Instruction fetch = ALU operation = Data memory access = 250 ps; and Register read = Register write = 200 ps. Find out the speedup factor for pipelined execution. Question 10: For the task graphs given in the figure determine the following:1.Maximum degree of concurrency.2.Critical path length.3. Maximum achievable speedup over one process assuming that an arbitrarily largenumber of processes is available.4. The minimum number of processes needed to obtain the maximum possible speedup.The maximum achievable speedup if the number of processes is limited to (a) 2, (b)4, and (c) 8. Question 9: Consider the timing diagram of Figure 1. Assume that there is only a five-stage pipeline(fetch, read, encode, execute, and write). Redraw the diagram to show how many time units are nowneeded for ten instructions.Time12 | 1323451014Instruction 1FIDI co FOo EI woInstruction 2FIDIco FOEIwoInstruction 3FIDIco FOEIWOInstruction 4FIDICOFOEIInstruction 5FIDIco FOEIWOInstruction 6FIDICOFOEIwoInstruction 7FIDICOFOEI woInstruction 8FIDICOFOEIWOInstruction 9woFIDICOFOEIFigure 1: Timing Diagram for Instruction Pipeline Operation

*As per the company norms and guidelines we are providing one question answer only please repost…

Answered: Question 8: Consider a 5-stage…

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

ANSWER THE QUSTIONS THAT IS WRITEN OR ON THE PICTURE PLEASE

Question 6: Suppose in a program there are 120 instructions, and 6 stages are required for each instruction to be processed. Time required in each stage is equivalent to 1 ps. Calculate the speedup of pipeline parallel processing.

Question 7: Suppose in a program there are 300 instructions, and 6 stages are required for each instruction to be processed. Time required in each stage is equivalent to 1 ps. Calculate the efficiency of pipeline parallel processing.

Question 8: Consider a 5-stage instruction execution in which, Instruction fetch = ALU operation = Data memory access = 250 ps; and Register read = Register write = 200 ps. Find out the speedup factor for pipelined execution.

Question 10: For the task graphs given in the figure determine the following:
1.Maximum degree of concurrency.
2.Critical path length.
3. Maximum achievable speedup over one process assuming that an arbitrarily large
number of processes is available.
4. The minimum number of processes needed to obtain the maximum possible speedup.
The maximum achievable speedup if the number of processes is limited to (a) 2, (b)
4, and (c) 8.

Question 9: Consider the timing diagram of Figure 1. Assume that there is only a five-stage pipeline
(fetch, read, encode, execute, and write). Redraw the diagram to show how many time units are now
needed for ten instructions.
Time
12 | 13
2
3
4
5
10
14
Instruction 1
FI
DI co FOo EI wo
Instruction 2
FI
DI
co FO
EI
wo
Instruction 3
FI
DI
co FO
EI
WO
Instruction 4
FI
DI
CO
FO
EI
Instruction 5
FI
DI
co FO
EI
WO
Instruction 6
FI
DI
CO
FO
EI
wo
Instruction 7
FI
DI
CO
FO
EI wo
Instruction 8
FI
DI
CO
FO
EI
WO
Instruction 9
wo
FI
DI
CO
FO
EI
Figure 1: Timing Diagram for Instruction Pipeline Operation

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