UNIT I 1 2 3 Explain what is meant by absolute ordering, consistent ordering, and casual ordering of messages?

Give a mechanism to implement each one. Differentiate between monolithic kernel and microkernel approaches for designing DOS. What is piggybacking of a message? How does it help in reducing network traffic? Give some examples of where the piggybacking scheme may be used to improve the performance in distributed system. What is stub? How are stubs generated? Explain how the stubs will help in making RPC mechanism transparent. Also explain the steps in creating an RPC application in brief. Why scalability is an important feature in the design of distributed operating system? Why distributed computing systems are gaining more popularity? What are different elements involved in implementation of RPC mechanism? Explain role of each in RPC mechanism. Compare between Multiprocessor operating system, Multicomputer operating system, and network operating system and distributed operating system. Why distributed operating system more difficult to design than the operating system for centralized time sharing system? Explain the following w.r.t. DOS. i. Message passing in RPC ii. Stub and skeleton in RMI iii. Buffering iv. Group communication Explain different transparencies in distributed system with suitable examples. Explain in brief the different challenges in designing distributed systems. Explain steps to build a CORBA application. Explain CORBA ORB Architecture with the help of neat diagram. Explain different CORBA services. Define distributed system. List and explain examples of DS. What is group communication? Explain different types of group communication. 08 04 06 MAY 2012 MAY 2012 MAY 2012

10

MAY 2012

5 6 7 8 9 10

04 04 06 10 06 10

MAY 2012 MAY 2012 DEC 2012 DEC 2012, APR 2009 DEC 2012 DEC 2012

11 12 13 14 15 16 17

6 4 6 8 8 8 8

Apr 2009 APR 2011 APR 2011 APR 2011 APR 2012 OCT 2011 OCT 2011

UNIT II 1 2 3 4 5 What is global state in distributed system and explain how it can be represented? Discuss the various commonly used models for building distributed computing systems. Explain with suitable example how causality can be captured with vector timestamps. Explain and compare Bully and ring algorithms. Explain the following w.r.t. synchronization in DOS. 06 10 06 10 10 MAY 2012 MAY 2012 MAY 2012 MAY 2012 DEC 2012

6 7 8 9 10

i. Clock skew ii. Drift rate iii. Causual ordering iv. Partial ordering Explain the vector clock in detail with implementation rules. Explain variations on the client server model in distributed system. Explain how the causality can be captured by means of vector timestamps. Explain importance of clock synchronization in distributed systems. Explain with neat diagram architectural models of distributed systems.

06 06 06 04 08

DEC 2012 APR 2009 APR 2009 APR 2009 OCT 2011

UNIT III

1 2 3 4

Explain Suzuki Kasami broadcast algorithm. Compare it with Ricart Agarwala 08 Algorithm. 10 06 10

MAY 2012 MAY 2012 MAY 2012 MAY 2012