ASSIGNMENT NO-1

Class:-BE CMPN 1 & 2 Date of submission: 14/02/2012 Sem:- VIII Subject: DC

Based on Ch 01: Fundamentals Ch 02: Message Passing For solving the following set of questions refer the below given Reference Book along with the notes: Pradeep K Sinha Distributed Operating Systems A. Tanuenbaum Distributed Operating System Q1Describe all the design issues of the DOS

Q2. Distinguish NOS and DOS.

Q3. Explain Workstation and processor pool model.

Q4. State desirable features of message passing system.

Q5. State what is transient and persistent communication? First 4 questions are based on the syllabus which is asked in the Mumbai University Papers and the last question is beyond syllabus.

Prof. Amit Nerurkar

ASSIGNMENT NO-2
Class:-BE CMPN 1 & 2 Date of submission: 27/02/2012 Sem: - VIII Subject: DC
Based on Ch 02: Message Passing and Ch 03: RPC For solving the following set of questions refer the below given Reference Book along with the notes: Pradeep K Sinha Distributed Operating Systems A. Tanuenbaum Distributed Operating System Q1. Explain how to take care of duplicate packets with example.

Q2. Explain many to much group communication with example

Q3. Draw and Explain the RPC Model

Q4. Explain RPC failure semantics with their solution.

Q5. Explain CORBA in detail. All questions are based on the syllabus which is asked in the Mumbai University Papers.

Prof. Amit Nerurkar

ASSIGNMENT NO-3
Class:-BE CMPN 1 & 2 Date of submission: 19/03/2012 Sem: - VIII Subject: DC
Based on Ch 04: DSM and Chp 05: Synchronization For solving the following set of questions refer the below given Reference Book along with the notes: Pradeep K Sinha Distributed Operating Systems Tanuenbaum Distributed Operating System M. Singhal, N. Shivaratri Advanced Concepts in Operating Systems

Q1. Explain DSM general architecture in detail.

Q2. What are the different consistency models? Explain each in short.

Q3. Explain Berkely algorithm

Q4. Explain bully election algorithm.

Q5. Explain a non centralized mutual exclusion algorithm.

Q6. Explain CHM in detail.

All 6 questions are based on the syllabus which is asked in the Mumbai University Papers .

Prof. Amit Nerurkar

ASSIGNMENT NO-4
Class:-BE CMPN 1 & 2 Date of submission: 03/04/2012 Sem: - VIII Subject: DC
Based on Ch 06:Process and resource management For solving the following set of questions refer the below given Reference Book along with the notes: Pradeep K Sinha Distributed Operating Systems G. Coulouris, J. Dollimore and T. Kindberg Distributed Systems: Concepts and design

Q1. State desirable features of good global scheduling algorithm.

Q2. Explain different models of threads.

Q3. Compare threads and process.

Q4 Explain Message forwarding mechanisms in process migration

Q5. Explain load estimation policies.

First 5 questions are based on the syllabus which is asked in the Mumbai University Papers.

Prof. Amit Nerurkar

ASSIGNMENT NO-5
Class:-BE CMPN 1 & 2 Date of submission: 10/04/2012 Sem: - VIII Subject: DC
Based on Ch 07:DFS and Chp 08: Naming For solving the following set of questions refer the below given Reference Book along with the notes: Pradeep K Sinha Distributed Operating Systems G. Coulouris, J. Dollimore and T. Kindberg Distributed Systems: Concepts and design

Q1. Explain qurom based protocol.

Q2. Explain name resolution systems with its different types.

Q3. Explain clustering and how to perform clustering?

Q4 Explain file sharing semantics in DFS.

Prof. Amit Nerurkar

First 4 questions are based on the syllabus which is asked in the Mumbai University Papers.

Prof. Amit Nerurkar