sathyabama-IIsem-Distributed Computing-683201-783201
sathyabama-IIsem-Distributed Computing-683201-783201
PART - A (6 x 5 = 30)
Answer ALL the Questions
1. What is an Idempotent Operation? Which of the following
operations are Idempotent, and justify them.
(a) read_record (filename, record_number)
(b) increment (variable_name)
(c) add (integer_1, integer_2)
(d) read_next_record (filename)
(e) seek (filename, position)
2. What is a stub? How are stubs generated? Explain how the use of
stubs help in making an RPC mechanism transparent.
3. Discuss the similarities and differences between the following
parameter passing semantics that may be used in an object based
systems.
(a) call by object reference (b) call by move (c) call by visit
4. What are the main causes of Trashing in a DSM System? What
are the commonly used methods to solve the Thrashing problem
in a DSM system?
5. Explain how the Bully algorithm works to select a coordinator
process from among the currently running process.
PART – B (5 x 10 = 50)
Answer ALL the Questions
7. What are the major issues in designing a Distributed Operating
Systems? Explain any two of them in detail.
(or)
8. (a) Explain Consistent and Casual Ordering with neat diagrams.
(b) Explain various types of Buffering used in Distributed
Computing.
9. Explain the steps in creating an RPC application in Sun RPC with
possible code.
(or)
10. Explain the various communication protocols used for RPC.