Distributed System - May 2014

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) What is the need of removing unreferenced entity?(5 marks) 1(b) "Vector Time Stamp mechanism for synchronization is used for capturing casuality of events". Justify.(5 marks) 1(c) What are goals of distributed system?(5 marks) 1(d) What are statefull and stateless servers.(5 marks) 2(a) Explain distributed algorithm for mutual exclusive.What is the advantages and the disadvantages of its over centralized algorithm.(10 marks) 2(b) Explain Absolute Ordering and Casual Ordering Process with the help of examples for many to many communication.(10 marks) 3(a) Discuss issue concerned with parameter passing in RPC.(10 marks) 3(b) What are good features of a distributed file system?Explain file sharing semantics of it.(10 marks) 4(a) Explain recursive name resolution with advantages and disadvantages.(10 marks) 4(b) Define Thrashing.What are the method use for solving thrashing problems?(10 marks) 5(a) Explain the design issue with respect to Distributed computing Enviroment.(10 marks) 5(b) What is the notation of a context in nano-space? Explain the different clustering and context binding strategies of names(10 marks) 6(a) Explain the different load estimation policies and process transfer policies used by load balancing algorithms.(10 marks) 6(b) Explain various forms of message oriented communication with suitable examples.(10 marks)

Write short notes on following any two:-

7(a) Object Adapter(10 marks) 7(b) Light-weight RPC(10 marks) 7(c) Consistency Models(10 marks) 7(d) Fault Tolerance(10 marks)