Operating System (Xiang Yong and Chen Yu, Tsinghua University)

The operating system is the core system software in the computer system that is responsible for managing various software and hardware resources, and provides a good environment for application software to run. Mastering the basic principles of operating systems and their core technologies is a basic requirement for undergraduate computer science graduates from research-oriented universities. This course is a core course for computer majors. It uses mainstream operating systems as examples and the teaching operating system ucore as the experimental environment. It teaches the concepts, basic principles and implementation techniques of operating systems, and prepares students for the research and development of operating system software and the full use of operations. System functions to lay a solid foundation for application software research and development. Course wiki page: http://os.cs.tsinghua.edu.cn/oscourse/OS2018spring Course Q&A and communication area: https://piazza.com/tsinghua.edu.cn/spring2015/30240243x/home

• Chapter 1：Course Overview (7 minutes and 57 seconds)

• Chapter 2：study schedule (14 minutes and 24 seconds)

• Chapter 3：What is an operating system (10 minutes and 32 seconds)

• Chapter 4：Why learn operating system, how to learn operating system (10 minutes and 47 seconds)

• Chapter 5：Operating system example (4 minutes and 4 seconds)

• Chapter 6：The evolution of operating systems (12 minutes and 51 seconds)

• Chapter 7：operating system structure (9 minutes and 30 seconds)

• Chapter 8：Foreword and current situation at home and abroad (19 minutes and 29 seconds)

• Chapter 9：OS experiment goals (7 minutes and 47 seconds)

• Chapter 10：8 OS Experiments Overview (7 minutes and 56 seconds)

• Chapter 11：Experimental environment setup (19 minutes and 50 seconds)

• Chapter 12：x86-32 hardware introduction (8 minutes and 48 seconds)

• Chapter 13：Some programming skills of ucore (9 minutes and 17 seconds)

• Chapter 14：Demonstrate experimental operation process (7 minutes and 47 seconds)

• Chapter 15：BIOS (7 minutes and 52 seconds)

• Chapter 16：System startup process (14 minutes and 32 seconds)

• Chapter 17：Interrupts, exceptions and system calls compared (15 minutes and 25 seconds)

• Chapter 18：system call (9 minutes and 28 seconds)

• Chapter 19：System call example (7 minutes and 47 seconds)

• Chapter 20：ucore+system call code (5 minutes and 11 seconds)

• Chapter 21：boot sequence (25 minutes and 27 seconds)

• Chapter 22：Implementation of C function call (7 minutes and 29 seconds)

• Chapter 23：GCC inline assembly (7 minutes and 12 seconds)

• Chapter 24：X86 interrupt handling process (18 minutes and 46 seconds)

• Chapter 25：Exercise 1 (9 minutes and 29 seconds)

• Chapter 26：Exercise 2 (5 minutes and 27 seconds)

• Chapter 27：Exercise 3 (5 minutes and 1 seconds)

• Chapter 28：Exercise 4 Exercise 5 (5 minutes and 59 seconds)

• Chapter 29：Exercise 6 (12 minutes and 43 seconds)

• Chapter 30：Computer Architecture and Memory Hierarchy (12 minutes and 19 seconds)

• Chapter 31：Address space and address generation (14 minutes and 37 seconds)

• Chapter 32：contiguous memory allocation (14 minutes and 40 seconds)

• Chapter 33：Defragmentation (6 minutes and 44 seconds)

• Chapter 34：Buddy system (10 minutes and 39 seconds)

• Chapter 35：Background on the requirements for non-contiguous memory allocation (8 minutes and 20 seconds)

• Chapter 36：Segmented storage management (5 minutes and 32 seconds)

• Chapter 37：Page storage management (8 minutes and 0 seconds)

• Chapter 38：Page table overview (8 minutes and 19 seconds)

• Chapter 39：Fast tables and multi-level page tables (6 minutes and 57 seconds)

