Scribd
Upload
114 views

Parallel and Distributed Systems

This document is an exam for a Parallel and Distributed Systems course. It contains 7 questions worth a total of 70 marks. The questions cover topics like crash-robust consensus algorithms, the 15-puzzle problem, parallel quicksort algorithms, and whether routing algorithms can guarantee packet delivery under infinite topological changes.

Uploaded by

Ninad Madhab
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
114 views

Parallel and Distributed Systems

This document is an exam for a Parallel and Distributed Systems course. It contains 7 questions worth a total of 70 marks. The questions cover topics like crash-robust consensus algorithms, the 15-puzzle problem, parallel quicksort algorithms, and whether routing algorithms can guarantee packet delivery under infinite topological changes.

Uploaded by

Ninad Madhab
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

END SEMESTER EXAMINATION (HYBRID MODEL)

COURSE NAME: B. Tech. SEMESTER: 8th


BRANCH NAME: CSE/IT
SUBJECT NAME: Parallel and Distributed Systems
FULL MARKS: 70 TIME: 2 Hours
Answer All Questions.
The figures in the right hand margin indicate Marks. Symbols carry usual meaning.

Q1. Assume that routing tables are updated after each topological change in such a way [10]
that they are cycle-free even during updates. Does this guarantee that packets are
always delivered even when the network is subject to a possibly infinite number of
topological changes? Prove that no routing algorithm can guarantee delivery of
packets under continuing topological changes.

Q2.  Prove, that if more that (N + t)/2 processes start the crash-robust consensus [10]
algorithm with input v, then a decision for v is taken in three rounds.
 Prove, that if more than (N - t)/2 processes start the algorithm with input v, then
a decision for v is possible.
 Is a decision for v possible if exactly (N - t)/2 processes start the algorithm with
input v?
What are the bivalent input configurations of the algorithm?

Q3. Describe the 15-Puzzle problem with a suitable state-space diagram. [10]

Q4. Consider the parallel formulation of quicksort for a d-dimensional hypercube. Show [10]
that after d splits one along each communication link the elements are sorted
according to the global order defined by the process's labels.

Q5. Write the Fine-Grain parallel algorithm and Coarse-Grain 2-D parallel algorithm. [10]

Q6. Show that procedure CREW MERGE can be simulated on an EREW computer in [10]
O((n/N) + log2n) time if a way can be found to distinguish between simple read
operations (each processor needs to gain access to a different memory location) and
multiple-read operations.

Q7. Assume that routing tables are updated after each topological change in such a way [10]
that they are cycle-free even during updates. Does this guarantee that packets are
always delivered even when the network is subject to a possibly infinite number of
topological changes? Prove that no routing algorithm can guarantee delivery of
packets under continuing topological changes.

Page 1 of 1

You might also like