Answered: Question 1: Calculate the parallel…

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

100%

Question 1: Calculate the parallel speedup of a computing system where 100 seconds will need to run a program sequentially and 20 seconds will need to run the same program in parallel on some number of processors, P.

Question 2: Find out the parallel efficiency of the computer where number of processors P=150 and the speedup is 10 Times.

Question 3: If P% of a program is parallel, then find out the maximum speedup of that program according to Amdahl's Law.

Question 4: What is the overall speedup if you make 25% of a program 75 times faster?

Question 5: We are considering an enhancement to the processor of a web server. The new CPU is 15 times faster on search queries than the old processor. The old processor is busy with search queries 80% of the time, what is the speedup gained by integrating the enhanced CPU?

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
1 | 2 | 3 | 4 |
5
10
11
12
13
14
Instruction 1
DI
co FO EI wo
FI
Instruction 2
FI
DI co| Fo EI wo
Instruction 3
FI
DI co Fo
EI wo
DI co FO EI
Instruction 4
FI
wo
DI co FO EI
DI co FO
Instruction 5
FI
wo
Instruction 6
FI
EI
wo
Instruction 7
FI
DI |co FO
EI
wo
Instruction 8
FI| DI co FO
wo
EI
Instruction 9
FI
DI
co| FO
EI
wO
Figure 1: Timing Diagram for Instruction Pipeline Operation

Question 10: For the task graphs given in the figure determine the following:

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Fundamentals of Input and Output Performance

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