• Chapter 40：Inverted page table (8 minutes and 4 seconds)

• Chapter 41：Segmented page storage management (5 minutes and 10 seconds)

• Chapter 42：Understanding privilege levels in x86 protected mode (12 minutes and 56 seconds)

• Chapter 43：Understand the privilege level switching process (17 minutes and 40 seconds)

• Chapter 44：Understanding Segment_Page Table (8 minutes and 50 seconds)

• Chapter 45：Understand ucore creates segment_page table (13 minutes and 40 seconds)

• Chapter 46：Demonstrate lab2 experimental session (15 minutes and 49 seconds)

• Chapter 47：Virtual storage demand background (9 minutes and 30 seconds)

• Chapter 48：Cover and swap (11 minutes and 46 seconds)

• Chapter 49：locality principle (9 minutes and 31 seconds)

• Chapter 50：Virtual storage concept (5 minutes and 10 seconds)

• Chapter 51：virtual page storage (13 minutes and 1 seconds)

• Chapter 52：Page fault exception (9 minutes and 15 seconds)

• Chapter 53：The concept of page replacement algorithm (8 minutes and 39 seconds)

• Chapter 54：Optimal algorithm, first-in-first-out algorithm, and most recently used algorithm (21 minutes and 53 seconds)

• Chapter 55：Clock replacement algorithm and least common algorithm (20 minutes and 25 seconds)

• Chapter 56：Comparison between Belady phenomenon and local replacement algorithm (12 minutes and 57 seconds)

• Chapter 57：working set replacement algorithm (15 minutes and 37 seconds)

• Chapter 58：Page fault rate replacement algorithm (7 minutes and 54 seconds)

• Chapter 59：Jitter and load control (4 minutes and 36 seconds)

• Chapter 60：Experimental goal: virtual memory management (6 minutes and 14 seconds)

• Chapter 61：Review history and understand the present (16 minutes and 18 seconds)

• Chapter 62：Processing flows, key data structures and functions (10 minutes and 39 seconds)

• Chapter 63：Page access exception (7 minutes and 32 seconds)

• Chapter 64：Page swap-in and swap-out mechanism (12 minutes and 34 seconds)

• Chapter 65：process concept (8 minutes and 5 seconds)

• Chapter 66：process control block (5 minutes and 49 seconds)

• Chapter 67：process status (12 minutes and 9 seconds)

• Chapter 68：three-state process model (5 minutes and 14 seconds)

• Chapter 69：Suspended process model (6 minutes and 15 seconds)

• Chapter 70：The concept of thread (12 minutes and 10 seconds)

• Chapter 71：user thread (4 minutes and 56 seconds)

• Chapter 72：kernel thread (6 minutes and 1 seconds)

• Chapter 73：Process switching (16 minutes and 31 seconds)

• Chapter 74：Process creation (23 minutes and 55 seconds)

• Chapter 75：process loading (7 minutes and 52 seconds)

• Chapter 76：Process waiting and exit (11 minutes and 37 seconds)

• Chapter 77：General introduction (6 minutes and 57 seconds)

• Chapter 78：Key data structures (9 minutes and 21 seconds)

• Chapter 79：Implementation process (12 minutes and 40 seconds)

• Chapter 80：Actual operation (5 minutes and 14 seconds)

• Chapter 81：General introduction (10 minutes and 54 seconds)

• Chapter 82：Process memory layout (7 minutes and 0 seconds)

• Chapter 83：Execute binary code in ELF format-implementation of do_execve (7 minutes and 0 seconds)

• Chapter 84：Execute binary code in ELF format-implementation of load_icode (4 minutes and 1 seconds)

• Chapter 85：process replication (5 minutes and 59 seconds)

• Chapter 86：Memory management copy-on-write mechanism (8 minutes and 31 seconds)

• Chapter 87：Processor Scheduling Concepts (5 minutes and 37 seconds)

