Operating system (RISC-V)

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.

• Chapter 1：Course Overview (5 minutes and 56 seconds)

• Chapter 2：study schedule (12 minutes and 27 seconds)

• Chapter 3：What is an operating system (15 minutes and 9 seconds)

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

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

• Chapter 6：The evolution of operating systems (9 minutes and 44 seconds)

• Chapter 7：operating system structure (10 minutes and 26 seconds)

• Chapter 8：OS Experiment Overview (14 minutes and 51 seconds)

• Chapter 9：Computer systems from an OS perspective (16 minutes and 0 seconds)

• Chapter 10：RISC-V from an OS perspective (12 minutes and 47 seconds)

• Chapter 11：Rust language and system programming (16 minutes and 9 seconds)

• Chapter 12：RISC-VCPU startup (9 minutes and 8 seconds)

• Chapter 13：RISC-VCPU starts further analysis (15 minutes and 47 seconds)

• Chapter 14：Basic concepts and principles (14 minutes and 2 seconds)

• Chapter 15：Hardware architecture support (10 minutes and 48 seconds)

• Chapter 16：Interrupt handling mechanism – Overview (6 minutes and 3 seconds)

• Chapter 17：Interrupt handling mechanism–Detail-1 (5 minutes and 23 seconds)

• Chapter 18：Interrupt handling mechanism–Detail-2 (9 minutes and 9 seconds)

• Chapter 19：Interrupt handling mechanism–Detail-3 (8 minutes and 6 seconds)

• Chapter 20：Interrupt handling mechanism–Summary (5 minutes and 8 seconds)

• Chapter 21：system call (16 minutes and 43 seconds)

• Chapter 22：Computer Architecture and Memory Hierarchy (13 minutes and 33 seconds)

• Chapter 23：Address space and address generation (14 minutes and 28 seconds)

• Chapter 24：contiguous memory allocation (14 minutes and 37 seconds)

• Chapter 25：Defragmentation (6 minutes and 35 seconds)

• Chapter 26：Buddy system (10 minutes and 45 seconds)

• Chapter 27：SLAB distributor (22 minutes and 20 seconds)

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

• Chapter 29：Segmented storage management (5 minutes and 23 seconds)

• Chapter 30：Page storage management (7 minutes and 51 seconds)

• Chapter 31：Page table overview (8 minutes and 10 seconds)

• Chapter 32：Fast tables and multi-level page tables (6 minutes and 48 seconds)

• Chapter 33：RISC-V page mapping mechanism (15 minutes and 47 seconds)

• Chapter 34：Enable RISC-V page tables (12 minutes and 53 seconds)

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

• Chapter 36：Cover and swap (11 minutes and 37 seconds)

• Chapter 37：locality principle (9 minutes and 22 seconds)

• Chapter 38：Virtual storage concept (5 minutes and 1 seconds)

• Chapter 39：virtual page storage (12 minutes and 52 seconds)

• Chapter 40：Page fault exception (9 minutes and 6 seconds)

• Chapter 41：RISC-V page fault exception (15 minutes and 4 seconds)

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

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

• Chapter 44：Clock replacement algorithm and least common algorithm (20 minutes and 16 seconds)

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

• Chapter 46：Page table self-mapping (21 minutes and 57 seconds)

• Chapter 47：working set replacement algorithm (15 minutes and 28 seconds)

• Chapter 48：Page fault rate replacement algorithm (7 minutes and 45 seconds)

• Chapter 49：Jitter and load control (4 minutes and 27 seconds)

• Chapter 50：Cache-oriented page replacement algorithm-FBR (19 minutes and 16 seconds)

• Chapter 51：Cache-oriented page replacement algorithm-LRU-K2Q (12 minutes and 57 seconds)

• Chapter 52：Cache-oriented page replacement algorithm-LIRS (29 minutes and 22 seconds)

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

• Chapter 54：process control block (5 minutes and 40 seconds)

• Chapter 55：process status (12 minutes and 0 seconds)

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

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

• Chapter 58：The concept of thread (12 minutes and 1 seconds)

• Chapter 59：user thread (4 minutes and 47 seconds)

• Chapter 60：kernel thread (5 minutes and 52 seconds)

• Chapter 61：Process address space and meltdown vulnerabilities (26 minutes and 9 seconds)

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

