GTU Computer Engineering (Semester 8)
Distributed Systems
May 2016
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


1 (a) List out the methods of Object Locating Mechanism. Explain any Three object locating mechanism.
7 M
1 (b) Discuss load estimation policy and Process transfer policy in load balancing algorithms.
7 M

2 (a) What is process addressing? Explain commonly used methods for process addressing.
7 M
Solve any one question from Q2(b) & Q2(c)
2 (b) Define Global state. Explain Distributed snapshot algorithm.
7 M
2 (c) Enumerate various issues in clock synchronization. Classify the clock synchronization algorithm and explain Berkley algorithm with an example.
7 M

Solve any two question from Q3(a), Q3(b) & Q3(c), Q3(d)
3 (a) Explain RPC Architecture. What is the role of IDL file in RPC?
7 M
3 (b) Explain the functionality of each layer in OSI layer architecture with various protocols used in each layer.
7 M
3 (c) What is the significance of client-server binding? How are various issues handled in changing client-server binding?
7 M
3 (d) How does VMTP protocol handle lost messages, flow control, group Communication and maintain transparency.
7 M

Solve any two question from Q4(a), Q4(b) & Q4(c), Q4(d)
4 (a) Differentiate monolithic kernel model and micro kernel model.
7 M
4 (b) Define Thrashing in DSM. Explain methods for solving thrashing in DSM.
7 M
4 (c) How the problem is specified using formal model? Specify the problem of mutual exclusion using formal model specification.
7 M
4 (d) List and explain various consistency models used in DSM.
7 M

Solve any two question from Q5(a), Q5(b) & Q5(c), Q5(d)
5 (a) What are threads? What are the different ways of synchronizing threads? Also explain various thread models.
7 M
5 (b) Explain features and issues in message passing system.
7 M
5 (c) What is process migration? Explain address transport mechanism with freezing techniques.
7 M
5 (d) What is non-idempotent routine? How such routine creates problem with message passing? Also explain its solution with example.
7 M



More question papers from Distributed Systems
SPONSORED ADVERTISEMENTS