You are on page 1of 2

Birla Institute of Technology & Science, Pilani Work-Integrated Learning Programmes Division First Semester 2009-2010 Comprehensive Examination

(EC-2 Regular) Course No. Course Title Nature of Exam Weightage Duration Date of Exam Note:
1. 2. 3. 4.

: CS ZG623 : ADVANCED OPERATING SYSTEMS : Open Book : 60% : 3 Hours : 25/10/2009 (AN)

No. of Pages =2 No. of Questions = 5

Please follow all the Instructions to Candidates given on the cover page of the answer book. All parts of a question should be answered consecutively. Each answer should start from a fresh page. Mobile phones and computers of any kind should not be used inside the examination hall. Use of any unfair means will result in severe disciplinary action.

Q.1. Consider the system of processes shown in the following figure: a1 P1 a4 a5 a8 a6 P4 a9 a10 Fig. Q1 (a) (b) (c)







Write down the logical and vector time values for all events from a1 to a11 assume d=1 for all system of processes. Which events are concurrent events? Mark at least three consistent cuts on the above figure. [6 + 2 + 4 = 12] Explain the working of Schiper-Eggli-Sandoz (SES) protocol for causal ordering of messages for the messages exchanged in the processes shown in the following figure. [Note that message M1 is sent from P2 to P1, M2 is sent from P2 to P1 and M3 is sent from P3 to P1.] [8] P1 P2 P3 Fig. Q2 M1 M2 M3

CS ZG623 (EC-2 Regular) First Semester 2009-2010

Page 1 of 2

CS ZG623 (EC-2 Regular)

First Semester 2009-2010

Page 2


Explain the working of Singhals Heuristic algorithm for Distributed Mutual Exclusion by taking a suitable example. [Note: Do not write the algorithm rather demonstrate algorithm steps on the example of your choice] [12] What are the limitations of logical clocks? If different processes in a distributed system uses different values for d (for logical clocks & vector clocks), will logical clocks and vector clocks satisfy total order relation. Token-based mutual exclusion algorithms are in general more message efficient than non-token based algorithms. Explain How? [4 + 4 + 4 = 12] Suppose any Site A wants to send a message m to Site B having public key as KB+. Site A generates a session key KA,B and then sends message as [KA,B(m), KB+( KA,B)]. What is the main advantage of using this technique? A multiprocessor has a single bus. Is it possible to implement strictly consistent memory? Consider the following system of transactions(T1,T2 & T3) with their Read Sets(RS) and Write Sets(WS): T1 : RS(T1) = {d1,d3,d5} WS(T1) = {d3,d6} T2 : RS(T2) = {d2,d4,d5} WS(T2) = {d2,d4,d6} T3 : RS(T3) = {d1,d2,d4} WS(T3) = {d2,d4} Identify various Transaction Conflicts such as rear-write(r-w), write-write (ww) and write-read (w-r) among these three transactions. Consider the following system having three transactions(T1,T2 & T3): T1 = r1[x] r1[z] w1[x] r2[y] r2[z] w2[y] T2 = T3 = w3[x] r3[y] w3 [z] [Note: r stands for read operation and w stands for write operation] Give an example of a serializable log over these transactions. [4 X 4 = 16]

Q.4 (a). Q.4 (b).

Q.4 (c).

Q.5 (a).

Q.5 (b).

Q.5 (c).

Q.5 (d).


CS ZG623 (EC-2 Regular) First Semester 2009-2010

Page 2 of 2