MU Computer Engineering (Semester 8)
Parallel & Distributed Systems
December 2012
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 the reasons why the use and popularity of distributed systems rapidly increasing despite the increased complexity and difficulty of building it.
10 M
1 (b) Explain how transparency is achieved in Remote Procedure Calls.
10 M

2 (a) With neat diagrams explain Failure handling mechanisms in message passing.
10 M
2 (b) Compare stateful and stateless servers.
10 M

3 (a) What are the commonly used semantics of ordered delivery of multicast messages?
10 M
3 (b) Define Thrashing. What are the methods used for solving Thrashing problems?
10 M

4 (a) Explain distributed algorithms for Clock synchronization.
10 M
4 (b) What are the common strategies used for handling deadlocks in distributed systems?
10 M

5 (a) Explain different Load estimation policies and process transfer policies used by Load balancing algorithms.
10 M
5 (b) With neat diagrams, explain the commonly used ways in which threads of a process are organized.
10 M

6 (a) What are the main approaches to verify the validity of cached data in DFS?
10 M
6 (b) Compare characteristic features of System Oriented Names and Human Oriented Names.
10 M

Write short notes on (any two)
7 (a) Distributed Computing Environment (DCE)
10 M
7 (b) Heterogeneous DSM
10 M
7 (c) Election Algorithms
10 M
7 (d) Fault Tolerance in DFS
10 M



More question papers from Parallel & Distributed Systems
SPONSORED ADVERTISEMENTS