Scribd
Upload
18 views

PDC Assigment - 01

The document provides instructions for an assignment on parallel and distributed computing. It asks students to analyze task graphs to determine concurrency, critical path length, speedup, and optimal process allocation. It also asks students to map task dependency graphs to 3 and 4 processes and prove the mappings are optimal.

Uploaded by

Nafay ur Rehman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

PDC Assigment - 01

The document provides instructions for an assignment on parallel and distributed computing. It asks students to analyze task graphs to determine concurrency, critical path length, speedup, and optimal process allocation. It also asks students to map task dependency graphs to 3 and 4 processes and prove the mappings are optimal.

Uploaded by

Nafay ur Rehman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Bahria University Karachi Campus CEN455-: Parallel and Distributed Computing

Department of Computer Science Semester07A&B (Spring 2023)

ASSIGNMENT 01
Marks: 05

NAME: Nafay Ur Rehman

CLASS: BS(CS) – 7B

REG #: 67735

Marks Obtained:

Instructions. - Assignment is to be submitted online on LMS.


- This Assignment is individual activity to be done by every student.

1. For the task graphs given in Figure, determine the following: [PLO1, CLO1, C2] [2- Marks]
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.
5. The maximum achievable speedup if the number of processes is limited to (a) 2, (b) 4, and (c)
8.

1
Bahria University Karachi Campus CEN455-: Parallel and Distributed Computing
Department of Computer Science Semester07A&B (Spring 2023)

2
Bahria University Karachi Campus CEN455-: Parallel and Distributed Computing
Department of Computer Science Semester07A&B (Spring 2023)

2. Solve the following: [PLO1, CLO1, C2] [3- Marks]


a. Show an efficient mapping of the task-dependency graph of the
decomposition shown in following 14 tasks onto three processes. Prove
informally that your mapping is the best possible mapping for three
processes.
b. Describe and draw an efficient mapping of the task-dependency graph of the
decomposition shown in following 14 tasks onto four processes and prove
that your mapping is the best possible mapping for four processes.

3
Bahria University Karachi Campus CEN455-: Parallel and Distributed Computing
Department of Computer Science Semester07A&B (Spring 2023)

4
Bahria University Karachi Campus CEN455-: Parallel and Distributed Computing
Department of Computer Science Semester07A&B (Spring 2023)

You might also like