10

11

12

13

14

15

16

17

18

a)

b)

a)
b)

a)
b)

a)
b)
a)
b)
a)
b)

a)
b)

a)

b)

G192078 Pages: 3

distributed environment.
Illustrate the working of central server algorithm with a diagram.

Explain the case of deadlock in Maekawa’s voting algorithm.
PART 13
Answer any two full questions, each carries 9 marks.
Illustrate the processor-pool model with a neat diagram. How is it different from
workstation-server model?
Describe the heterogeneity and scalability issues in distributed computing.
Explain distributed computing as a ‘Utility’.
Identify the different threats to communication channels and explain different
mechanisms to overcome that.
Explain the different categories of failures in a distributed environment.
Outline three specific and contrasting examples of the increasing levels of
heterogeneity experienced in contemporary distributed systems.
PART C
Answer any two full questions, each carries 9 marks.
With a neat diagram, explain the tasks in group membership management.
Describe the multicast support provided in IPv4.
With a neat diagram, illustrate the implementation of RPC.
Summarize the distributed file system requirements.
Sketch the architecture of Sun NFS and explain the role of different components.
Distinguish between whole file serving and whole file caching in Andrew file
system.
PART D
Answer any two full questions, each carries 12 marks.
Outline the lock implementation in distributed environment.
Explain dirty read and premature write problems associated with transactions
with suitable examples.
What are nested transactions? Summarize the rules for committing of nested
transactions.

Explain the steps in Maekawa’s voting algorithm.

Page 2of 3

(4)
(4)

(5)

(4)
(4)
(5)

(6)
(3)

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

(6)
(6)

(5)

(7)