Distributed System - Dec 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) Compare processes and threads explain user and kernel level threads execution and also the need of light weight threads.(10 marks) 2 (a) What are the good features of distributed file systems? Explain file sharing semantics of it.(10 marks) 2 (b) Discuss file caching for distributed system.(10 marks) 3 (a) What is physical clock synchronization? Explain any one algorithm in detail.(10 marks) 3 (b) Explain main issue in building a DSM system on a network of heterogeneous machines.(10 marks) 4 (a) Explain deadlock avoidance algorithm in a distributed system.(10 marks) 4 (b) How are failure handled in message passing system in distributed system?(10 marks) 5 (a) Explain centralized algorithm for mutual exclusion. What are the advantages and disadvantages of it over distributed algorithm?(10 marks) 5 (b) Explain Marshalling/Unmarshalling mechanism in RPC/RMI.(10 marks) 6 (a) Explain the concept of load Balancing along with sender initiated algorithm.(10 marks) 6 (b) Explain distributed Resource Management with respective to distributed computing environment.(10 marks)

Write short notes on :-

7 (a) Fault Tolerance(10 marks) 7 (b) Issue in designing of load sharing algorithm.(10 marks)