Download QUESTION BANK AOS

QUESTION BANK
SUBJECT: Advance Operating System
1. Explain various distributed computing system models.
2. What is message passing ? Explain synchronization.
3. Explain how message passing system is designed in failure handling.
4. Explain the following major issues in designing distributing operating system
a) Transparency b) reliability c) Scalability
5. What is DCE? What are the DCE components? Explain them.
6. Describe blocking and non blocking types of IPC. What is simpler to implement and
Why ? Discuss their relative advantages and disadvantages.
7. What is datagram? Why are multidatagram messages used in IPC? What are the main
Issues in IPC of multidatagram messages? Describe a mechanism for handling each
Of issues.
8. Explain what is meant by absolute ordering, consistent ordering and casual ordering
Of messages. Suggest a mechanism to implement each one.
9. What are the main issues in designing a transparent RPC mechanism? Is it possible to
Achieve complete transparency of a RPC mechanism? Justify your answer.
10. What is a stub? How are stubs generated? Explain how the use of stubs helps in
making a RPC mechanism transparent.
11. What is callback RPC facility? Give an example of an application where this may be
useful. What are the main issues involved in supporting this facility in a RPC
system? State the mechanism to handle each of these issues.
12. Describe the general architecture of DSM systems. Discuss the design and
implementation issues of DSM.
13. What are the main causes of thrashing in a DSM system? What are the commonly
used methods to solve the thrashing problem in a DSM system?
14. What is a deadlock? What are the 4 necessary conditions for a deadlock to occur?
Describe the ways for recovery from deadlock.
15. What are the main issues involved in the selection of victims for recovery from a
detected deadlock? Explain the functioning of Bully algorithm?
16. Discuss various desirable features of a good global scheduling algorithm. Discuss the
issues in designing load balancing algorithms.
17. What are the steps involved in process migration? Discuss the desirable features of a
good process migration mechanism.
18. Explain how a threads package can be implemented either in the user space or in the
kernel.
19. Write shortnotes on :
a) Advantages of process migration
b) File sharing semantics.
c)Happened before relation
20. Define distributed operating system. Explain the advantages and disadvantages
DOS over centralized system
21. Explain different issues involved in designing a distributed operating system
23. Explain implementation issues of RPC mechanism
24. With reference to the design of client – server model, explains the following.
a) Addressing
b) Blocking Vs Non blocking primitives
c) Buffered Vs Non buffered primitives
d) Reliable Vs unreliable primitives
25. Explain why and how physical clocks are synchronized in distributed systems
Describe the Berkeley algorithms for physical clock synchronization.
26. Explain marshalling & unmarshalling process in RPC for all data types including
Arrays and pointers
27. Define and explain Lamports algorithm for logical clock synchronization.
28. Explain process allocation model. What are the various design issues to be considered
by processor allocation algorithms.
29. Explain centralized and distributed algorithm for ensuring mutual exclusion.
30. What are the different components of file service. Explain each in detail.
31. Explain memory management in amoeba.
32. Bring out clearly the differences among the three algorithms for mutual
.
exclusion in distributed systems.
33. What are the design issues in building a flat file service and a directory service in
Distributed file system
34. Explain the construction of UFIDs
35. Write a short note on
a) SUN RPC
b) Thread package c) Caching
d) Atomic transaction
36. Explain RPC in UNIX system.
37. Explain the commonly used models for DOS kernel designing.
38. Explain the factors that should be taken into account for making the decision in DCE
cells.
39. Explain the desirable features of a good message passing system.
40. Explain the typical message structure with a neat diagram.
41. Explain synchronous mode of communication with both send and receive primitives
having blocking type semantics.
42. Explain buffering with different types of buffering strategies.
43. Explain failure handling.
44. Explain the typical RPC call message format.
45. Explain marshalling arguments and results.
46. Explain the communication protocol for RPCs with a neat diagram.
47. Explain the exception handling in RPC
48. Explain centralized and distributed algorithm.
49. Explain the implementation of logical clocks by using counters physical clocks.
50. Explain mutual exclusion using distributed approach and centralized approach.
51. Explain deadlock avoidance by demonstration of safe and unsafe state .
52. Explain different election algorithms.
53. Write a note on:
a)stub generation b) Token passing approach c) Happened before relation
d) marshalling arguments and results e) Drifting of clocks f) SUN RPC
54. Explain general architecture of DSM systems.
55. Explain design and implementation issues of DSM.
56. Explain granularity and structured of shared memory space
57. Explain the different consistency models, release consistency models, processor
consistency models, weak consistency models, and replacement strategy.
58. Explain the desirable features of a good global scheduling algorithm.
59. Explain task assignment approach, load balancing approach, load sharing approach.