Distributed System - May 2013

Information Technology (Semester 6)

TOTAL MARKS: 80
TOTAL TIME: 3 HOURS (1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Assume data if required.
(4) Figures to the right indicate full marks. 1 (a) Explain absolute ordering and causal ordering process with the help of example for many to many communication.(10 marks) 1 (b) Explain RPC system model in detail.(10 marks) 2 (a) Discuss the need of coordinator. Also give any one algorithm for coordinator selection. (10 marks) 2 (b) What is the difference between Strict consistency model and Sequential consistency model? How sequential consistency model is implemented in DSM? (10 marks) 3 (a) What is physical clock synchronization? Explain any one algorithm in detail.(10 marks) 3 (b) Explain deadlock avoidance algorithm in a distributed system. (10 marks) 4 (a) How does light weight RPC work in cross domain architecture?(10 marks) 4 (b) Discuss file caching for distributed system. (10 marks) 5 (a) Discuss how processes and resources are bound together. How does process migration take place in Heterogeneous environment?(10 marks) 5 (b) What are the good features of a Distributed File Systems? Explain file sharing semantics of it. (10 marks) 6 (a) Justify the need of stateful and stateless server in RPC management.(10 marks) 6 (b) How are failures handles in message passing system in distributed systems?(10 marks)

Write short notes on (any two)

7 (a) Distributed Transaction Management(10 marks) 7 (b) System Oriented Names for Distributed Computing(10 marks) 7 (c) Load Balancing Issues(10 marks) 7 (d) Distributed System Models (10 marks)