Operating System Review

Chapter 1 Introduction to Operating Systems

Definition: Manage system resources, control program execution, improve human-computer interface, provide various services, and rationally organize computer workflow And a system software that provides a good operating environment for users to use computers conveniently and effectively.
Functions: Processor management, storage management, device management, file management, networking and communication management
Features: Concurrency, sharing (1. Transparent resource sharing 2. Exclusive resource sharing), asynchrony
Category: batch operating system, time-sharing operating system, real-time operating system

Chapter 2 Processor Management

Process Definition: A process is a program with independent functions on a certain data collection A running activity is also the basic unit for resource allocation and protection by the operating system.
Process status and transition: p73
Three-state model: running state, ready state, waiting state
Five-state model: new state, terminated state What is the reason for the proposal?
Requires the ability to draw pictures to explain that certain transformations do not exist.

The motivation for introducing multi-threading: reducing the time and space overhead incurred when programs are executed concurrently, making concurrency granularity finer and concurrency better.
Advantages of threads: fast thread switching, easy communication, reduced management overhead, and improved concurrency

PCB (Process Control Block) process control block: the unique identifier of the existence of a process, which is used by the operating system to record It is the collection of dynamic characteristics of the process and the data structure that describes the process status and environmental information. It is also the only data structure for the operating system to control the process and the main basis for managing the process. p75

What is the concept of TCB?
Dynamic/static priority?

Processor Scheduling: p101 Example

1. First come, first served algorithm

2. Shortest job first algorithm (concept)

3. Shortest remaining time priority algorithm

4. Highest response ratio priority algorithm (concept)

Chapter 3 Synchronization, communication and deadlock

Bernstein conditions? Bernstein (short answer)

Deadlock: A group of processes is stuck in a state of waiting forever due to competition for resources.
Hunger: A runnable process is delayed indefinitely by the scheduler and cannot be executed because other processes always take precedence over it.

Process synchronization: Concurrent processes to complete a common task coordinate their activities based on a certain condition, because the coordination constraints caused by waiting for and transmitting signals or messages need to be arranged in the order of execution at certain locations. relation.

Critical section: Program segment related to shared variables in concurrent processes.
Critical resources: The resources represented by shared variables, that is, resources that can only be used by one process at a time.
Three principles of critical section scheduling (mutually exclusive use, let in when free; wait if busy, limited wait; choose one to enter, the algorithm is feasible.):

1. At most one process can enter the critical section for execution at a time.

2. If there is already a process in the critical section, other processes trying to enter this critical section should wait.

3. The process entering the critical section should exit within a limited time to allow a process in the waiting queue to enter.

Software algorithm for critical section management:
Analysis

1. Will there be any problems?

2. When will it be released?

Hardware facilities for critical section management:

1. Turn off interrupts

2. Test and set instructions

3. Swap instructions

Semaphore and PV operation: p134

pv operation definition (one yuan, general)?
Comprehensive question:

1. The 5 philosophers dining problem (no deadlock solution) p139

2. Producer-consumer problem ( Many-to-many, many buffers) p140

3. Reader-writer problem p141

4. Barber problem p142

5. Monk Fetching Water

Deadlock

Definition: If each process in a process set is waiting, it can only wait for other processes in the set. The process can only cause events, and it will be stuck in a stalemate indefinitely.
Generated conditions:

1. Mutually exclusive conditions

2. Possession and waiting conditions

3. No deprivation condition

4. Loop waiting condition

Deadlock avoidance: Comprehensive question 15 points
Banker’s algorithmData structure p163
Algorithm description:

1. Safety sequence at time T0

2. Process P1 requests resources (can it be satisfied? Why? )

Chapter 4 Storage Management

Program link type: (fill in the blank)

1. Static link

2. Dynamic link

3. Runtime link

Static address relocation: The loader implements the loading and address conversion of the loading code, loads it into the designated area of ​​memory allocated to the process, and all logical addresses in it are modified into a memory physical address.
Dynamic address relocation: The loader implements the loading of the loading code module and loads it into the designated area of ​​​​the memory allocated to the process, but the logical address of the application processed by the linker is not When any modification is made, the starting address of the program memory is placed into the hardware special register - the relocation register. During program execution, whenever the CPU refers to a memory address (accessing programs and data), the hardware intercepts this logical address and adds the value of the relocation register before it is sent to the memory in order to achieve address translation.

Paging storage management p206
Concept:

1. Page

2. Page frame

3. Logical address

4. Memory page frame table

5. Page table

Paging／ What is the implementation principle of segmented dynamic link library? (Explanation + Drawing)

Comprehensive question:

1. Given the logical address, find the physical address? (Draw)

2. Given the logical address and page size, calculate the physical address?

Comparison of segmentation and paging (short answer):
Segmentation is a logical unit of information, determined by the logical structure and meaning of the source program , visible to the user, the segment length is determined by the user according to needs, and the segment start address can start from any memory address. In the segmented method, the source program (short number, intra-segment displacement) still maintains a two-dimensional (address) structure after being linked and assembled. The purpose of introduction is to meet the needs of users for modular programming.
Paging is a physical unit of information. It has nothing to do with the logical structure of the source program and is invisible to the user. The page length is determined by the system (hardware). The page can only start from an integer multiple of the page size. In the paging mode, the source program (page number, intra-page displacement) becomes a one-dimensional (address) structure after link assembly. The purpose of introduction is to achieve discrete allocation and improve memory utilization.

Page fault interruption rate p223
Concept: Number of unsuccessful accesses?
Draw a picture, find the page missing interruption rate? p229

Chapter 5 Device Management

I/O control method: (fill in the blank)

1. Polling method

2. Interrupt mode

3. DMA mode

4. Channel mode

Buffer technology:
Single buffering p265
Double buffering p266

Search positioning: (example questions, short answers) p270

• First come, first served algorithm

• Shortest search time first algorithm

• Scan algorithm

• Elevator scheduling algorithm

• Cycle Scan Algorithm

Reference bibliography:

-"Operating System Tutorial (Fifth Edition)" by Fei Xianglin and Luo Bin Higher Education Press

The above is the detailed content of Summary of operating system skills. For more information, please follow other related articles on the PHP Chinese website!