Assignment No.01
Submitted To:
Dr. Umar Shoaib
Submitted By:
Usama bin Waseem
Roll No:
19011519-045
Section:
BSCS-19-VII-B
Course Code:
CS-424
Date:
January 7, 2023
Question No.1
Database query task dependency graphs
i.
What tasks are on the critical path for each dependency graph?
a) For figure (a) 3 tasks are on the critical path for each dependency graph.
Task
10
Task
9
Task
8
b) For figure (b) 4 tasks are on the critical path for each dependency graph.
Task
10
6
11
Task
Task
7
Task
ii.
What is the shortest parallel execution time for each decomposition?
a) For figure (a) shortest parallel execution time is 30 time units.
b) For figure (b) shortest parallel execution time is 40 time units.
iii.
How many processors are needed to achieve the minimum time?
1|Page
a) For figure (a) 4 processors are needed to achieve the minimum time.
b) For figure (b) 4 processors are needed to achieve the minimum time.
iv.
What is the maximum degree of concurrency?
a) For figure (a) maximum degree of concurrency is 4.
b) For figure (b) maximum degree of concurrency is 4.
v.
What is the average parallelism?
a) For figure (a) average parallelism is:
Critical Path Length = 27
Total Amount Of Work = 63
Average Parallelism = 2.33
b) For figure (b) average parallelism is:
Critical Path Length = 34
Total Amount Of Work = 64
Average Parallelism = 1.88
Question No.2
Dependency graph for dense-matrix vector product
i.
What is the maximum number of tasks possible?
‘N’ numbers of tasks are possible.
ii.
What does a task dependency graph look like for this case?
There is no dependency graph for this case because there is no dependency as
there no matrix ‘A’ and vector ‘b’ data.
iii.
What is the shortest parallel execution time for the graph?
‘T’ time is the shortest parallel execution time for the graph.
iv.
How many processors are needed to achieve the minimum time?
‘n’ processors are needed to achieve the minimum time.
v.
What is the maximum degree of concurrency?
The maximum degree of concurrency is ‘n’.
2|Page
vi.
What is the average parallelism?
The average parallelism is ‘n’.
3|Page