Fall 2024 (08/28/2024 - 12/14/2024)

The semester has 15 class meetings including the final exam. Clicking on a class day below, you should find the class module for the day including lecture notes, assignments, and others. The instructor releases the content for a class generally on the Monday before the class. However, the instructor often makes update to the module content after the initial release. You should check this page often for up-to-date content.

In case you encounter a problem when viewing class content, such as, a broken link, please report it to the instructor immediately.

Topics: overview of class organization; overview of operating systems including computer organization, computer architecture, operating system structures, resources management, and computing environments

Lecture Notes

Course Overview OS Overview PC Overview

Exercises

(Tutorial) Experimenting with Boot Sector Code (Part 1) (Due: )

Reading

Chapter 1 of the textbook

Topics: review of concept of interrupts and interrupt handling; Overview of I/O hardware; I/O schemes;

Lecture Notes

Interrupts and I/O (Tutorial) Programming Interrupts in Boot Sector Code (Part 4) (Tutorial) I/O Schemes in Boot Sector Code (Part 5)

Exercises

Experimenting with Interrupts and I/O Schemes (Due: September 11, 2024)

Reading

Sections 1.2, 1.3, 1.7; Sections 12.1, 12.2, 12.3

Topics: OS functions and services; user OS interface; system calls; type of system calls; system calls and library functions; using system calls; system calls and APIs; system programs; overview of OS design and implementation; OS structure; OS debugging; building and booting OS

Lecture Notes

OS Functions and Services (Tutorial) Run Your Own "init" Program Revisited (Tutorial) A Brief Introduction to Bash Shell Scripting

Exercises

(Tutorial) Build a simple device driver as a Linux Loadable Kernel Module (Due: September 18, 2024)
(Tutorial) Example System Call/API Programs (Due: September 18, 2024)

Reading

Topics: OS functions and services; user OS interface; system calls; type of system calls; system calls and library functions; using system calls; system calls and APIs; system programs; overview of OS design and implementation; OS structure; OS debugging; building and booting OS

Lecture Notes

OS Functions and Services (Tutorial) Run Your Own "init" Program Revisited (Tutorial) A Brief Introduction to Bash Shell Scripting

Exercises

(Tutorial) Build a simple device driver as a Linux Loadable Kernel Module (Due: September 18, 2024)
(Tutorial) Example System Call/API Programs (Due: September 18, 2024)

Reading

Notice: No Classes Scheduled

Topics: Miterm Exam is held 6:05 - 8:10 PM This exam covers chapters 1, 2, 3, and sections 12.1 and 12.2.

Topics: Race condition, critical section problem, Peterson's solution, limitation of Peterson's solution, hardware support for synchronization, test_and_set, compare_and_swap, acquiring and releasing locks via hardware instructions, meeting critical section requirements (mutual exclusion, progress, and bounded waiting); Concept of deadlock; necessary conditions; resource allocation graph; Banker's algorithm; the Ostrich algorithm; deadlock avoidance; (time permits) deadlock detection; (time permits) deadlock prevention; (time permits) recovery from deadlock;

Lecture Notes

Inter-process Communication (IPC) Synchronization Deadlock

Exercises

Experiment with Next PID/PID program (Due: November 13)
Experiment with Thread Pool program (Due: November 13)
Experiment with Producer-Consumer problem (Due: November 13)
Project 2 Process Abstraction and Application Container (Due: November 20)

Reading

Chapter 6, Sections 7.2 - 7.4; Sections 8.1, 8.3, 8.4, and 8.6; (Optional) Section 8.2, 8.5, 8.7, and 8.9
Example Programs Demonstrating Race Conditions Example Programs Using OS Tools for Synchronization

Topics: Race condition, critical section problem, Peterson's solution, limitation of Peterson's solution, hardware support for synchronization, test_and_set, compare_and_swap, acquiring and releasing locks via hardware instructions, meeting critical section requirements (mutual exclusion, progress, and bounded waiting); Concept of deadlock; necessary conditions; resource allocation graph; Banker's algorithm; the Ostrich algorithm; deadlock avoidance; (time permits) deadlock detection; (time permits) deadlock prevention; (time permits) recovery from deadlock;

Lecture Notes

Deadlock

Reading

Chapter 6, Sections 7.2 - 7.4; Sections 8.1, 8.3, 8.4, and 8.6; (Optional) Section 8.2, 8.5, 8.7, and 8.9

Topics: basic concepts regarding multiprogramming; scheduling criteria; scheduling algorithms; thread scheduling; scheduling for multiprocessor systems; real-time scheduling; (time permits) operating system CPU scheduling examples; (time permits) algorithm evaluation

Lecture Notes

CPU Scheduling

Reading

Sections 5.1 - 5.7

Notice: Conversion Day - Classes Follow Friday Scheduled

Topics: Address binding; memory allocation; logical address; physical address; rellocation and limit registers; continuous allocation; paging; TLB; analysis of TLB; structure of page tables (hierarchical, hashed, and inverted), memory segmentation

Lecture Notes

Main Memory
Additional Notes
Example Programs

Exercises

TBA

Reading

Sections 9.1 - 9.4

Topics: Concept of swapping; concept of virtual memory; demand paging; copy-on-write; frame allocation; page replacement; thrashing; working-set model;

Lecture Notes

Virtual Memory
Example Programs

Reading

Section 9.5; Sections 10.1 - 10.6

Topics: 6:05 - 8:10 PM, Wednesday, Decmeber 18, 2024.