Scribd
Upload
31 views2 pages

Spring 2024 - CS621 - 2

Cs621

Uploaded by

areebatariq8421864
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
31 views2 pages

Spring 2024 - CS621 - 2

Cs621

Uploaded by

areebatariq8421864
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Parallel and Distributed Computing (CS621) Total marks = 20

Assignment # 02 Deadline
st
1 July 2024
Spring 2024

Please carefully read the following instructions before attempting the assignment.

RULES FOR MARKING


It should be clear that your assignment would not get any credit if:
 The assignment is submitted after the due date.
 The submitted assignment does not open or the file is corrupt.
 Strict action will be taken if the submitted solution is copied from any other student or the
internet.

You should consult the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in Doc or Docx format.
Any other formats like scanned images, PDF, ZIP, RAR, PPT, BMP, etc. will not be accepted.

Learning Objectives:
The objective of this assignment is to:
 Basic understanding of decomposition of computation to be executed in parallel.
 Learn and practice dividing a computation into sub-units/tasks.

NOTE

No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding
or internet malfunctioning etc.). Hence refrain from uploading assignments in the last hour of the deadline. It is
recommended to upload the solution at least two days before its closing date.

If you people find any mistake or confusion in the assignment (Question statement), please consult with your
instructor before the deadline. After the deadline, no queries will be entertained in this regard.

For any query, feel free to email me at:


[email protected]
Question Marks (20)

Decomposition is the process of breaking a computation into smaller parts so that some or all of them can be executed in
parallel. Decomposition can be illustrated in the form of a directed graph with nodes corresponding to tasks and edges
indicating that the result of one task is required for processing the next. Such a graph is called a task dependency graph.
Table 01 shows a university database query that needs to filter student records based on the following criteria:
Department (Computer Science OR Mathematics), Enrollment Year (2021 OR 2023), and CGPA (Below 4.0 OR Above 3.5
OR Above 3.0). Every row in the table is a record that has all the details about a specific student. Consider the
computations performed in processing the following query:

Department= (“Computer Science OR Mathematics”) AND Enrollment Year= (“2021” OR “2023”) AND CGPA = (“Below
4.0” OR “Above 3.5” OR “Above 3.0”).

Based on the above information, do the following:

1. Construct a task dependency graph for the given query.


2. Find a Critical path (by mentioning each node value in a sequence).
3. Compute the Average degree of concurrency of the task dependency graph (where the amount of work required
to complete the task at each node is: 12)

Table 01: A database table storing salesman details:

ID Name Department Enrollment Year CGPA


2114 Ali Computer Science 2021 3.7
2214 Asad Mathematics 2023 3.5
2314 Sajjad Computer Science 2021 3.3
2114 Ali Mathematics 2023 3.0
2235 Irfan Mathematics 2023 2.8
2214 Asad Computer Science 2023 3.6
2114 Ali Computer Science 2021 4.0
2235 Irfan Computer Science 2023 2.5
2314 Sajjad Mathematics 2021 3.4

You might also like