13

14

15

16

17

18

19

a)
b)

a)
b)
a)

b)
a)

b)

a)

b)

a)

b)

a)
b)

G1079 Pages:

Describe the classes of failure exhibited by each service. Classify their failures
according to their effects on the properties of validity and integrity. Can service
B, be described as a reliable communication service?

Explain how multimedia services are supported in distributed systems.

Summarize the challenges in designing a distributed system.

PART ட

Answer any two full questions, each carries 9 marks.
Explain request reply protocol with an example.
Describe the major design issues for RPC
What are the different failures mentioned in the failure model for UDP
datagrams?
Briefly explain different types of navigations used for name resolution.
With appropriate diagram explain the distribution of processes in the Andrew
File System
Describe the caching mechanism used in NFS

PART D

Answer any two full questions, each carries 12 marks.
Implement the two methods of locking, namely lock class and lock manager
class
How the optimistic concurrency control to the serialization of transactions
avoids drawbacks of locking
Why do we make any pair of transactions serially equivalent? Explain serial
equivalence with the help of an example.
Compare the central server algorithm and ring based algorithm. Which is better
and why?
Explain Ricart and Agrawala’s multicast based mutual exclusion algorithm.
In a ring topology 7 processes are connected with different ID’s as shown:
۲ ic ads ‏عه‎ 9
If process 010 initiates election after how many message passes will the
coordinator be elected and known to all the processes. What modification will

take place to the election message as it passes through all the processes?

Page 2of 2

(4)
(5)

(5)
(4)
(4)

(5)
(5)

(4)

(6)

(6)

(6)

(6)

(6)
(6)