Distributed System - May 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. 1(a) Explain implementation of sequencial consistency with non replicating migraing blocks strategy.(5 marks) 1(b) Which .Net components makes .NET platform and language independent? Explain how it works.(5 marks) 1(c) Explain Parameters passing Semantics in RPC(5 marks) 1(d) Compare Bully election algorithm with Ring based election algorithm.(5 marks) 2(a) Name four different distributed deadlock detection algorithms. Explain probe-based distributed deadlock detection algorithm (CMH) with example.(10 marks) 2(b) Explain RPC communication Protocol.(10 marks) 3(a) Define Happened-Before relationship. Explain implementation of logical clocks with an example(10 marks) 3(b) Describe .Net architecture with neat labeled diagram(10 marks) 4(a) Explain migration in heterogeneous system.(10 marks) 4(b) Explain desirable features of a good message passing system.(10 marks) 5(a) Explain with respect to EJB- Roles in EJB and types of Beans.(10 marks) 5(b) Explain various distributed computing models.(10 marks)

Write notes on following

6(a) RMI Execution(5 marks) 6(b) Components of EJB framework(5 marks) 6(c) Message Buffering in IPC(5 marks) 6(d) SOA lifecycle.(5 marks)