Write in front
Author: Summer
Blog address: https://blog.csdn.net/zss192
For detailed knowledge points and exercises of operating system, please see my blog: Operating system final summary
Chapter One
1.1 Concept and function of operating system
1.2 Features of the operating system
1.3 Development and classification of operating systems
1.4 Operating mechanism of the operating system
1.5 Interrupts and exceptions
1.6 system calls
1.7 The architecture of the operating system
Chapter two
2.1.1. Concept, composition and characteristics of the process
2.1.2. Process state and transition, process organization
2.1.3. Process control
2.1.4. Process communication
2.1.5. The concept and characteristics of threads
2.1.6. Thread implementation and multi-thread model
2.2.1. The concept and level of scheduling
2.2.2. Timing, switching, process and method of process scheduling
2.2.3. Evaluation index of scheduling algorithm
2.2.4. Scheduling algorithm: first come first serve, shortest job first, highest response ratio first
2.2.5. Scheduling algorithm: time slice rotation, priority, multi-level feedback queue
2.3.1. What is process synchronization and process mutual exclusion
2.3.2. The software implementation method of process mutual exclusion
2.3.3. Hardware implementation method of mutual exclusion of processes
2.3.4. Semaphore mechanism
[External link image transfer failed. The source site may have an anti-leech link mechanism. It is recommended to save the image and upload it directly (img-t9Ni1JEP-1610159120185)(https://cdn.jsdelivr.net/gh/zss192/Typora-notes@master /images/image-20201130160348927.png)]
2.3.5. Use semaphores to achieve mutual exclusion, synchronization, and predecessor relationships between processes
2.3.6. Producer-consumer problem
2.3.7. Multiple producers-multiple consumers
2.3.8. Smoker problem
2.3.9. Reader-writer problem
2.3.10. The philosopher's meal problem
2.3.11. Management
2.4.1. The concept of deadlock
2.4.2. Deadlock processing strategy-to prevent deadlock
2.4.3. Deadlock processing strategy-avoid deadlock
2.4.4. Deadlock processing strategy-deadlock detection and removal
third chapter
3.1_1_Basic knowledge of memory
3.1_2_The concept of memory management
3.1_3_ Coverage and exchange
3.1_4_Continuous distribution management method
3.1_5_ dynamic partition allocation algorithm
3.1_6_ Basic concepts of basic paging storage management
[External link image transfer failed. The source site may have an anti-leech link mechanism. It is recommended to save the image and upload it directly (img-hpVgwOXl-1610159120195)(https://cdn.jsdelivr.net/gh/zss192/Typora-notes@master /images/image-20201223185108844.png)]
3.1_7_Basic address conversion mechanism
3.1_8_Address conversion mechanism with fast table
3.1_9_ Two-level page table
3.1_10_Basic segmented storage management method
3.1_11_ Segment page management
3.2_1_The basic concept of virtual memory
3.2_2_Request paging management mode
3.2_3_Page replacement algorithm
3.2_4_Page allocation strategy
Chapter Four
4.1_1_First-time document management
4.1_2_ The logical structure of the file
4.1_3_File directory
4.1_4+4.1_5_ The physical structure of the file
4.1_6_Logical structure VS physical structure
4.1_7_ Basic operation of files
4.1_8_File storage space management
4.1_9_File sharing
4.1_10_File protection
4.1_11_ The hierarchy of the file system
4.2_1_ Disk structure
4.2_2_Disk scheduling algorithm
4.2_3_ Methods to reduce disk latency
4.2_4_ Disk management
chapter Five
5.1_1_Basic concepts and classification of IO devices
5.1_2_IO controller
5.1_3_IO control mode
5.1_4_IO software hierarchy
5.1_5_IO core subsystem
5.1_6_ Spooling technology
5.1_7_ Equipment allocation and recycling
5.1_8_Buffer management
