Operating System Principles Chen Xiangqun, Peking University

1. Master the basic concepts, functional components, system structure and operating environment of operating systems;
2. Be familiar with and apply the working principles, design methods and implementation technologies of operating systems, and understand representative and typical operating system examples (such as UNIX, Linux and Windows);

3. Understand the evolution process, development research trends, new technologies and new ideas of operating systems, lay a good foundation for subsequent study of related courses, and lay the foundation for subsequent career development.

• Chapter 1：What does the operating system do? (10 minutes and 12 seconds)

• Chapter 2：The definition and role of operating system (20 minutes and 13 seconds)

• Chapter 3：Main features of operating systems (10 minutes and 30 seconds)

• Chapter 4：Architecture of a typical operating system (11 minutes and 11 seconds)

• Chapter 5：Classification of operating systems 1 (17 minutes and 17 seconds)

• Chapter 6：Classification of operating systems 2 (18 minutes and 23 seconds)

• Chapter 7：Processor status (15 minutes and 51 seconds)

• Chapter 8：Introduction to interrupt and exception mechanisms (14 minutes and 50 seconds)

• Chapter 9：How the interrupt and exception mechanism works (16 minutes and 27 seconds)

• Chapter 10：Example: X86 interrupt and exception mechanism (9 minutes and 48 seconds)

• Chapter 11：System call mechanism (15 minutes and 35 seconds)

• Chapter 12：Example: Introduction to the Linux system call mechanism based on X86 (13 minutes and 23 seconds)

• Chapter 13：Basic concepts of process (17 minutes and 40 seconds)

• Chapter 14：Process status and status transition (14 minutes and 51 seconds)

• Chapter 15：process control (14 minutes and 18 seconds)

• Chapter 16：Discussion on process-related concepts (17 minutes and 40 seconds)

• Chapter 17：The introduction of threads (14 minutes and 43 seconds)

• Chapter 18：Implementation of thread mechanism (11 minutes and 14 seconds)

• Chapter 19：Concepts related to processor scheduling (15 minutes and 4 seconds)

• Chapter 20：Several issues to consider when designing scheduling algorithms (9 minutes and 1 seconds)

• Chapter 21：Scheduling Algorithms for Batch Processing Systems (13 minutes and 25 seconds)

• Chapter 22：Scheduling Algorithms for Interactive Systems (16 minutes and 52 seconds)

• Chapter 23：Multi-level feedback queue scheduling algorithm, summary of various scheduling algorithms, etc. (13 minutes and 1 seconds)

• Chapter 24：Windows thread scheduling algorithm (14 minutes and 54 seconds)

• Chapter 25：Concurrent execution of processes (12 minutes and 27 seconds)

• Chapter 26：Process mutual exclusion (9 minutes and 42 seconds)

• Chapter 27：Software solution for process mutual exclusion (17 minutes and 2 seconds)

• Chapter 28：Hardware solution for process mutual exclusion (12 minutes and 4 seconds)

• Chapter 29：Process synchronization (13 minutes and 49 seconds)

• Chapter 30：Semaphores and PV operations (11 minutes and 22 seconds)

• Chapter 31：producer consumer problem (9 minutes and 55 seconds)

• Chapter 32：reader-writer problem (10 minutes and 37 seconds)

• Chapter 33：Basic concepts of pipeline (11 minutes and 38 seconds)

• Chapter 34：HOARE management process (8 minutes and 15 seconds)

• Chapter 35：Application of tube process (11 minutes and 23 seconds)

• Chapter 36：MESA management process (13 minutes and 9 seconds)

• Chapter 37：Synchronization mechanism in PTHREAD (8 minutes and 21 seconds)

• Chapter 38：Inter-process communication IPC (10 minutes and 20 seconds)

• Chapter 39：IPC mechanism in typical operating systems (11 minutes and 40 seconds)

• Chapter 40：Basic concepts-address relocation (12 minutes and 35 seconds)

• Chapter 41：Physical memory management (7 minutes and 18 seconds)

• Chapter 42：Buddy system (8 minutes and 42 seconds)

• Chapter 43：Basic memory management solution 1 (9 minutes and 24 seconds)

• Chapter 44：Basic memory management solution 2 (19 minutes and 41 seconds)

• Chapter 45：switching technology (14 minutes and 15 seconds)

• Chapter 46：virtual storage technology (12 minutes and 9 seconds)

• Chapter 47：Design of page tables and page table entries (18 minutes and 53 seconds)

• Chapter 48：Address translation process and introduction of TLB (11 minutes and 46 seconds)

• Chapter 49：Page Fault (6 minutes and 14 seconds)

• Chapter 50：Software related strategies (18 minutes and 13 seconds)

• Chapter 51：Page replacement algorithm 1 (25 minutes and 29 seconds)

• Chapter 52：Page replacement algorithm 2-working set algorithm (17 minutes and 33 seconds)

• Chapter 53：Other related technologies (7 minutes and 1 seconds)

• Chapter 54：Files and file systems (15 minutes and 28 seconds)

• Chapter 55：file storage medium (8 minutes and 30 seconds)

• Chapter 56：Disk space management (11 minutes and 6 seconds)

• Chapter 57：File control block and file directory (13 minutes and 11 seconds)

• Chapter 58：The physical structure of the file (29 minutes and 7 seconds)

• Chapter 59：File system implementation (13 minutes and 54 seconds)

• Chapter 60：File system example - UNIX (15 minutes and 58 seconds)

• Chapter 61：File system example - FAT (22 minutes and 38 seconds)

• Chapter 62：Implementation of file operations (12 minutes and 16 seconds)

• Chapter 63：File system management (13 minutes and 50 seconds)

• Chapter 64：File system security (6 minutes and 44 seconds)

• Chapter 65：File system performance1 (18 minutes and 29 seconds)

• Chapter 66：File system performance 2 (16 minutes and 27 seconds)

• Chapter 67：File system performance3 (11 minutes and 42 seconds)

• Chapter 68：Two exercises for file systems (8 minutes and 58 seconds)

• Chapter 69：IO management overview (18 minutes and 17 seconds)

• Chapter 70：IO hardware composition (9 minutes and 59 seconds)

• Chapter 71：IO control mode (6 minutes and 29 seconds)

• Chapter 72：The composition of IO software (5 minutes and 34 seconds)

• Chapter 73：IO related technologies (10 minutes and 43 seconds)

• Chapter 74：IO device management (8 minutes and 45 seconds)

• Chapter 75：IO performance issues (5 minutes and 54 seconds)

• Chapter 76：Basic concept of deadlock (20 minutes and 52 seconds)

• Chapter 77：Resource Allocation Map (12 minutes and 10 seconds)

• Chapter 78：Deadlock prevention (14 minutes and 6 seconds)

• Chapter 79：Deadlock avoidance (16 minutes and 55 seconds)

• Chapter 80：banker's algorithm (15 minutes and 20 seconds)

• Chapter 81：Deadlock detection and release (8 minutes and 18 seconds)

• Chapter 82：dining philosopher problem (18 minutes and 8 seconds)