CS ZG623 (EC-2 REGULAR) Page 1 of 2

Birla Institute of Technology & Science, Pilani

Distance Learning Programmes Division
First Semester 2008-2009

Comprehensive Examination (EC-2 Regular)

Course No. : CS ZG623
Course Title : ADVANCED OPERATING SYSTEMS
Nature of Exam : Open Book
Weightage : 60%
Duration : 3 Hours
Date of Exam : 28/09/2008 (AN)
Note:
1. Please follow all the Instructions to Candidates given on the cover page of the answer book.
2. All parts of a question should be answered consecutively. Each answer should start from a fresh page.
3. Leave about one inch margin space on all four sides of the answersheet.
4. Mobile phones and computers of any kind should not be used inside the examination hall.

Q.1 (a). How does caching help a name services availability in distributed file system?
Q.1 (b). Two processes P and Q are connected in a ring using two channels, and they
constantly rotate a message m. At any one time, there is only one copy of m in
the system. Each processs state consists of the number of times it has received
m, and P sends m first. At a certain point, P has the message and its state is
101. Immediately after sending m, P initiates the snapshot algorithm. Explain
the operation of the algorithm in this case, giving the possible global state(s)
reported by it.
Q.1 (c). Describe precisely what is a scalable system. What are different techniques for
achieving scalability? [4 + 4 + 4 = 12]

Q.2 Consider the following figure (Fig Q2) below:

Fig Q2
Show the application of BIRMAN-SCHIPER-STEPHENSON protocol for causal
ordering of messages on the Fig Q.2 [8]

Q.3 A distributed system may have multiple, independent critical regions. Imagine that
a process 0 wants to enter critical region A and process B wants to enter critical
region B. Can Ricart-Agarwalas algorithm lead to deadlock? Justify your answer
by giving supportive arguments. [6]

Q.4 Can Obermarcks algorithm for distributed deadlock detect a phantom deadlock?
Justify your answer by giving suitable examples. [6]
P
1
P
2
P
3
e
31
e
21
e
11
e
22
e
12
e
32
No. of Pages = 2
No. of Questions = 6

CS ZG623 (EC-2 REGULAR) Page 2 of 2
CS ZG623 (EC-2 REGULAR) FIRST SEMESTER 2008-2009 PAGE 2


Q.5 Describe Chandy-Misra-Haass distributed deadlock detection algorithm for OR
request model and apply the same for the following system of process(s) [Assume
P
1
initiates deadlock detection] [10]






Fig Q5

Q.6 (a). Explain in which respects Distributed Shared Memory system is suitable for
client-server systems. [4]

Q.6 (b). Why is thrashing an important issue in Distributed Shared Memory Systems
and what methods are available for dealing with it? [4]

Q.6 (c). Java supports exceptions which are raised when an error occurs. How would
you implement exceptions in RPCs? [4]

Q.6 (d). Which scheduling policy is most desirable in multiprocessor operating system
for following situations:

(i) If the subtasks of task have large critical regions.
(ii) If nothing about the subtasks of a task is known. [6]


********
P
5 P
6
P
7
P
8
Site3
Site2
P
1
P
2
P
3
P
4
Site1