Scribd
Upload
19 views1 page

Quiz 01 Section A

This document is a quiz for the Parallel and Distributed Computing course (CS-3216 Fall22) for BSCS students. It includes questions on processor speed, multitasking techniques, program scalability, maximum speedup calculations, and properties of a 3D-Mesh. The quiz is designed to assess students' understanding of key concepts in parallel and distributed computing within a 35-minute timeframe.

Uploaded by

drmuhammadilyasfakhir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views1 page

Quiz 01 Section A

This document is a quiz for the Parallel and Distributed Computing course (CS-3216 Fall22) for BSCS students. It includes questions on processor speed, multitasking techniques, program scalability, maximum speedup calculations, and properties of a 3D-Mesh. The quiz is designed to assess students' understanding of key concepts in parallel and distributed computing within a 35-minute timeframe.

Uploaded by

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

Parallel and Distributed Computing (CS-3216 Fall22)

Quiz # 1 Class: BSCS Time Allowed: 35 minutes


Roll No: _________________ Name: _____________ Section _____________

1. Processor speed doesn’t strictly follow the 5. Consider following dependency graph and the
Moore’s law from the past sixty years weights:
a. True
b. False
A 5
2. In which of following technique, users can
B 5
interact with every running process on a CPU
a. Multitasking C 2
b. Multiprogramming D 9
c. Multithreading E 1
d. Multidata F 5
G 5
3. A program is scalable such that if we increase
the number of processes then speedup remains
same. • Find the maximum and average degree of
a. True concurrency. (Marks: 2+4)
b. False • What is the smallest number of
cores/processors needed to get the best
4. Assume you have a sequential program that runs performance? Explain (Marks: 2)
in thirty-two (32) seconds. You profile the
program and notice that sixteen (16) seconds of
6. Consider a 3D-Mesh having 3√𝑝 × 3√𝑝 × 3√𝑝
the program is spent on work that can be done in
parallel and that it can be made perfectly parallel. nodes where it has nodes in x, y, and z dimension.
What is the maximum speedup you could ever Find and derive the expression of bisection width
achieve? and arc-connectivity of the 3D mesh (Marks: 2+2)
What is parallel efficiency if you use four Note: Writing just final expression carry no
processors? Present all the calculations. marks. You need to derive/justify the
(Marks: 3+2) expression.

A 5×5×5 mesh is given as an example

You might also like