• Chapter 63：Process creation (23 minutes and 46 seconds)

• Chapter 64：process loading (7 minutes and 43 seconds)

• Chapter 65：Process waiting and exit (11 minutes and 28 seconds)

• Chapter 66：rCore process and thread control (22 minutes and 38 seconds)

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

• Chapter 68：Scheduling criteria (10 minutes and 30 seconds)

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

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

• Chapter 71：Real-time scheduling (10 minutes and 28 seconds)

• Chapter 72：priority inversion (6 minutes and 33 seconds)

• Chapter 73：rCore scheduling framework (14 minutes and 51 seconds)

• Chapter 74：Symmetric multiprocessing and multicore architecture (10 minutes and 51 seconds)

• Chapter 75：Multiprocessor Scheduling Overview (18 minutes and 20 seconds)

• Chapter 76：O(1) scheduling (19 minutes and 45 seconds)

• Chapter 77：CFS scheduling (19 minutes and 53 seconds)

• Chapter 78：BFS scheduling algorithm (17 minutes and 42 seconds)

• Chapter 79：background (12 minutes and 51 seconds)

• Chapter 80：Real life synchronization issues (19 minutes and 35 seconds)

• Chapter 81：Critical sections and disabling hardware interrupt synchronization methods (6 minutes and 39 seconds)

• Chapter 82：Software-based synchronization method (12 minutes and 22 seconds)

• Chapter 83：High-level abstract synchronization methods (11 minutes and 22 seconds)

• Chapter 84：signal (12 minutes and 18 seconds)

• Chapter 85：Semaphore usage (13 minutes and 28 seconds)

• Chapter 86：management (15 minutes and 45 seconds)

• Chapter 87：dining philosopher problem (9 minutes and 24 seconds)

• Chapter 88：reader-writer problem (13 minutes and 0 seconds)

• Chapter 89：Synchronization mechanism in Rust language (20 minutes and 25 seconds)

• Chapter 90：deadlock concept (11 minutes and 20 seconds)

• Chapter 91：Deadlock handling method (12 minutes and 58 seconds)

• Chapter 92：banker's algorithm (10 minutes and 24 seconds)

• Chapter 93：Deadlock detection (9 minutes and 30 seconds)

• Chapter 94：Concurrency error detection (20 minutes and 45 seconds)

• Chapter 95：Process communication concept (8 minutes and 26 seconds)

• Chapter 96：signals and pipes (8 minutes and 27 seconds)

• Chapter 97：Linux signaling mechanism (21 minutes and 36 seconds)

• Chapter 98：Message queue and shared memory (7 minutes and 4 seconds)

• Chapter 99：D-Bus mechanism (15 minutes and 47 seconds)

• Chapter 100：Binder mechanism (25 minutes and 31 seconds)

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

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

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

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

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

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

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

• Chapter 108：FAT file system (17 minutes and 31 seconds)

• Chapter 109：EXT4 File System - History (9 minutes and 46 seconds)

• Chapter 110：EXT4 file system - supports mass storage (7 minutes and 47 seconds)

• Chapter 111：EXT4 file system - supports recovery exceptions (28 minutes and 34 seconds)

• Chapter 112：ZFS file system (30 minutes and 57 seconds)

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

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

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

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

• Chapter 117：LinuxIO subsystem (19 minutes and 58 seconds)

• Chapter 118：Linux kernel error analysis (23 minutes and 49 seconds)

• Chapter 119：Writing operating systems in rust - system programming language rust (42 minutes and 10 seconds)

• Chapter 120：Writing operating systems with rust-rust and operating system development (16 minutes and 53 seconds)

• Chapter 121：Background (31 minutes and 30 seconds)

• Chapter 122：FuturesinRust (18 minutes and 10 seconds)

• Chapter 123：Generatorsandasyncawait (12 minutes and 6 seconds)

• Chapter 124：Self-ReferentialStructs&Pin (13 minutes and 38 seconds)

• Chapter 125：WakerandReactor (21 minutes and 22 seconds)

• Chapter 126：Overview (23 minutes and 6 seconds)

• Chapter 127：HowVMMworks-CPU (25 minutes and 27 seconds)

• Chapter 128：HowVMMworks-memory&IO (15 minutes and 0 seconds)