MU Computer Engineering (Semester 8)
Parallel & Distributed Systems
December 2013
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1 (a) Explain absolute ordering and causal ordering process with the help of example for many to many communication.
10 M
1 (b) Compare processes and threads explain user and kernel level threads execution and also the need of light weight threads.
10 M

2 (a) What are the good features of distributed file systems? Explain file sharing semantics of it.
10 M
2 (b) Discuss file caching for distributed system.
10 M

3 (a) What is physical clock synchronization? Explain any one algorithm in detail.
10 M
3 (b) Explain main issue in building a DSM system on a network of heterogeneous machines.
10 M

4 (a) Explain deadlock avoidance algorithm in a distributed system.
10 M
4 (b) How are failure handled in message passing system in distributed system?
10 M

5 (a) Explain centralized algorithm for mutual exclusion. What are the advantages and disadvantages of it over distributed algorithm?
10 M
5 (b) Explain Marshalling/Unmarshalling mechanism in RPC/RMI.
10 M

6 (a) Explain the concept of load Balancing along with sender initiated algorithm.
10 M
6 (b) Explain distributed Resource Management with respective to distributed computing environment.
10 M

Write short notes on :-
7 (a) Fault Tolerance
10 M
7 (b) Issue in designing of load sharing algorithm.
10 M



More question papers from Parallel & Distributed Systems
SPONSORED ADVERTISEMENTS