Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
22 views

AdvancedOperatingSystem Regular HO

Uploaded by

raghunathan
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
22 views

AdvancedOperatingSystem Regular HO

Uploaded by

raghunathan
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI

WORK INTEGRATED LEARNING PROGRAMMES


COURSE HANDOUT

Part A: Content Design

Course Title Advanced Operating Systems


Course No(s) SE* ZG623 / CS ZG623
Credit Units 5
Course Author
Version No
Date

Course Description
Overview; Distributed Operating Systems: Architectures, Theoretical Foundations, Distributed Mutual
Exclusion, Distributed Deadlock Detection, Agreement Protocols; Resource Management: Distributed File
Systems, Distributed Shared Memory, Distributed Scheduling; Failure Recovery: Recovery; Resource
Security and Protection: Access and Flow Control, Cryptography; Multiprocessor Operating Systems;
Database Operating Systems: Introduction – Concurrency Control.

Course Objectives
No Objective

CO1 To introduce the design and implementation issues of Distributed Operating Systems.

Scope

Distributed Operating System’s work in an environment where we have independent machines (both
hardware and software) connected with each other over a network. A Distributed OS makes a Distributed
System a virtual uniprocessor system.

The distributed OS to be studied in this course is microkernel based. It's just that the user level processes
that are separated from the kernel can run on remote machines. Also, the OS has some sort of idea what
machines are hooked up, and can make decisions about where to run things based on the relative speed of
the machines.

Few case studies like Sun NFS, V-System, Condor, Sprite, IVY, Fidge Mattern Vector Clocks, Mutual
Exclusion (Lamports’) etc. shall be discussed and also implemented as part of the coding assignments
Text Book(s)
T1 Singhal, Mukesh & N.G. Shivaratri, Advanced Concepts in Operating Systems, Tata McGraw-
Hill, 1994.

Reference Book(s) & other resources


R1 P. K. Sinha, “Distributed Operating Systems” Pearson Education, 1998.
R2 Distributed Operating Systems – The Logical Design by A. Goscinski, AW
R3 Modern Operating Systems by A. S. Tanenbaum, Pearson Education
R4 Distributed Systems-Concepts and Design by G. Coulouris, AW
R5 Distributed System Design by Jie Wu, CRC Press.

Content Structure:

No Title of the Module References


M1 Overview of Advanced O.S: Design approaches, Motivation, Types T1, Chapter 1
of Advanced OS.
M2 Architecture: Motivation, Issues, Communication Networks, T1, Chapter 4
Communication Primitives.
M3 Theoretical Foundations: Limitations, Lamport’s logical clock, T1, Chapter 5
vector clock, causal ordering, global state, Cuts.
M4 Distributed Mutual Exclusion: Lamport, Recart-agrawala, and T1, Chapter 6
Maekawa’s algorithms; Suzuki-kasami broadcast algorithm, and
Raymond’s tree based algorithm.
M5 Distributed Deadlock Detection: Resource Vs. Communication T1, Chapter 7
deadlock, Strategies to handle deadlock, Ho-Ramamoorthy, Path-
Pushing, Edge-Chasing, Diffusion Computation-based algorithms.
M6 Agreement Protocols: System model, Classification of agreement T1, Chapter 8
problems, Solutions to Byzantine agreement problems.
M7 Distributed File Systems: Mechanisms for building DFSs, Design T1, Chapter 9
Issues, Sun DFS, and Sprite DFS.
M8 Distributed Scheduling: Issues in Load Distribution, Components of T1, Chapter 11
a load distribution algorithm, Load Distribution Algorithms, V-
system, Sprite, and Condor.
M9 Distributed Shared Memory: Algorithms for implementing DSMs, T1, Chapter 10
Memory Coherence, and Coherence Protocols, IVY.
M10 Recovery: Classification of failures, Synchronous and T1, Chapter 12
Asynchronous Checkpointing and Recovery.
M11 Fault Tolerance: Commit Protocols, Voting Protocols, Failure T1, Chapter 13
Resilient Processes.
M12 Protection and Security: Access Matrix Model, Implementation of T1, Chapter 14
access matrix, Introduction to Data Security.
Learning Outcomes:
No Learning Outcomes

LO1 Understanding of middleware platforms like RPC for implementing communication models over
distributed systems.

