Download CS2254 os

DOC/LP/01/28.01.09
LESSON PLAN
LP- CS2254
Sub Code : CS 2254
LP Rev. No: 02
Sub Name : OPERATING SYSTEMS
Branch :
Date: 31-12-13
CS
Page: 01 of 06
Unit: I
Semester: IV
Unit syllabus:
PROCESSES AND THREADS
9
Introduction to operating systems – review of computer organization – operating system structures –
system calls – system programs – system structure – virtual machines. Processes: Process concept –
Process scheduling – Operations on processes – Cooperating processes – Interprocess
communication – Communication in client-server systems. Case study: IPC in Linux. Threads:
Multi-threading models – Threading issues. Case Study: Pthreads library
Objective:
To understand the basic computer organization, operating system structures, processes and threads.
Session
No
Topics to be covered
Time
Text/Ref
Teaching
Method
1
Introduction to operating systems
50m
1
BB
2
Review of computer organization
50m
1
BB
3
Operating system structures, System calls
50m
1
BB
4
System programs, System structure, Virtual machines
50m
1
BB
5
Processes - Process concept and Process scheduling
50m
1
BB
6
Operations on processes, Cooperating processes
50m
1
BB
7
Inter- process Communication (IPC)
50m
1
BB
8
Communication in client-server systems.
Case study - IPC in Linux.
50m
1/NET
BB
9
Threads - Multi-threading models, Threading issues.
50m
1
BB
10
Case Study - Pthreads library
50m
1/NET
BB
DOC/LP/01/28.01.09
LESSON PLAN
LP- CS2254
LP Rev. No: 02
Sub Code : CS 2254
Sub Name : OPERATING SYSTEMS
Date: 31-12-13
Branch :
Page: 02 of 06
CS
Unit: II
Semester: IV
Unit syllabus:
PROCESS SCHEDULING AND SYNCHRONIZATION
10
CPU Scheduling: Scheduling criteria – Scheduling algorithms – Multiple-processor scheduling –
Real time scheduling – Algorithm Evaluation. Case study: Process scheduling in Linux. Process
Synchronization: The critical-section problem – Synchronization hardware – Semaphores – Classic
problems of synchronization – critical regions – Monitors. Deadlock: System model – Deadlock
characterization – Methods for handling deadlocks – Deadlock prevention – Deadlock avoidance –
Deadlock detection – Recovery from deadlock.
Objective:
To understand various scheduling algorithms, synchronization issues and deadlocks.
Session
No
Topics to be covered
Time
Text/
Ref
Teachin
g
Method
11
CPU Scheduling, Scheduling criteria
50m
1
BB
12
Scheduling algorithms – FCFS, SJF, Priority & RR
50m
1
BB
13
Multiple-processor scheduling and Real time scheduling
50m
1
BB
Algorithm Evaluation, Case study - Process scheduling in
Linux.
50m
1
BB
Synchronization, The critical-section problem
50m
1
BB
16
Synchronization hardware, Semaphores
50m
1
BB
17
Classic problems of synchronization, Critical regions
50m
1
BB
18
Monitors.
50m
1
BB
19
Deadlock - System model and Deadlock characterization
50m
1
BB
20
Methods for handling deadlocks and Deadlock prevention
50m
1
BB
50m
1
BB
50m
1
BB
14
15
21
22
Deadlock avoidance
Deadlock detection and Recovery from deadlock.
DOC/LP/01/28.01.09
LESSON PLAN
LP- CS2254
Sub Code : CS 2254
LP Rev. No: 02
Sub Name : OPERATING SYSTEMS
Date: 31-12-13
Branch :
Page: 03 of 06
CS
Unit: III
Semester: IV
Unit syllabus:
STORAGE MANAGEMENT
9
Memory Management: Background – Swapping – Contiguous memory allocation – Paging –
Segmentation – Segmentation with paging. Virtual Memory: Background – Demand paging –
Process creation – Page replacement – Allocation of frames – Thrashing. Case Study: Memory
management in Linux
Objective:
1. To understand the memory management techniques like paging, segmentation.
2. To understand virtual memory concepts, page replacement and thrashing.
Session
No
Teaching
Method
Topics to be covered
Time
Text/
Ref
23
Memory Management - Background
50m
1
BB
24
Swapping and Contiguous memory allocation
50m
1
BB
25
Paging – Basic Method
50m
1
BB
26
Paging – Structure of page tables & shared pages
50m
1
BB
27
Segmentation, Segmentation with paging
50m
1
BB
28
Virtual Memory – Background, Demand paging
50m
1
BB
29
Virtual Memory - Demand paging and
Process creation
50m
1
BB
30
Page replacement
50m
1
BB
31
Allocation of frames, Thrashing
50m
1
BB
50m
1&
Web
BB
32
Case Study: Memory management in Linux
DOC/LP/01/28.01.09
LESSON PLAN
LP- CS2254
Sub Code : CS 2254
LP Rev. No: 02
Sub Name : OPERATING SYSTEMS
Date: 31-12-13
Branch :
Page: 04 of 06
CS
Unit: IV
Semester: IV
Unit syllabus:
FILE SYSTEMS
9
File-System Interface: File concept – Access methods – Directory structure – File-system mounting
– Protection. File-System Implementation : Directory implementation – Allocation methods – Freespace management – efficiency and performance – recovery – log-structured file systems. Case
studies: File system in Linux – file system in Windows XP
Objective:
To understand the concepts of file system, allocation methods and free space management.
Session
No
Topics to be covered
Time
Ref
Teaching
Method
33
File-System Interface : File concept and Access methods
50m
1
BB
34
Directory structure
1
BB
35
File-system mounting
50m
50m
1
BB
36
Protection
1
BB
37
50m
50m
1
1
BB
38
File-System Implementation, Directory implementation
Allocation methods
39
Free-space management , Efficiency and Performance
50m
1
40
Recovery, Log-structured file systems.
Case studies: File system in Linux , File system in Windows
XP
50m
1
BB
50m
1&
Web
BB
41
50m
BB
BB
DOC/LP/01/28.01.09
LESSON PLAN
LP- CS2254
Sub Code : CS 2254
LP Rev. No: 02
Sub Name : OPERATING SYSTEMS
Date: 31-12-13
Branch :
Page: 05 of 06
CS
Unit: V
Semester: IV
Unit syllabus:
I/O SYSTEMS
8
I/O Systems – I/O Hardware – Application I/O interface – kernel I/O subsystem – streams –
performance. Mass-Storage Structure: Disk scheduling – Disk management – Swap-space
management – RAID – disk attachment – stable storage – tertiary storage. Case study: I/O in Linux
Objective:
To understand the concepts of I/O system structures, disk scheduling and swap space management.
Session
No
Topics to be covered
Time
Ref
Teaching
Method
42
I/O Systems – I/O Hardware
50m
1
BB
43
Application I/O interface
50m
1
BB
44
Kernel I/O subsystem
50m
1
BB
45
Streams, Performance
1
BB
46
Mass-Storage Structure, Disk scheduling
50m
50m
47
50m
48
49
50
Disk management, Swap-space management
RAID
Disk attachment, Stable storage
Tertiary Storage
1
1
1
1
51
Case study: I/O in Linux
50m
50m
50m
50m
1
1&
Web
BB
BB
BB
BB
BB
BB
DOC/LP/01/28.01.09
LESSON PLAN
LP- CS2254
Sub Code : CS 2254
LP Rev. No: 02
Sub Name : OPERATING SYSTEMS
Date: 31-12-13
Branch :
Page: 06 of 06
CS
Semester: IV
Course Delivery Plan:
Weeks 1
2
I
3
4
II
5
6
7
8
III
9
10
IV
11
12
V
13
Units
COURSE TEXT
1. Silberschatz, Galvin, and Gagne, “Operating System Concepts”, Sixth Edition, Wiley India
Pvt Ltd, 2003.
REFERENCES
Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Pearson
Education, 2004.
3. Gary Nutt, “Operating Systems”, Third Edition, Pearson Education, 2004.
4. Harvey M. Deital, “Operating Systems”, Third Edition, Pearson Education, 2004.
2.
Prepared by
Approved by
Signature
Name
Mr. R Ramakrishnan,
Ms. D. Sasikala,
Prof B.Govindarajalu
Ms. S. Senthamizh Selvi
Designation
Date
Assistant Professor/CS
HOD-CS
31-12-2013
31-12-2013