SPPU Computer Engineering (Semester 8)
Distributed Operating System
June 2015
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


Answer any one question from Q1 and Q2
1 (a) In what respect are distributed computing systems better than parallel processing systems? Give examples of three applications for which istributed computing systems will be more suitable than parallel processing systems.
7 M
1 (b) Explain the RPC mechanism in detail with the help of a diagram.
7 M
1 (c) Explain different issues in Inter Process Communication.
4 M

2 (a) Discuss the relative advantages and disadvantages of the various commonly used models for configuring distributed computing systems? Which model do you think is going to become the most popular model in future? Give reasons for your answer.
7 M
2 (b) Explain different desirable features of good message passing system.
7 M
2 (c) What is group Communication?
4 M

Answer any one question from Q3 and Q4
3 (a) Explain in detail middleware models and services provided by middleware.
8 M
3 (b) Differentiate between internal synchronization and external synchronization of clocks in a distributed systems. Externally synchronized clocks are also internally synchronized, but the converse if not true. Explain why.
8 M

4 (a) Explain different architectural models of distributed system.
8 M
4 (b) How do clock synchronization issues differ in centralized computing systems and distributed computing systems?
8 M

Answer any one question from Q5 and Q6
5 (a) Compare centralized algorithms and distributed algorithms for Mutual exclusion.
8 M
5 (b) Discuss why advance knowledge of the resource usage of processes is essential to avoid deadlocks. Why the deadlock avoidance strategy is never used in distributed systems for handling deadlocks?
8 M

6 (a) Explain Token-Passing Approach for Mutual Exclusion.
8 M
6 (b) Prove that the following resource allocation policies prevent deadlocks:
i) Ordered requests
ii) Collective requests
8 M

Answer any one question from Q7 and Q8
7 (a) Explain mechanisms for building distributed file system.
10 M
7 (b) Explain components of load distributing algorithms.
8 M

8 (a) Explain issues to be considered in design of DSM system.
10 M
8 (b) Explain differences between load balancing and load sharing approaches?
8 M

Answer any one question from Q9 and Q10
9 (a) What is an access matrix? Explain how the following issues can be handling in a security system that uses access matrix for access control
i) Deciding the contents of access matrix entries
ii) Validating access to objects by subjects.
8 M
9 (b) Explain the approaches for backward error recovery.
8 M

10 (a) Explain the difference between synchronous checkpointing and asynchronous checkpointing.
8 M
10 (b) Explain the majority based dynamic voting protocol in detail.
8 M

Answer any one question from Q11 and Q12
11 (a) Explain the basic Service Oriented Architecture with suitable diagram.
8 M
11 (b) Enlist concepts of Cluster and Grid Computing, and explain how Grid Computing is different from Cluster Computing.
8 M

12 (a) Explain the major steps involved in SOA design and development.
8 M
12 (b) Enlist different types of Grids and explain how Grid computing works.
8 M



More question papers from Distributed Operating System
SPONSORED ADVERTISEMENTS