Download CS9222 Advanced Operating Systems Mr.N.M. BalaMurugan

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Library (computing) wikipedia , lookup

DNIX wikipedia , lookup

Spring (operating system) wikipedia , lookup

Security-focused operating system wikipedia , lookup

Burroughs MCP wikipedia , lookup

CP/M wikipedia , lookup

Plan 9 from Bell Labs wikipedia , lookup

Unix security wikipedia , lookup

Distributed operating system wikipedia , lookup

Transcript
DOC/LP/01/28.02.02
LESSON PLAN
LP- CS9222
LP: Rev. No: 00
Sub Code & Name :
Date: 20-01-2010
CS9222 ADVANCED OPERATING SYSTEMS
Unit : I
UNIT I
Branch : CS
Page 1
of 6
Semester : M.E II
INTRODUCTION
9
Overview - Functions of an Operating System – Design Approaches – Types of
Advanced Operating System - Synchronization Mechanisms – Concept of a Process,
Concurrent Processes – The Critical Section Problem, Other Synchronization Problems –
Language Mechanisms for Synchronization – Axiomatic Verification of Parallel
Programs - Process Deadlocks - Preliminaries – Models of Deadlocks, Resources, System
State – Necessary and Sufficient conditions for a Deadlock – Systems with Single-Unit
Requests, Consumable Resources, Reusable Resources.
Objective:
To teach the basic concepts, phases and types of various operation systems along
with several representations, specification and Phase management.
Session
No
1
2
3
4
5
6
7
8
9
Topics to be covered
Overview - Functions of an Operating System
– Design Approaches
Types of Advanced Operating System Synchronization Mechanisms – Concept of a
Process,
Concurrent Processes – The Critical Section
Problem, Other Synchronization Problems
Language Mechanisms for Synchronization –
Axiomatic Verification of Parallel Programs
Process Deadlocks - Preliminaries – Models of
Deadlocks, Resources, System State
Necessary and Sufficient conditions for a
Deadlock
Systems with Single-Unit Requests
Consumable Resources, Reusable Resources
Review
Time in
min
50
Ref
T1
Teaching
Method
BB
50
T1
BB
50
T1
PPT
50
T1
BB
50
T1
BB
50
T1
BB
50
50
50
T1
T1
R1R2
BB
BB
BB
DOC/LP/01/28.02.02
LESSON PLAN
LP- CS9222
Rev. No: 00
Sub Code & Name :
Date: 20-01-2010
CS9222 ADVANCED OPERATING SYSTEMS
Unit : II
UNIT II
Branch : CS
Page 2
of 6
Semester :M.E II
DISTRIBUTED OPERATING SYSTEMS
9
Introduction – Issues – Communication Primitives – Inherent Limitations Lamport’s Logical Clock; Vector Clock; Causal Ordering; Global State; Cuts;
Termination Detection. Distributed Mutual Exclusion – Non-Token Based Algorithms –
Lamport’s Algorithm
- Token-Based Algorithms – Suzuki-Kasami’s Broadcast
Algorithm – Distributed Deadlock Detection – Issues – Centralized Deadlock-Detection
Algorithms - Distributed Deadlock-Detection Algorithms. Agreement Protocols –
Classification - Solutions –Applications.
Objective:
To learn the role of distributed operating systems and the essential services
needed for the distributed systems through various algorithms.
Session
No
1
2
3
4
5
6
7,8
9
10
Topics to be covered
Introduction – Issues – Communication
Primitives – Inherent Limitations
Lamport’s Logical Clock; Vector Clock;
Causal Ordering; Global State; Cuts;
Termination Detection. Mutual Exclusion
Token-Based Algorithms – Suzuki-Kasami’s
Broadcast Algorithm
Distributed Deadlock Detection – Issues –
Centralized Deadlock-Detection Algorithms
Centralized Deadlock-Detection Algorithms
Agreement Protocols – Classification Solutions –Applications
Review
CAT - I
Time in
min
50
Ref
T1
Teaching
Method
BB
50
T1
BB
50
100
T1
T1
BB
BB
50
T1
BB
50
50
T1
T1
BB
BB
50
T1
BB
DOC/LP/01/28.02.02
LESSON PLAN
LP-CS9222
LP: Rev. No: 00
Sub Code & Name :
Date: 20-01-2010
CS9222 ADVANCED OPERATING SYSTEMS
Unit : III
UNIT III
Branch : CS
Page 3
of 6
Semester : M.E II
DISTRIBUTED RESOURCE MANAGEMENT
9
Distributed File systems – Architecture – Mechanisms – Design Issues –
Distributed Shared Memory – Architecture – Algorithm – Protocols - Design Issues.
Distributed Scheduling – Issues – Components – Algorithms.
Objective:
To understand the distributed file systems concepts though various distributed file
management and scheduling algorithms.
Session
No
1
Topics to be covered
Distributed File systems
Time in
min
50
Ref
T1
Teaching
Method
BB
2
Architecture
50
T1
BB
3
4
5
6
7
8
9
Mechanisms
Design Issues
Distributed Scheduling
Issues
Components
Algorithms
Tutorial
50
50
50
50
50
50
50
T1
T1
T1
T1
T1
T1
R1
OHP
OHP
BB
BB
OHP
BB
BB
DOC/LP/01/28.02.02
LESSON PLAN
LP-CS9222
LP: Rev. No: 00
Sub Code & Name :
Date: 20-01-2010
CS9222 ADVANCED OPERATING SYSTEMS
Unit : IV
UNIT IV
Branch : CS
Page 4 of 6
Semester : M.E II
FAILURE RECOVERY AND FAULT TOLERANCE
9
Basic Concepts-Classification of Failures – Basic Approaches to Recovery;
Recovery in Concurrent System; Synchronous and Asynchronous Check pointing and
Recovery; Check pointing in Distributed Database Systems; Fault Tolerance; Issues Two-phase and Non-blocking Commit Protocols; Voting Protocols; Dynamic Voting
Protocols
Objective:
To understand the Failure, failure recovery and Fault tolerance by learning
various check point and voting protocols.
Session
No
1
2
3
4
5
6
7
8
9
Topics to be covered
Basic Concepts
Classification of Failures
Basic Approaches to Recovery
Recovery in Concurrent System
Synchronous and Asynchronous Check
pointing and Recovery
Check pointing in Distributed Database
Systems;
Fault Tolerance; Issues
Two-phase and Non-blocking Commit
Protocols;
Dynamic Voting Protocols
Time in
min
100
Ref
50
50
50
T1
T1
T1
T1
BB
OHP
50
T1
BB
50
T1
T1
BB
100
R1,R2
OHP
T1
Teaching
Method
BB
BB
DOC/LP/01/28.02.02
LESSON PLAN
LP-CS1
LP: Rev. No: 00
Sub Code & Name :
Date:20-01-2006
CS9222 ADVANCED OPERATING SYSTEMS
Unit : V
Branch : CS
Page 5
of 6
Semester : M.E II
UNIT V MULTIPROCESSOR AND DATABASE OPERATING SYSTEMS
9
Structures – Design Issues – Threads – Process Synchronization – Processor
Scheduling – Memory Management – Reliability / Fault Tolerance; Database Operating
Systems – Introduction – Concurrency Control – Distributed Database Systems –
Concurrency Control Algorithms.
Objective:
To study the concepts of Synchronization and concurrency controlling algorithms
for distributed and database operating systems.
Session
No
1
Topics to be covered
Structures – Design Issues – Threads
2
3
4
5
5
7
8
9
10
Process Synchronization – Processor
Scheduling – Memory Management
Reliability
Fault Tolerance
Database Operating Systems
Concurrency Control
Distributed Database Systems
Concurrency Control Algorithms.
CAT - II
Time in
min
50
Ref
T1
Teaching
Method
BB
50
50
50
50
50
50
50
50
T1
T1
T1
T1
T1
T1
T1
T1
OHP
BB
BB
BB
BB
BB
BB
BB
Course Delivery Plan
Week
Units
1
2
3
4
5
6
7
8
9
10
11
12
I II
I II
I II
I II
I II
I II
I II
I II
I II
I II
I II
I II
1 1
1
1
2
2
3
3
3
4
4
4
5
1
2
2
2 3
3
3
3
3
4
4
4
13
14
I
II
I
II
5 5 5 5 5
TEXT BOOKS:
1. Mukesh Singhal and N. G. Shivaratri, “Advanced Concepts in Operating Systems”,
McGraw-Hill, 2000
REFERENCES:
1. Abraham Silberschatz, Peter B. Galvin, G. Gagne, “Operating System Concepts”,
Sixth Edition, Addison Wesley Publishing Co., 2003.
2. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison
Wesley, 2001.
Prepared by
Approved by
Signature
Name &
Designation
N.M.Balamurugan
Senior Lecturer / CSE
Dr.Susan Elias
Professor & Head / CSE
Date
20/01/2010
20/01/2010