LO2 Understanding the need of Logical clocks and their usages in building advanced operating systems
and its’ components.

LO3 Understanding of Mutual exclusion primitives, Agreement protocols, and deadlock handling
scenarios in distributed systems.

Part B: Contact Session Plan

Academic Term
Course Title Advanced Operating Systems
Course No
Lead Instructor

Course Contents

Session No. List of Topic Title Text/Ref


(from content structure in Course Handout) Book/external
resource
1. Overview of Advanced O.S: Design approaches, Motivation, Types Chapter 1
of Advanced OS.
2. Architecture: Motivation, Issues, Communication Networks, Chapter 4
Communication Primitives.
3-4 Theoretical Foundations: Limitations, Lamport’s logical clock, Chapter 5
vector clock, causal ordering, global state, Cuts.
5. Distributed Mutual Exclusion: Lamport, Recart-agrawala, and Chapter 6
Maekawa’s algorithms; Suzuki-kasami broadcast algorithm, and
Raymond’s tree based algorithm.
6. Distributed Deadlock Detection: Resource Vs. Communication Chapter 7
deadlock, Strategies to handle deadlock, Ho-Ramamoorthy, Path-
Pushing, Edge-Chasing, Diffusion Computation-based algorithms.
7. Agreement Protocols: System model, Classification of agreement Chapter 8
problems, Solutions to Byzantine agreement problems.
8. Distributed File Systems: Mechanisms for building DFSs, Design Chapter 9
Issues, Sun DFS, and Sprite DFS.
Syllabus for Mid-Semester Test (Closed Book): Topics in S. No. 1 to 8
9-10. Distributed Scheduling: Issues in Load Distribution, Components of Chapter 11
a load distribution algorithm, Load Distribution Algorithms, V-system,
Sprite, and Condor.
11-13. Distributed Shared Memory: Algorithms for implementing DSMs, Chapter 10
Memory Coherence, and Coherence Protocols, IVY.
14. Recovery: Classification of failures, Synchronous and Asynchronous Chapter 12
Checkpointing and Recovery.
15. Fault Tolerance: Commit Protocols, Voting Protocols, Failure Chapter 13
Resilient Processes.
16. Protection and Security: Access Matrix Model, Implementation of Chapter 14
access matrix, Introduction to Data Security.
Syllabus for Comprehensive Exam (Open Book): All topics given in Plan of Self Study

Evaluation Scheme
Evaluation Name Type Weight Duration Day, Date, Session,
Component (Quiz, Lab, Project, (Open book, Time
Midterm exam, End Closed book,
semester exam, etc) Online, etc.)

EC - 1 Quizzes / Assignment 20% To be announced


EC - 2 Mid-term Exam Closed book 30% 2 hours To be announced
EC - 3 End Semester Exam Open book 50% 3 hours To be announced
Note - Evaluation components can be tailored depending on the proposed model.

Important Information
Syllabus for Mid-Semester Test (Closed Book): Topics in Weeks 1-7
Syllabus for Comprehensive Exam (Open Book): All topics given in plan of study

Evaluation Guidelines:
1. EC-1 consists of either two Assignments or three Quizzes. Announcements regarding the same
will be made in a timely manner.
2. For Closed Book tests: No books or reference material of any kind will be permitted.
Laptops/Mobiles of any kind are not allowed. Exchange of any material is not allowed.
3. For Open Book exams: Use of prescribed and reference text books, in original (not photocopies)
is permitted. Class notes/slides as reference material in filed or bound form is permitted.
However, loose sheets of paper will not be allowed. Use of calculators is permitted in all exams.
Laptops/Mobiles of any kind are not allowed. Exchange of any material is not allowed.
4. If a student is unable to appear for the Regular Test/Exam due to genuine exigencies, the student
should follow the procedure to apply for the Make-Up Test/Exam. The genuineness of the reason
for absence in the Regular Exam shall be assessed prior to giving permission to appear for the
Make-up Exam. Make-Up Test/Exam will be conducted only at selected exam centres on the
dates to be announced later.
It shall be the responsibility of the individual student to be regular in maintaining the self-study schedule
as given in the course handout, attend the lectures, and take all the prescribed evaluation components such
as Assignment/Quiz, Mid-Semester Test and Comprehensive Exam according to the evaluation scheme
provided in the handout.

You might also like