Method for realizing process priority scheduling for embedded SRAM operating system

Abstract

The present invention relates to embedded system process scheduling field for providing an embedded type SRAM operation system process priority scheduling implementation method. Said method includes recording state of a process, dividing process priority, progress select, processor distribution and retrieve processor. Said method easy realizes, is in favor of respectively processing to different progress, at the same time said method has high response speed process scheduling to SRAM when progress has higher cpu use rate.

Description

technical field [0001] The invention relates to the field of embedded system process scheduling, in particular to an implementation method for embedded SRAM operating system process priority scheduling. Background technique [0002] In a computer system, there may be hundreds of batch jobs stored in the job queue of the disk at the same time, or there may be hundreds of terminals connected to the host. How to select jobs from these jobs to run in main memory and how to allocate processor time among processes is undoubtedly an important issue in operating system resource management. This problem involving processor allocation is called processor scheduling. [0003] We often encounter situations where two or more processes can logically both run. When multiple processes are ready, the operating system must decide which one to run first. The part of the operating system that makes this decision is called the Scheduler. [0004] The scheduling algorithm in the days of early...

AI Technical Summary

Problems solved by technology

On the other hand, allowing a process to run as long as it wants means that a process that calculates a billion decimal places of pi will keep other processes forever unserved

[0014] So although non-deprivational scheduling is simple and easy to implement, it is usually not suitable for general-purpose systems with many competing users

Images