Sathyabama University 2008 B.E Computer Science and Engineering Distributed Computing - Question Paper

SATHYABAMA UNIVERSITY

(Established under section 3 of UGC Act, 1956)

 

Course & Branch: B.E - CSE (Part Time)

Title of the paper: Distributed Computing

Semester: IV Max. Marks: 80

Sub.Code: 611PT402 Time: 3 Hours

 

PART A (10 x 2 = 20)

Answer All the Questions

 

1. Differentiate between Parallel processing and Distributed Computing System, Give three applications for which distributed computing systems will be more suitable than parallel processing systems?

2. Define Distributed Operating Systems.

 

3. What are the elements needed to implement PRC, Draw the sketch showing the relationship between them?

4. What is LRPC, How to achieve better performance than conventional RPC?

 

5. What is false sharing, When is it likely to occur?

 

6. What are the commonly used methods to solve the thrashing problem in a DSM system?

 

7. State about Phantom deadlocks?

 

8. List out the advantages and disadvantages of using threads instead of multiple processes.

9. Name the main components of DFS.

 

10. Give a framework for Unix File sharing semantics.

 

PART B (5 x 12 = 60)

Answer All the Questions

 

11. Briefly explain about the Distributed computing system models.

(or)

12. (a) What are the issues are important for a distributed operating system designer in achieving a Virtual Uniprocessor (A distributed OS makes a collection of networked machines to act like a virtual uniprocessor)?

 

(b) Explain how to improve the reliability and performance of a distributed OS.

 

13. (a) Differentiate between Stateful and Stateless servers, Why do some applications use stateless servers in spite of stateful servers?

 

(b) Discuss about R,RR and RRA protocols for RPCs, Give an example application for each one?

(or)

14. (a) What are the main advantages of RPC system that allows the binding between a client and a server to change dynamically?

 

(b) Describe how client and server binding done at compile time, at link time and at call time?

 

15. (a) Discuss the various data-locating mechanism that may be used in DSM system that uses the NRMB strategy?

 

(b) What is casual consistency? Give an example of an application for that?

(or)

16. (a) Explain why simply LRU policy is often not used?

 

(b) List down the disadvantages of DSM system?

 

17. What are the different approaches for handling mutual exclusion, explain it?

(or)

18. Discuss the issues involved in Load balancing Algorithms?

 

19. Why File caching needed, Describe about the available schemes?

(or)

20. Why are transactions needed in a file service? Give suitable examples to illustrate how Transactions help in doing the following:

(a) Improving the recoverability of files in the event of failures. (b) Allowing the concurrent sharing of mutable files by multiple clients in a consistent manner.