Spring 2020 (01/27/2020 - 05/18/2020)

The semester has 29 class meetings including midterm and final exams. 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

Assignments

Online Quiz 1 on CUNY Blackboard (Due: before the class on Monday, February 3 on CUNY Blackboard)

Reading

Chapter 1 of the textbook

Online Discussion via Disqus (Experimental)

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

Lecture Notes

Assignments

Setting up a x86 Linux system on a VirtualBox virtual machine and running the example boot sector programs. (Due: by February 12.)

Reading

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

Online Discussion via Disqus (Experimental)

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

Lecture Notes

Assignments

Setting up a x86 Linux system on a VirtualBox virtual machine and running the example boot sector programs. (Due: by February 12.)

Reading

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

Online Discussion via Disqus (Experimental)

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

Lecture Notes

Assignments

Setting up a x86 Linux system on a VirtualBox virtual machine and running the example boot sector programs. (Due: by February 12.)

Reading

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

Online Discussion via Disqus (Experimental)

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

Reading

Sections 2.1 - 2.11

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

Reading

Sections 5.1 - 5.7

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

Reading

Sections 5.1 - 5.7

Topics: CPU scheduling (unfinished discussion); Q & A for Midterm Exam.

Lecture Notes

Reading

Chapters 1, 2, 3, 4, 5, and Sections 12.1 and 12.2 of the textbook; lecture note; all quizzes; review guide and test

Topics: Miterm Exam is held 3:40 - 4:55 PM in Room 431 Ingersoll Hall Extension (431IA)

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)

Lecture Notes

Reading

Chapter 6, Sections 7.2 - 7.4

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)

Lecture Notes

Reading

Chapter 6, Sections 7.2 - 7.4

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)

Lecture Notes

Reading

Chapter 6, Sections 7.2 - 7.4

Topics: 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

Reading

Sections 8.1, 8.3, 8.4, and 8.6; (Optional) Section 8.2, 8.5, 8.7, and 8.9

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

Sections 9.1 - 9.4

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

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

Reading

Section 9.5; Sections 10.1 - 10.6

Notice: College open but no class scheduled per the College's calendar for Spring 2020

Notice: College open but no class scheduled per the College's calendar for Spring 2020

Notice: College open but no class scheduled per the College's calendar for Spring 2020

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

Lecture Notes

Reading

Section 9.5; Sections 10.1 - 10.6

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

Lecture Notes

Reading

Section 9.5; Sections 10.1 - 10.6

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

Lecture Notes

Reading

Section 9.5; Sections 10.1 - 10.6

Topics: I/O devices; I/O schemes; characterizing I/O devices; structure of I/O subsystems; (time permits) design of I/O subsystems

Lecture Notes

Reading

Sections 12.1, 12.2, 12.3, 12.4, and 12.5

Topics: file concept, access methods, disk and directory structure, file-system mounting, file sharing, file protection; (time permits) file-System structure, file-System operations directory implementation, allocation methods, free-space management, efficiency and performance, file system recovery;

Lecture Notes

Reading

Chapters 13 and 14

Topics: Overview of mass storage; HDD; NVM; optimization for HDD (HDD scheduling); optimization for NVM; reliability and efficiency; RAID; ZFS

Lecture Notes

Reading

Sections 11.1, 11.2, 11.3, 11.4, 11.8

Topics: Selected topics on file systems and mass storage; Q & A for Final Exam.

Lecture Notes

Reading

Relevant chapters in the textbook; lecture notes; all quizes; review guides and tests

Topics: Overview of mass storage; HDD; NVM; optimization for HDD (HDD scheduling); optimization for NVM; reliability and efficiency; RAID; ZFS

Lecture Notes

Reading

Sections 11.1, 11.2, 11.3, 11.4, 11.8