14

15

16

17

18

19

b)

b)

a)
b)

R7986 Pages: 2

Compare work station server model with processor pool model.

PART C
Answer any two full questions, each carries 9 marks.
Describe IP multicast in detail
Give notes on failure model for multicast datagrams.
Explain the implementation of RPC mechanism with a neat diagram.
Summarize any five Distributed File System requirements.
Explain NFS Architecture with diagram
Differentiate Andrew file system and NFS
PART D
Answer any two full questions, each carries 12 marks.
Explain the lost update and inconsistent retrievals problems in concurrent
transactions with the help of examples.
Why serial equivalence requires that once a transaction has released a lock on an
object, it is not allowed to obtain any more locks. A server manages the objects
al, a2, ..., an. The server provides two operations for its
clients:read (i)returns the value of ai;
write(i, Value)assigns Value to ai.
The transactions T and U are defined as follows:
T: x = read(j); ‏مر‎ = read (i); write(j, 44); write(i, 33);
U: x = read(k); write(i, 55); y = read (j); write(k, 66).
Describe an interleaving of the transactions T and U in which locks are released
earlywith the effect that the interleaving is not serially equivalent.
Describe a deadlock detection scheme for a single server with an example.
Write an algorithm to implement mutual exclusion between N processes that is
based upon multicast and logical clocks. Illustrate the algorithm using the
situation involving three processes p1,p2, p3.
With an example and suitable figure describe the operation of bully algorithm.
Justify whether it meets the requirements of election, during run of the

algorithm. Also evaluate the performance of the above algorithm.

یا ید عاد با

Page 2of 2

(5)

(6)
(3)
(4)
(5)
(5)
(4)

(6)

(6)

(6)
(6)

(12)