• Chapter 88：Scheduling criteria (10 minutes and 40 seconds)

• Chapter 89：First come first served, short process first and highest response ratio first scheduling algorithm (15 minutes and 11 seconds)

• Chapter 90：Time slice rotation, multi-level feedback queue, fair sharing scheduling algorithm and ucore scheduling framework (20 minutes and 21 seconds)

• Chapter 91：Real-time scheduling and multi-processor scheduling (10 minutes and 37 seconds)

• Chapter 92：priority inversion (6 minutes and 42 seconds)

• Chapter 93：General introduction and scheduling process (10 minutes and 48 seconds)

• Chapter 94：Scheduling algorithm support framework (8 minutes and 41 seconds)

• Chapter 95：time slice round robin scheduling algorithm (5 minutes and 51 seconds)

• Chapter 96：Stride scheduling algorithm (11 minutes and 45 seconds)

• Chapter 97：background (12 minutes and 18 seconds)

• Chapter 98：Real life synchronization issues (13 minutes and 37 seconds)

• Chapter 99：Critical sections and disabling hardware interrupt synchronization methods (15 minutes and 54 seconds)

• Chapter 100：Software-based synchronization method (9 minutes and 33 seconds)

• Chapter 101：High-level abstract synchronization methods (13 minutes and 9 seconds)

• Chapter 102：signal (12 minutes and 51 seconds)

• Chapter 103：Semaphore usage (19 minutes and 44 seconds)

• Chapter 104：management (6 minutes and 48 seconds)

• Chapter 105：dining philosopher problem (12 minutes and 31 seconds)

• Chapter 106：reader-writer problem (11 minutes and 31 seconds)

• Chapter 107：General introduction (4 minutes and 49 seconds)

• Chapter 108：Bottom support (9 minutes and 4 seconds)

• Chapter 109：Semaphore design and implementation (9 minutes and 10 seconds)

• Chapter 110：Design and implementation of monitors and condition variables (24 minutes and 39 seconds)

• Chapter 111：dining philosopher problem (4 minutes and 37 seconds)

• Chapter 112：deadlock concept (11 minutes and 17 seconds)

• Chapter 113：Deadlock handling method (13 minutes and 4 seconds)

• Chapter 114：banker's algorithm (10 minutes and 30 seconds)

• Chapter 115：Deadlock detection (9 minutes and 36 seconds)

• Chapter 116：Process communication concept (8 minutes and 32 seconds)

• Chapter 117：signals and pipes (8 minutes and 34 seconds)

• Chapter 118：Message queue and shared memory (7 minutes and 10 seconds)

• Chapter 119：File systems and files (6 minutes and 48 seconds)

• Chapter 120：file descriptor (13 minutes and 31 seconds)

• Chapter 121：Directories, file aliases, and file system types (14 minutes and 12 seconds)

• Chapter 122：virtual file system (6 minutes and 23 seconds)

• Chapter 123：File caching and opening files (10 minutes and 1 seconds)

• Chapter 124：file allocation (14 minutes and 57 seconds)

• Chapter 125：Free space management and redundant disk array RAID (14 minutes and 43 seconds)

• Chapter 126：General introduction (11 minutes and 16 seconds)

• Chapter 127：ucore file system architecture (9 minutes and 10 seconds)

• Chapter 128：Simple File System analysis (8 minutes and 58 seconds)

• Chapter 129：Virtual File System analysis (6 minutes and 13 seconds)

• Chapter 130：IO device interface analysis (5 minutes and 51 seconds)

• Chapter 131：Perform process analysis (7 minutes and 44 seconds)

• Chapter 132：IO features (9 minutes and 2 seconds)

• Chapter 133：IO structure (8 minutes and 22 seconds)

• Chapter 134：IO data transfer (8 minutes and 5 seconds)

• Chapter 135：disk scheduling (13 minutes and 35 seconds)

• Chapter 136：disk cache (8 minutes and 37 seconds)