Binance market

List of contents of this article:

• 1,Binance market< A href='#Operating System-Process Management Exercises' title='Operating System-Process Management Exercises'>Operating System-Process Management Exercises
• 2, Find the answer to this operating system scheduling algorithm question.
• 3, Self-examination "Operating System" Q&A Summary

Operating System-Process Management Exercises

1. First of all, it's my honor to help you! Let's not talk nonsense. Let's start. This is a very classic example of process management in the Principles of the Operating System. We know that CPU and I/O devices can work "in parallel".For this question, this parallelism is strictly parallel, not concurrency.

2. System service) explorer.exe Explorer internat.exe Pinyin icon in the tray area Additional system processes (these processes are not necessary, you can increase or decrease them as needed through the service manager): mst Ask.exe allows the program to run at the specified time.

3. The reference answer of the exercise question of "Computer Operating System" is compiled by Yu Youming and the students of Ji 07 and Ji G09 5/48 needs and load adjustment needs. The process in the pending state cannot receive the processor scheduling.

4. The device number of the input and output device, the data length to be transmitted, the buffer address, the buffer length and the relevant data structure pointer of the device used, etc.Pointers to the file system and related logos, etc. The process can use this information to operate the file system.

Find the answer to this operating system scheduling algorithm question.

First-come, first-served scheduling algorithm. Since the algorithm is to access the magnetic track in order of the magnetic track request sequence, the access sequence (service order) of the magnetic track is: 1180, 3111160, 70. At present, the magnetic head is in the No. 50 magnetic track.

First, start the A process with an arrival time of 0, the second time slice, or A, the third start the B process, the fourth, return to A, the fifth start C.

The main purpose of introducing intermediate scheduling isIn order to improve the utilization rate of memory and system throughput, the temporarily non-running processes are changed from memory pairs to external memory. Low-level scheduling, also known as process scheduling, its main function is to assign the cpu to a process in the ready queue according to a certain algorithm.

It enables the system to multitask in a limited physical memory environment. One. Ideal Page Replacement Algorithm (OPT): This is an ideal algorithm that cannot be implemented in practice.

In the Windows operating system, the main process scheduling algorithm is the priority scheduling algorithm. Priority scheduling algorithm is an algorithm that schedules according to the priority of the process. In the Windows system, each process will be assigned a priority, and the high-priority process will give priority to the execution of the CPU.

Self-examination "Operating System" Q&A summary

When applying for equipment in the process, you should Specify the category of the required device instead of specifying a specific device. The system selects an idle device from the corresponding category of device according to the current request and device allocation and assigns it to the application process, which is called the independence of the device.

Advantages and disadvantages of dedicated and non-dedicated cables. Dedicated cable: a bus that only connects a pair of physical components. Advantages: No need to compete for the bus, simple control, and reliable system. Disadvantages: the number of buses is large and long, the cost is high, the utilization rate is low, and it is not easy to expand.

Homework: We call a problem that the user requires the computer system to handle as a "homework". Homework steps: each step to complete the homework is called "homework step".

If there is no free block in the main memory when the page is loaded, the operating system will select the appropriate page according to a certain "page scheduling" algorithm to call up the main memory to replace the required page.

Interrupt response (hardware, that is, interrupt device operation) After the processor executes an instruction, the interrupt position of the hardware immediately checks whether an interrupt event has occurred. If there isWhen an interrupt event occurs, the execution of the current process is suspended and the interrupt handler of the operating system occupies the processor. This process is called "interrupt response".