Distributed System - Dec 2016

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.

Solve any four questionQ.1(a,b,c,d,e)

1(a) Compare Stateful and Stateless server implementations.(5 marks) 1(b) Explain what is a callback RPC.(5 marks) 1(c) Compare NOS and DOS.(5 marks) 1(d) List types of failures in message passing system and how to overcome them.(5 marks) 1(e) Compare Bully Election Algorithm with Ring based election algorithm.(5 marks) 2(a) Explain the need of distributed deadlock algorithms. Explain probe based distributed deadlock algorithm indetail.(10 marks) 2(b) What is a thread and advantages of using threads. What are different models for organizing threads.(10 marks) 3(a) Define Happened-Before relationship. Explain implementation of logical clocks with an example.(10 marks) 3(b) Describe .NET architecture with peat labeled diagram.(10 marks) 4(a) What are the reasons for migration of code? Explain the various models for code migration.(10 marks) 4(b) Explain Distributed Approach for providing mutual exclusion.(10 marks) 5(a) Explain SOA lifecycle with diagram. Also State the advantages of SOA.(10 marks) 5(b) How is sequential consistency model implemented if Replicated Migrating Blocks are used in distributed system for Distributed Shared Memory.(10 marks) 6(a) CORBA Components(5 marks) 6(b) Components of EJB framework.(5 marks) 6(c) Explain Message Buffering in IPC(5 marks) 6(d) .NET architecture.(5 marks)