Download CS2254-OS

DOC/LP/01/28.02.02
LP-CS2254
LESSON PLAN
LP Rev. No: 02
Sub Code & Sub Name : CS2254
Unit: I
OPERATING SYSTEMS
Branch: IT,CS
Semester : IV
Date:31/12/2013
Page 1 of 6
Unit syllabus:
Unit I 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:
Students are given an overview of operating system, operating system structure, system calls
and processes and Threads.
Session
No
Topics to be covered
1
Introduction to operating systems – review of
computer organization
2
Operating system structures – system calls –
system programs
3
System structure , virtual machines.
Ref
1(P 3-20)
50m
1(P 63-74),
2(P 44-56)
1(P 74-85),
2(P 56-63)
1(P 95-99),
3(P 30-39),
4(P 54-55)
1(P 99-103)
BB
1(P 103-109),
2(P 71-80),
4(P 54-55)
1(P 109-126),
2(P 100-106),
3(P 231-237)
1(P 129-139),
2(P 81-93),
3(P 39-43)
1(P 139-140)
BB
50m
4
Process Concept- Process, Process control
Block, Threads
50m
5
Process Scheduling- Scheduling Queues,
Schedulers, Context Switch
Operations on Processes- Process creation,
Process Termination, Cooperating Processes
50m
6
7
8
9
50m
Inter-process Communication- Message Passing 50m
System, Naming, Synchronization, Buffering
Communication in Client Server System
Threads–User
and
Kernel
Threads, 50m
Multithreading model, Threading issues
Case Study: Pthreads library
Teaching
Method
BB
Time
50m
50m
BB
BB/LCD
BB/LCD
BB
BB
BB
DOC/LP/01/28.02.02
LP- CS2254
LESSON PLAN
LP Rev. No: 02
SubCode & Sub Name : CS2254 OPERATING SYSTEMS
Date:31/12/2013
Unit: II
Page 2 of 6
Branch: IT,CS
Semester :IV
Unit syllabus:
Unit II 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:
Students acquire knowledge about CPU scheduling, Scheduling algorithms, Process
Synchronization, Semaphores and deadlock.
Session
No
Topics to be covered
10
CPU Scheduling -Basic Concepts -Scheduling
Criteria
11
Scheduling Algorithms- FCFS, SJF, Priority,
Round Robin, Multi level queue, Multilevel
feedback queue
12
Multiple-Processor Scheduling, Real Time
Scheduling, Algorithm Evaluation, Case study:
Process scheduling in Linux
13
Process Synchronization- The Critical-Section
Problem-Two process solution, Multiple
process solution
14
Synchronization Hardware
15
Time
50m
50m
Ref
1(P 151-156),
2(P 393-397)
1(P 157-169)
50m
1(P 169-177)
BB/LCD
50m
1(P 191-197),
2(P 102-106)
BB
50m
1(P 197-200),
2(P 113-114)
1(P 201-206),
3(P 194-197)
1(P 206-211),
2(P 125-129),
3(P 197-207),
4(P 227-234)
1(P 243-248),
2(P 159-168),
3(P 250-257)
1(P 250-260),
2(P 180-183),
3(P 257-267)
1(P 260-265),
2(P 168-175),
3(P 267-279)
BB
Semaphores- Implementation, Deadlock and
starvation, Binary semaphore
Classic problems of Synchronization-Bounded
buffer, Readers-Writers, Dining Philosophers
Critical regions, Monitors.
50m
17
System Model -Deadlock Characterization,
Methods for handling Deadlocks
50m
18
Deadlock prevention , Deadlock avoidanceBankers Algorithm
50m
19
Deadlock detection, Recovery from deadlock.
50m
16
Teaching
Method
BB
50m
BB/LCD
BB/LCD
BB/LCD
BB
BB
BB/LCD
DOC/LP/01/28.02.02
CAT I
LP- CS2254
LESSON PLAN
LP Rev. No: 02
Sub Code & Sub Name : CS2254
Unit: III
OPERATING SYSTEMS
Branch: IT,CS
Semester : IV
Date: 31/12/2013
Page 3 of 6
Unit syllabus
Unit III 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:
The main objective of this unit is to impart a thorough knowledge of storage management,
virtual memory and page replacement.
Session
No
Topics to be covered
20
Memory Management- Address binding,
Physical and Logical address, Dynamic
loading and linking, overlays, Swapping
21
Contiguous Memory allocation-Memory
protection, memory allocation,
Fragmentation
22
Paging- Page method, Hardware support,
Protection, Structure of page table, Shared
pages
23
Segmentation- Method, Hardware,Protection
and Sharing, fragmentation
Ref
1(P 273-283),
4(P 187-189)
50m
1(P 283-287),
4(P 190-191)
BB
50m
1(P 287-303),
2(P 230-236),
3(P 323-329)
1(P 303-309),
3(P 346-354),
4(P 237-240)
1(P 309-312),
1(P 317-319),
2(P 202-203),
1(P 320-328),
2(P 203-214),
3(P 330-334)
1(P 328-338),
2(P 214-216)
BB/LCD
1(P 338-348),
2(P 217-220)
1(P 348-353),
2(P 222-227)
BB/LCD
50m
24
Segmentation with Paging.
Virtual Memory
50m
25
Demand Paging- Concepts, Performance
50 m
26
Process creation- Copy-on-write, Memory
mapped files, Page Replacement- FIFO,
Optimal
Page Replacement- LRU, Counting based,
page buffering, Allocation of frames
Thrashing- Causes, Working set model, page
fault frequency Case Study: Memory
50m
27
28
Teaching
Method
BB/LCD
Time
50m
50m
50m
BB/LCD
BB
BB/LCD
BB/LCD
BB
DOC/LP/01/28.02.02
management in Linux
1(P 716-723)
LP-CS2254
LESSON PLAN
LP Rev. No: 02
SubCode & SubName : CS2254 OPERATING SYSTEMS
Date:31/12/2013
Unit: IV
Page 4 of 6
Branch: IT,CS
Semester :IV
Unit syllabus:
Unit IV File Systems
9
File-System Interface: File concept – Access methods – Directory structure – File-system
mounting – Protection. File-System Implementation : Directory implementation – Allocation
methods – Free-space management – efficiency and performance – recovery – log-structured
file systems. Case studies: File system in Linux – file system in Windows XP.
Objective:
Students will gain knowledge on file concepts, Directory implementation and file systems.
Session
No
Topics to be covered
29
File conceptAttributes,Operations,types, Access
methods – Directory structure
30
File-system mounting – Sharing,
Protection-Access Control
31
File System Structure
32
33
34
35
36
37
Ref
1(P 371-393),
3(P 358-371)
50m
1(P 393-395),
1(P 402-406)
1(P 411-419),
2(P380-393)
3(P 371-384),
4(P 389-392)
BB
1(P 420-421),
2(P 393-398)
1(P 421-430),
4(P 394-400)
1(P 430-433),
4(P 394-400),
2(P 413-414)
1(P 433-439),
2(P 424-428)
BB/LCD
1(P 439-441),
2(P 428-430)
1(P 724-729)
1(P 766-774)
BB/LCD
50m
File System ImplementationPartitioning and mounting, Virtual File
systems
Directory Implementation-List, Hash
table
Allocation Methods-Contiguous,
Linked, Indexed.
Free-space management-Bit Vector,
List, Grouping, Counting
50m
Efficiency and performance,
Recovery-Consistent Checking,
Backup and restore
Log-structured file systems.
50m
Case studies: File system in Linux – file
system in Windows XP.
Teaching
Method
BB
Time
50m
50m
50m
50m
50m
BB
BB
BB
BB/LCD
BB
DOC/LP/01/28.02.02
CAT - II
LP- CS2254
LESSON PLAN
LP Rev. No: 02
SubCode & SubName : CS2254
Unit: V
OPERATING SYSTEMS
Semester :IV
Branch: IT,CS
Date: 31/12/2013
Page 5 of 6
Unit syllabus:
Unit V 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:
In this Unit, the students will gain knowledge about I/O system I/O hardware, Disk Scheduling,
RAID.
Session
No
Topics to be covered
38
I/O Systems- I/O Hardware- Polling,
Interrupts, DMA
39
40
41
42
43
44
45
Application I/O interface-Block and
character devices, Network devices, Clocks
and timers
Kernel I/O Subsystems-I/O Scheduling,
Buffering, Caching, Spooling
Streams-Performance
Disk Structure - Disk SchedulingFCFS,SSTF,SCAN,CSCAN,
LOOK,CLOOK
Disk Management-Formatting, Boot block,
bad blocks, Swap-Space Management-Use,
Location
RAID, Disk attachments, Stable storage
Tertiary Storage
Case Study: I/O in Linux
CAT-III
Time
50m
Teaching
Method
BB
50m
Ref
1(P 455-456)
1(P 456-466),
2(P 269-282)
1(P 466-472)
50m
1(P 472-478)
BB
50m
50m
1(481-486)
1(P 491-498),
2(P 300-322)
BB
BB/LCD
50m
1(P 498-501),
BB
50m
50m
1(P 502-504)
1P(505-515)
1P(516-526)
1(P 729-732),
2(P 671-780)
BB
BB/LCD
BB/LCD
DOC/LP/01/28.02.02
LP- CS2254
LESSON PLAN
LP Rev. No: 02
SubCode & Sub Name : CS2254 OPERATING SYSTEMS
Date:31/12/2013
Unit:I,II,III,IV,V
Page 6 of 6
Branch: IT,CS
Semester :IV
Course Delivery Plan:
Week
1
2
3
4
I II
I II
I II
I II
Units
1
5
6
7
I II I II I II
3
2
CAT I
8
9
10
11
12
I II
I II
I II
I II
I II
4
5
CAT II
CAT III
TEXT BOOK:
1. Silberschatz, Galvin, and Gagne, “Operating System Concepts”, Sixth Edition, Wiley
India Pvt Ltd, 2003.
REFERENCES:
2. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Pearson
Education/PHI 2001.
3. Gary Nutt, “Operating Systems”, Third Edition, Pearson Education, 2004.
4. Harvey M. Deital, “Operating Systems”, Third Edition, Pearson Education, 2004.
Prepared by
Approved by
Signature
Name
Designation
V. Saroja
A. Rohini
AP/IT
Dr. D. Balasubramanian
HOD/IT
DOC/LP/01/28.02.02
Date
31-12-2013
31-12-2013