Name :

htt
Roll No. : ....
Invigilators Signature : ..
CS/M.Tech (CSE)/SEM-1/CSEM-103/2011-12
p:/
2011
ADVANCED OPERATING SYSTEM
Time Allotted : 3 Hours Full Marks : 70
/q
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words
pap
as far as practicable.

Group A

Answer questions No. 1 and any three questions from the rest of
er.

Group A.

1. a) Consider nodes A, B, C that all use Lamports logical

clock concept. The notation A4 C2 will mean that A sent
wb

a message to C and that when the message was sent As

logical clock read 4 and when the message was received
Cs logical clock read 2. Which of the following are legal
sets of events ? Explain your answers.
ut .

(i) A5 C7, C8 A10

(ii) C12 A5, A6 C11 3
b) In Ricart-Agrawalas mutual exclusion algorithm a
process will get all N-1 REPLY messages only if it is
a c.

eligible to enter in the critical section, so the extra

RELEASE message is not required in this
alogorihmJustify this statement by discussing the
Ricart-Agrawalas mutual exclusion algorithm in details.
in

40515 [ Turn over

CS/M.Tech (CSE)/SEM-1/CSEM-103/2011-12

c) If the reader processes are in the sequence R1, R2, R3,

htt
R4 in the reader waiting queue and writer processes

are in the sequences W1, W2 in the writer waiting

queue then discuss the shared file execution sequences

p:/
of these processes by discussing the monitor for

readers priority problem. If R5 arrived in the system

when R4 is accessing the shared file, then show which

/q
one will gain the control of the monitor and how ? 6
pap
2. a) Figure below shows events of three processes P1, P2 and

P3. Let eij denote the jth event of process Pi. Arrows

indicate transmission of message.

er.
wb

Assume the processes use Lamports logical clocks Ci

denotes the local clock at process Pi. The initial value of

Ci = 0 for every process Pi. Assume that the increment

ut .

value is d = 1 for all processes.

(i) To each event shown in the figure, assign the

a c.

correct clock value 3

(ii) In Lamports logical clock is the increment value d

in

different at each process ? Explain your answer. 3

40515 2
 CS/M.Tech (CSE)/SEM-1/CSEM-103/2011-12

b) Explain the limitations of the Lamporrts logical clock

htt
with the help of a diagram. What is busy waiting

semaphore ? How it can be solved ? 3+5

3. a) What are the different approaches for maintaining

p:/
Cache Consistency of the data cached at clients ? If the

Cache Consistency scheme does not address the

/q
sequential-write sharing issue then what sort of

problems can arise ? 3+3

pap

b) A distributed operating system makes collection of

networked machines to act like a virtual uniprocessor-

What are the main advantages of this virtual machine

architecture for a user ? What design issues are

er.

required in distributed operating system to achieve this

goal ? 3+5
wb

4. a) How basic primitives can be used to solve the problem

of race condition ? 3

b) There is one distributed mutual exclusion algorithm,

ut .

which gives the impression that the message complexity

of a distributed mutual exclusion can be O (N) instead

a c.

of O(N). Why this algorithm needs 2N messages per CS

execution ? Derive how each request sets size becomes

is equal to N . 6
in

40515 3 [ Turn over

CS/M.Tech (CSE)/SEM-1/CSEM-103/2011-12

c) In a simple solution to distributed mutual exclusion, a

htt
control site is assigned the task of granting permissions

for the CS execution. To request the CS, a site sends a

REQUEST message to the control site. The control site

p:/
queues up the requests for the CS and grants them

permission, one by one. The method to achieve mutual

exclusion in distributed systems requires only 3

/q
messages per CS execution.
pap
Discuss what prompted Lamport to develop mutual

exclusion also, even though it requires more messages

[3(N-1)] per CS invocation. 5

5. a) Write the edge chasing distributed deadlock detection

er.

algorithm for the AND model. Show the probe message

propagation along each edge for the following example

wb

and then determine whether any deadlock exists there

or not. 3+3
ut .
a c.
in

40515 4
 CS/M.Tech (CSE)/SEM-1/CSEM-103/2011-12

b) Show the iterations (up to 3rd) for deadlock detection

htt
for Obermarcks algorithm for the following figure : 5
p:/
/q pap
er.

c) How do the file system and the virtual memory modules

wb

negotiate for the physical memory usage in the Sprite

file system ? 3

6. a) In distributed deadlock detection, in some algorithms

ut .

for accessing a remote resource a process site sends the

request message to a designated control site. But in

some algorithms the process site sends the request

a c.

message to the respective site where the resource is

located between these two approaches which one is

better ? Explain your answer. 2

in

40515 5 [ Turn over

CS/M.Tech (CSE)/SEM-1/CSEM-103/2011-12

b) Explain the migration algorithm and the read-

htt
replication algorithm for implementing DSM systems. 5

c) Define what it means to say that a global state is

p:/
inconsistent. Give an example of such a state of a

system consisting of two processes. Explain the

/q
Chandy-Lamports Global state recording algorithm.

1+3+3
pap

Group B

Answer any one question.

er.

7. a) Mention the conditions for setting the suitable range of

frame size f. Consider a system that contains four

wb

independent periodic tasks : in (pi, ei, Di) format :

T1=(15, 1, 14), T2 = (20, 2, 26), T3=(22,3,22) then what

ut .

are the allowable frame sizes ?

b) Is the above technique useful all-time useful for cyclic

a c.

scheduling ? If not, what is the solution ? Explain it

with an example ? 4+6+4

in

40515 6
 CS/M.Tech (CSE)/SEM-1/CSEM-103/2011-12

8. a) Write down the algorithm for Cyclic executive. 4

htt
b) Prove that when preemption is allowed and jobs do not

contend for resources, the EDF algorithm can produce a

feasible schedule of a set J of jobs with arbitrary release

p:/
times and deadlines on a processor if and only if J has

feasible schedules. 4
/q
c) Differentiate between dynamic and static systems. 2
pap
d) Does the LST algorithm remain optimal for scheduling

jobs when more than one processor is used ? Explain

with example. 4
er.
wb
ut .
a c.
in

40515 7 [ Turn over