Scribd
Upload
385 views

Advanced Operating System Lesson Plan

This lesson plan outlines a 14-week course on Advanced Operating Systems. It covers 5 units: Introduction, Distributed Operating Systems, Distributed Resource Management, Failure Recovery and Fault Tolerance, and Multiprocessor and Database Operating Systems. Each unit is broken down into weekly sessions covering topics such as synchronization, deadlocks, distributed file systems, and concurrency control algorithms. The plan lists objectives, topics, time allotted and textbook references to guide teaching the course.

Uploaded by

Sukanta Kundu
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
385 views

Advanced Operating System Lesson Plan

This lesson plan outlines a 14-week course on Advanced Operating Systems. It covers 5 units: Introduction, Distributed Operating Systems, Distributed Resource Management, Failure Recovery and Fault Tolerance, and Multiprocessor and Database Operating Systems. Each unit is broken down into weekly sessions covering topics such as synchronization, deadlocks, distributed file systems, and concurrency control algorithms. The plan lists objectives, topics, time allotted and textbook references to guide teaching the course.

Uploaded by

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

LESSON PLAN

LP- CS CS 704A

Sub Code : CS 704A

Date: 16-07-15

Sub Name : Advanced Operating System


Branch :

CSE

Unit: I

UNIT I

Semester: vii

INTRODUCTION

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

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

2
3
4

Time

Expecte
d
Comple
tion
Week

55m

1st

55m

1st

55m

1st

55m

1st

Time

5
6
7
8
9

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

55m

2nd

55m

2nd

55m
55m
55m

2nd
2nd
2nd

LESSON PLAN

LP- CS CS 704A
Date: 16-07-15

Sub Code & Name :


CS704A ADVANCED OPERATING SYSTEMS
Unit : II
UNIT II

Branch : CS

Semester :VII

DISTRIBUTED OPERATING SYSTEMS

Introduction Issues Communication Primitives Inherent Limitations Lamports Logical Clock; Vector Clock; Causal Ordering; Global State; Cuts;
Termination Detection. Distributed Mutual Exclusion Non-Token Based Algorithms
Lamports Algorithm - Token-Based Algorithms Suzuki-Kasamis 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

Topics to be covered

Time

Expecte
d

Actual
Time

Comple
tion
Week

1
2
3
4
5
6
7,8
9
10

Introduction Issues Communication


Primitives Inherent
Limitations
Lamports Logical Clock; Vector Clock;
Causal Ordering; Global State;
Cuts;
Termination Detection. Mutual Exclusion
Token-Based Algorithms Suzuki-Kasamis
Broadcast Algorithm
Distributed Deadlock Detection Issues
Centralized DeadlockDetection Algorithms
Centralized Deadlock-Detection Algorithms
Agreement Protocols Classification Solutions Applications
Review
CAT - I

55m

3rd
3rd

55m
55m
55m

3rd
3rd

55m

4th

55m

4th
4th

55m
55m
55m

4th
4th

LP- CS CS 704A
Date: 16-07-15

LESSON PLAN
Sub Code & Name :
CS704A ADVANCED OPERATING SYSTEMS
Unit : III

UNIT III

Branch : CS

Semester :VII

DISTRIBUTED RESOURCE MANAGEMENT

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

Time

Expecte
d
Comple
tion
Week
5th

Topics to be covered

Distributed File systems

55m

Architecture

55m

3
4
5
6
7
8
9

Mechanisms
Design Issues
Distributed Scheduling
Issues
Components
Algorithms
Tutorial

55m
55m
55m

50
50
50
50

LESSON PLAN

Actual
Time

5th
5th
6th
6th
6th
6th
6th
6th

LP- CS CS 704A
Date: 16-07-15

Sub Code & Name :


CS9222 ADVANCED OPERATING SYSTEMS
Unit : IV

UNIT IV

Branch : CS

Semester :VII

FAILURE RECOVERY AND FAULT TOLERANCE

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

Basic Concepts

2
3
4
5

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

6
7
8
9

Time

Expecte
d
Comple
tion
Week

55m

7th

55m
55m

7th

Topics to be covered

55m

Actual
Time

8th
8th
8th

55m

9th

55m

9th

55m

10th

55m

10th

UNIT V MULTIPROCESSOR AND DATABASE OPERATING SYSTEMS


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

Time

Expecte
d
Comple
tion
Week

55m

10th

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

55m
55m
55m
55m
55m
55m
55m

10th
10th
11st
11th
11th
11th
12th

50 m

13th
14th

Actual
Time

Course Delivery Plan

Week

Units

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

4
5

TEXT BOOKS:

3
4

13

14

I
II

I
II

5 5 5 5

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

SUKANTA KUNDU / CSE

DEBASISH DAS
(H.O.D ,CSE)

Date

15/07/2014

15/07/2014

You might also like