Reg. No.

Question Paper Code: J7659

M.E. DEGREE EXAMINATION, JUNE 2010 Second Semester

Computer Science and Engineering

CS9222 ADVANCED OPERATING SYSTEMS

(Common to M.E. Mobile and Pervasive Computing) (Regulation 2009) Time : Three hours Answer ALL Questions

1.

What are the advantages and disadvantages of layered approach for operating system design? What are the differences between deadlock and starvation? What are the similarities and differences between network operating system and distributed operating system? Differentiate: resource and communication deadlock.

2. 3.

4. 5. 6. 7. 8. 9.

What is file replication and how it differs from file caching? Differentiate: load balancing and load sharing.

12

10.

Define the term(s) failure and fault. What are the differences between lovelock and deadlock? Differentiate: tightly and loosely coupled systems. State the requirements for the database operating systems.

12 0
PART A (10 2 = 20 Marks)

12 0
Maximum : 100 Marks

PART B (5 16 = 80 Marks) 11. (a) (i) (ii) Describe the classification of advanced operating systems.

Illustrate the Bankers algorithm for deadlock avoidance with suitable example. (10) Or

(b)

(i)

What is a semaphore? Explain how semaphores are used to solve the readers writers problem. (5) Describe the models for deadlock each with example. (6)

(ii)

12.

(a)

(i) (ii)

Describe the design issues in RPC.

12 0
Or Or 2

(iii) Construct a general resource allocation graph for the following scenario and determine if the graph is completely reducible: R1, R2 and R3 are reusable resources with a total of two, two and three units. Process P1 is allocated one unit each of R2 and R3 and it is requesting one unit of R1. Process P2 is allocated one unit of R1 and is requesting two units of R3. Process P3 is allocated one unit each of R1 and R2 and is requesting one unit of R3. (5)

Illustrate the Lamport's algorithm for distributed mutual exclusion. (8)

(b)

(i)

Describe the major issues in the design of distributed operating system. (8) Illustrate Chandy-Misra-Hass algorithm for deadlock detection in distributed system. (8) Why availability is considered one of the important issues in the design of distributed file system. (8) Describe the components of a load distributed algorithm. (8)

(ii)

13.

(a)

(i)

(ii)

12

(b)

(i)

What are the advantages and disadvantages of distributed shared memory? (6) Describe the issues in determining the efficiency of task migration. (10)

(ii)

12 0
(6) (8)

J7659

14.

(a)

(i) (ii)

Discuss the classification of failures in detail. Describe the majority based dynamic voting protocol. Or

(8) (8)

(b)

(i)

What is meant by backward error recovery and discuss the problems in this approach? (8) Describe the approaches proposed to implement resilient processes. (8) Discuss the implementation of threads at the user-level and kernellevel and also state merits and demerits of each of them. (8)

(ii)

15.

(a)

(i)

(ii)

Describe the issues in the design of fault tolerance multiprocessor operating systems and the fault tolerance features of SEQUOIA system. (8) Or

(ii)

Discuss the lock based concurrency control algorithms.

12 0
3

(b)

(i)

What are the atomic hardware instructions for process synchronization? Describe how they can be used to implement P and V operations. (8) (8)

12

12 0
J7659