Schedule
Spring 2022 (01/28/2022 - 05/24/2022)
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
Exercises
Reading
Topics: review of concept of interrupts and interrupt handling; Overview of I/O hardware; I/O schemes;
Lecture Notes
Exercises
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
Exercises
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
Exercises
Reading
Topics: completing assignments from last week; concepts of process; process/thread scheduling; process/thread states; transition of process/threat states; process control block; process creation; process termination; multirprocess architecture; multithread architecture; comparison of multiprocess and multithread architectures;
Lecture Notes
Exercises
Reading
Topics: completing assignments from last week; concepts of process; process/thread scheduling; process/thread states; transition of process/threat states; process control block; process creation; process termination; multirprocess architecture; multithread architecture; comparison of multiprocess and multithread architectures;
Lecture Notes
Exercises
Reading
Topics: completing assignments from last week; concepts of process; process/thread scheduling; process/thread states; transition of process/threat states; process control block; process creation; process termination; multirprocess architecture; multithread architecture; comparison of multiprocess and multithread architectures;
Lecture Notes
Exercises
Reading
Topics: Miterm Exam is held 6:05 - 8:10 PM on Zoom. This exam covers chapters 1, 2, 3, and sections 12.1 and 12.2.
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
Exercises
Reading
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
Reading
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
Reading
Notice: Spring Recess - No classes scheduled
Topics: Concept of swapping; concept of virtual memory; demand paging; copy-on-write; frame allocation; page replacement; thrashing; working-set model;
Lecture Notes
Exercises
Reading
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
Exercises
Reading
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
Exercises
Reading
Topics: 6:05 - 8:10 PM, Thursday, May 20, 2020 via Zoom. The exam is cumulative.