KEMBAR78
Distributed Operating System: B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.) | PDF | Information Age | Applied Mathematics
Scribd
Upload
100 views2 pages

Distributed Operating System: B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.)

This document is an exam for a distributed operating systems course. It contains 12 questions covering topics like distributed computation cuts and termination detection, vector clocks, mutual exclusion algorithms, distributed deadlock detection, distributed file systems, distributed shared memory, load distribution, and commit protocols. Students must choose questions to answer, with each question worth between 6-8 marks.

Uploaded by

A J
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100 views2 pages

Distributed Operating System: B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.)

This document is an exam for a distributed operating systems course. It contains 12 questions covering topics like distributed computation cuts and termination detection, vector clocks, mutual exclusion algorithms, distributed deadlock detection, distributed file systems, distributed shared memory, load distribution, and commit protocols. Students must choose questions to answer, with each question worth between 6-8 marks.

Uploaded by

A J
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

B.E. (Computer Science & Engineering) Eighth Semester (C.B.S.

)
Distributed Operating System

P. Pages : 2 NIR/KW/18/3690
Time : Three Hours *1347* Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions carry marks as indicated.
2. Solve Question 1 OR Questions No. 2.

rg
3. Solve Question 3 OR Questions No. 4.
4. Solve Question 5 OR Questions No. 6.
5. Solve Question 7 OR Questions No. 8.
6. Solve Question 9 OR Questions No. 10.

s.O
7. Solve Question 11 OR Questions No. 12.
8. Assume suitable data whenever necessary.
9. Illustrate your answers whenever necessary with the help of neat sketches.

1. a) Define distributed operating system & discuss the designing issues of distributed 7

nt
operating system.

b) What do you mean by cuts of distributed computation? Explain termination detection 7


algorithm.
de
OR

2. a) Describe how vector clock can overcome the limitation of Lamport clock. Consider the 8
tu

following set of events & assign the missing vector logical timestamps to the event.
a=1 b m c d
P1
S

e f g
P2
ur

h=1 n i j k
P3

b) Explain Chandy Lamport's Global state Recording Algorithm. 6


gp

3. a) Explain Raymond's tree based algorithm. 6

b) Justify how Ricart-Agrawala's algorithm achieves mutual exclusion. 7


Na

OR

4. a) Give comparative performance analysis of all Token-based and non token based algorithm. 7

b) Explain Suzuki-Kasami Broadcast algorithm. 6

5. a) Explain Ho-Ramamoorthy centralized deadlock detection algorithm. 7

b) Explain different issues in deadlock detection & resolution. 7

NIR/KW/18/3690 1 P.T.O
OR

6. a) Explain the classification of agreement problems. 7

b) Explain Edge chasing algorithm for distributed deadlock detection with the help of 7
example.

7. a) Explain the mechanism for building distributed file system. 6

rg
b) Describe the Migration algorithm for implementing distributed shared memory. 7

OR

8. a) Explain with the help of diagram distributed file system architecture. 6

s.O
b) Describe coherence protocols in detail. 7

9. a) Discuss the performance comparision of different load distributing algorithms. 6

nt
b) Explain the concept of load distributing along with sender initiated algorithm. 7

OR
de
10. a) Explain different issues in load distributing. 7

b) Describe the components load distribution algorithms. 6

11. a) What is commit protocol? Explain two phase commit protocol. 7


tu

b) Explain dynamic voting protocols. 6

OR
S

12. a) Describe checkpoint Algorithm in detail. 6


ur

b) Explain the algorithm for site Recovery. 7


gp

**********
Na

NIR/KW/18/3690 2

You might also like