DISTRIBUTED COMPUTING (DC) DECEMBER 2012 COMPUTER SCIENCE SEMESTER 8

DISTRIBUTED COMPUTING (DC) DECEMBER 2012 COMPUTER SCIENCE SEMESTER 8

Con. 10254-12.                      (REVISED COURSE)                                           KR-5238
                                                    (3 Hours)                                             [Total Marks : 100]


N.B. : (1) Question No. 1 is compulsory.
          (2) Answer any four from the remaining six.

1. (a)	Explain the reasons why use and popularity of distributed systems are rapidly	10
	increasing despite the increased complexity and difficulty of building it.
(b)	Explain how transparency is achieved in remote Procedure Calls.	10
2. (a)	With neat diagrams, explain the failure handling mechanisms for message passing.	10
(b)	Compare stateful and sateless servers.	10
3. (a)	What are the commonly used semantics for ordered delivery of multicast	10
	messages ?
(b)	Define thrashing. What are the methods used for solving thrashing problems ?	10
4. (a)	Explain the distributed algorithm for clock synchronization.	10
(b)	What are the common strategies used for handling deadlocks in distributed	10
	system.
5. (a)	Explain the different Load estimation policies and process transfer policies used by	10
	load balancing algorithms.
(b)	With neat diagrams explain the commonly used ways in which threads of process	10
	are organized.
6. (a)	What are the main approaches to verify the validity of cached data in DFS ?	10
(b)	Compare the characteristics features of system oriented names and Human	10
	Oriented names.
7.	Write short notes on (any two) :-	20
	(a) Distributed Computing Environment (DCE)
	(b) Heterogeneous DSM
	(c) Election algorithms.
	(d) Fault tolerance of DFS.