COSC450 OPERATING SYSTEM, FALL 2026
Fall 2026 (08/31/26~ 12/11/26)
|
Week |
Lecture Notes |
Announcement |
||
|
Week-01 (08/31/26 ~ 09/04/26) |
Note #0 .PDF ·
Syllabus |
Note #1 .PDF Overview of Operating System ·
What is
operating system ·
Macroscopic
view of computer system ·
Computer
Structure – Von Newmann Architecture ·
Von Newmann
Bottleneck ·
Instruction
cycle ·
History of
Computer system and OS |
|
|
|
Week-02 (09/07/26 ~ 09/11/26) |
LABOR DAY (9/7/26) |
Note #2 .PDF Overview of Operating System ·
Computer system
architecture o
CPU o
Interrupt and
Implementation o
Memory
Hierarchy o
Input/Out
devices o
Buses –
parallel and serial buses o
Single and
Multiprocessor System Types ·
Operating
System Implementation o
Multiprogramming o
Multitasking o
Dual-Mode
Multimode Operation |
Note #3 .PDF Overview of Operating System ·
OS as a Resources Manager o
Process Management o
Memory Management o
File Management o
Input / Output System Management o
Deadlock Management o
Cache Management ·
Operating System Structures o
Monolithic o
Layered System o
Microkernels o
Virtual machine o
Client-Server module o
Exokernels |
|
|
Week-03 (09/14/26 ~ 09/18/26) |
Note #4 .PDF Process & Thread
Management ·
Processes ·
Process Model ·
Process
Creation ·
Process
Termination ·
Process States ·
Process Table
(Process Control Block) ·
Process with
Multiple-Threads ·
Process
Scheduling o
Scheduling
Queues o
CPU Scheduling o
Context Switch ·
Process
Creation in Linux ·
Process
Termination in Linux ·
Android Process
Hierarchy |
|
|
Section
test #1 (9/17/26) Note #1, #2, #3 |
|
Week-04 (09/21/26 ~ 09/25/26) |
Note #5 .PDF Process & Thread Management ·
Interprocess
Communication o
With Shared Memory (shared memory in Linux) o
With Message Passing (message Queue, socket in Linux) ·
Direct Communication ·
Indirect Communication ·
Message Passing Synchronization o
Blocking o
Non-blocking ·
Queueing ·
Threads o
Overview of Threads o
Benefit of Threads o
Multicore Programming with Threads |
Note #6 .PDF Process & Thread
Management ·
Thread
Implementation o
User level
thread o
Kernel level
thread ·
Multithreading
Model o
Many-to-one o
One-to-One o
Many-to-Many ·
The Thread
Library ·
The Threading
Issues o
Issues with fork(), exec() o
Signal handling o
Thread
termination o
Thread local
storage o
Scheduler
Activations |
|
|
|
Week-05 (09/28/26 ~ 10/02/26) |
Note #7 .PDF Process & Thread
Management ·
Scheduler o
Long-Term,
Short-Term (CPU), Memory ·
Scheduling
Queues ·
Preemptive or
Non-preemptive Scheduling ·
Scheduling
Criteria ·
CPU Scheduling
(Shot-term Scheduler) o
FCFS (First
Come First Serve) o
Shortest Job
First o
Shortest
Remaining Time o
Round Robin o
Priority Queue o
Guaranteed
Scheduling o
Lottery
Scheduling |
Note #8 .PDF Process & Thread Management ·
Multi-Processor Scheduling o
Approaches to Multiple Processor Scheduling o
Scheduling for Multicore processors ·
Fine Grained multithreading ·
Coarse-Grained multithreading ·
Load Balancing |
Note #9 .PDF Process & Thread Management ·
Real-Time CPU Scheduling o
Minimizing Latency o
Preemptive Priority-Based Scheduling o
Rate-Monotonic Scheduling o
Earliest-Deadline-First Scheduling o
Proportional Share Scheduling ·
Criteria for selecting an algorithm |
|
|
Week-06 (10/05/26 ~ 10/09/26) |
Note #10
.PDF Process & Thread Management ·
Inter-Process Communication ·
Race Condition ·
Critical Section (or region) ·
Solutions for Mutual Exclusion in a Critical Section o
With Busy Waiting ·
Disabling Interrupts ·
Lock Variables ·
Strict Alternation ·
Peterson’s Solution ·
Hardware Solution o
Test and Set Lock o
Memory Barriers o
Atomic Variable ·
Priority Inversion problems with busy waiting |
Note #11 .PDF Process & Thread Management ·
Mutual Exclusion in a Critical Section o
With Sleep and Wake up ·
Producer Consumer Problem ·
Race Condition Producer Consumer problem ·
Semaphore o
Concept of Semaphore o
Semaphore Operation o
Semaphore Implementation o
Producer Consumer problem with semaphores o
Careless Usage of semaphore causes deadlock ·
Dining Philosophers Problem ·
Reader’s and Writer’s Problem ·
Mutexes ·
Monitor o
Implementation of Monitor o
Producer Consumer with Monitor ·
Message Passing o
Producer Consumer with Message Passing |
|
|
|
Week-07 (10/12/26 ~ 10/16/26) |
Note #12 .PDF Memory Management ·
With Mono-Process ·
With Multi-Processes ·
Multi-process with Fixed partition- o
With separate input Queue o
With single input Queue ·
Multi-process with variable partition ·
Modeling Multiprogramming ·
Swapping ·
Free Memory Space Management o
With Bitmap o
With Free-List ·
Memory allocation algorithm – first, best, worst, next fit |
|
|
Section
test #2 (10/13/26) Note #4, #5, #6, #7, 10, #11 |
|
Week-08 (10/19/26 ~ 10/23/26) |
FALL BREAK (10/19/26, 10/20/26) |
Note #13 .PDF Memory Management ·
Virtual Memory ·
Virtual Memory with Paging o
Page tables o
Physical Address Mapping(MMU) |
|
|
|
Week-09 (10/26/26 ~ 10/30/26) |
Note #14 .PDF Memory Management ·
Virtual Memory with Paging o
Page Table with Hardware Support ·
Translation Look-Aside Buffer o
Page Table Structure ·
Shared Pages ·
Multilevel Page Table ·
Hashed Page Table ·
Inverted Page table |
Note #15 .PDF Memory Management ·
Demand Page and Page Fault ·
Free-Frame List ·
Performance of Demand Page with Page Fault ·
Swapping with Paging ·
Copy-on-Write between Parent and Child ·
Page Table Entries ·
Page Replacement Algorithms o
Optimal Algorithm o
Not Recently Used o
First In First Out o
Second Change o
The Clock Page Replacement o
Least Recently Used |
|
|
|
Week-10 (11/02/26 ~ 11/06/26) |
Note #16 .PDF Memory Management ·
Belady’s Anomaly o
Structure of
Stack Algorithm o
Stack Algorithm ·
Design Issues
for Paging System o
Local versus
Global allocation o
Load Control o
Page Size ·
Segmentation o
Hardware for
Segmentation Implementation o
Advantage and
Disadvantage with Segmentation ·
Segmentation
with Paging (case study MULTICS) |
Note #17 .PDF File Management ·
File System o
File Name o
File Structure o
File Types o
File Access o
File Attributes o
File Operation ·
Directories ·
Directory Operations ·
File System Layout ·
Implementing File –How to save file in the disk o
Contiguous Allocation o
Linked List Allocation o
Linked List Allocation with File Allocation Table o
Index-Node ·
Implementing Directories |
|
|
|
Week-11 (11/09/26 ~ 11/13/26) |
Note #18 .PDF File Management ·
Shared File in
multiuser system o
Save i-node index o
Symbolic link ·
Log-Structured
File System (extension of i-node + contiguous) ·
Journaling File
System ·
Disk Space
Management o
Block size o
Free block
management ·
Linked List ·
Bit Map |
Note #19 .PDF File Management ·
Disk Space Management ·
Free Block Management o
Linked List o
Bit Map ·
Disk Quota ·
File System Backup o
Physical Backup o
Logical Backup |
|
Section
Test #3 (11/10/26) Note #12, 13, 14, 15, 16 |
|
Week-12 (11/16/26 ~ 11/20/26) |
Note #20 .PDF Deadlock Management ·
What is Deadlock? ·
Resource Allocation Graph o
Deadlock example with Resources Allocation Graph ·
Resource Types for a Process ·
Sequence for Resource Use ·
Implementation of Resource request, use and release ·
Deadlock Condition ·
Four Strategies for Dealing Deadlock |
Note #21 .PDF Deadlock Management ·
Deadlock detection and Recovery. o
Detection with one resource of each type o
Detection with multiple resource of
each type ·
Detection Algorithm with multiple matrix o
Recover from Deadlock after a deadlock detection |
|
|
|
Week-13 (11/23/26 ~ 11/27/26) |
Note #22 .PDF Deadlock Management ·
Deadlock Avoidance o
Safe and Unsafe State o
Banker’s Algorithm for a Single Resource per each Type o
Banker’s Algorithm for Multiple Resource per each Type ·
Deadlock Prevention o
Attack Mutual Exclusion o
Attack Hold and Wait o
Attack No Preemption o
Attack Circular Wait |
THANKSGIVING BREAK (11/25/26 ~11/27/26) |
|
|
|
Week-14 (11/30/26 ~ 12/04/26) |
|
|
|
|
|
Week-15 (12/07/26 ~ 12/11/26) |
|
|
|
|
|
Final Exam (12/14/26 ~ 12/18/26) |
|
|
|
|