SCHOOL OF COMPUTER SCIENCE & ENGINEERING

Digital Assignment - I Winter 2021-22 Slots: E1 & E2

Course: CSE4001 – Parallel and Distributed Computing

Question 1 :
For the task graphs given in Figure 1 (below), determine the following:
A. Maximum degree of concurrency.
B. Critical path length.
C. Maximum achievable speedup over one process assuming that an arbitrarily large
number of processes is available.
D. The minimum number of processes needed to obtain the maximum possible speedup.
E. The maximum achievable speedup if the number of processes is limited to 2, 4, and 8.
Assume that each task node takes an equal amount of time to execute.

Figure 1

Question 2:
Consider the following piece of code:

for (i = 0; i < 50; i ++)

A[i] = ((B[i] * C[i]) + D[i])/2;

 (a) Translate the above code to perform scalar and vector processing with the vector
length of 64.

(b) Calculate the number of cycles required for scalar and vector processing by
considering the information given in the table.

Number of Cycles Description

2 Load and store instructions
4 Multiplication
4 Division
1 Addition

Question 3:
A. Let a program have 40 percent of its code enhanced (so to yield a system
speedup times faster (so . What is the factor of improvement of the
portion enhanced? Justify the resulting speedup efficiency with the actual system
speedup.

B. Let a program have a portion of its code enhanced to run 4 times faster (so
to yield a system speedup 3 times faster (so . What is the fraction
enhanced ? Substitute in System Speedup to justify whether the system speedup
i.e. 3 is obtained or not.

Note : The answers have to be handwritten in paper and scanned to upload in VTop. Write your
name , reg number , course code and name, slot in the answer sheet.