SPPU Information Technology (Semester 8)
Distributed System
May 2014
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


Answer any one question from Q1 and Q2
1 (a) Compare migration transparency and relocation transparency.
4 M
1 (b) Explain challenge of heterogeneity in Distributed System and how it is overcome?
8 M
1 (c) Write a short note on various failure models.
6 M

2 (a) Explain Peer-to-Peer Architecture and its advantages.
4 M
2 (b) Give different types of hardware resources and data or software resources that can be shared. Give examples of their sharing as it occurs in Distributed System.
8 M
2 (c) Define Distributed System. List advantages and disadvantages of the same.
6 M

Answer any one question from Q3 and Q4
3 (a) Explain General Architecture of Message Queuing System along with roles of message broker.
8 M
3 (b) What are sockets? Specify socket primitives? Draw a diagram specifying connection oriented socket communication.
8 M

4 (a) Explain different 'RPC invocation semantics'.
8 M
4 (b) What is CORBA? Describe the general organization of CORBA system with the help of neat diagram.
8 M

Answer any one question from Q5 and Q6
5 (a) How might the clocks in two computers that are linked by a local network be synchronized without reference to an external time source? What factors limit the accuracy of the procedure you have described? How could the clocks in large number of computers connected by Internet be synchronized?
8 M
5 (b) Describe Cristian algorithm for clock synchronization.
8 M

6 (a) Show the instances where we cannot conclude C(a) < C(b) or C(b) < C(a). Draw appropriate timing diagram.
8 M
6 (b) Compare Centralized, Distributed and Token ring algorithms of mutual exclusion with their performance measures.
8 M

Answer any one question from Q7 and Q8
7 (a) What is automounting? Explain a simple automounter for NFS and how it help to improve the performance and scalability of NFS?
8 M
7 (b) How is security implemented in CODA file system.
8 M

8 (a) Explain in brief basic NFS architecture for UNIX system.
8 M
8 (b) Write a short note on caching and replication in CODA file system.
8 M

Answer any one question from Q9 and Q10
9 (a) What is consistency model? Explain Monotonic writes and Writes follow reads client centric consistency model?
8 M
9 (b) What is replication? Explain main reasons for replication?
8 M

10 (a) Why replicas must be consistent? Explain following Data Centric Consistency Models.
i) Sequential
ii) Weak
8 M
10 (b) Explain design and implementation issues of Distributed Shared Memory in details.
8 M

Answer any one question from Q11 and Q12
11 (a) Explain
i) Flat and Hierarchical groups
ii) Open and closed groups
8 M
11 (b) Explain basic reliable multicasting. How it could be made scalable?
10 M

12 (a) What is check pointing? Explain independent check pointing and co-ordinated check pointing.
8 M
12 (b) Explain Byzantine Generals Problem. Why do we need to have 3m +1 total processes for system to work correctly, assuming non-faulty commander?
10 M



More question papers from Distributed System
SPONSORED ADVERTISEMENTS