Processor scheduling method and system

Abstract

The invention is applicable to the technical field of communications, and provides a processor scheduling method and system. The method comprises the steps of receiving a thread priority or time slice modification instruction; modifying the priority or time slice of a thread and acquiring a thread with the highest priority in the ready state; and when a thread under a running state currently exits a kernel exclusive area, executing the thread with the highest priority in the ready state in a processor according to the length of the time slice. The processor scheduling method provided by the invention combines a priority enforcement mechanism and a round-robin mechanism; a priority preemption mechanism is adopted between threads of different priorities, and the round-robin mechanism is adopted between threads of the same priority; since a scheduling mechanism is based on threads, switching between threads consumes a very small amount of resources, therefore, the switching efficiency of occupying a CPU between threads of different priorities and the same priority is improved, the fairness of occupying processor resources between the threads is considered, and the system real-time performance is high.

Description

technical field [0001] The present invention relates to the technical field of communications, in particular to a processor scheduling method and system. Background technique [0002] The dual-system smart terminal can run two independent systems (such as security system and standard system) at the same time, and the applications of the two systems are also independent. These two systems both run on the virtual layer, and when the virtual layer performs processor scheduling, the processor scheduling algorithm adopted is a scheduling algorithm based on process priority. There are three states in the life cycle of a process: ready, executing, and blocked. The switching between these three states is controlled by the process scheduler. A process is usually defined as an instance of a running program, which is the unit of resource allocation. A process can support multiple threads, and multiple threads in a process share the same memory address space. [0003] Because the exis...

AI Technical Summary

Problems solved by technology

[0003] Because the existing dual-system intelligent terminal is based on the scheduling algorithm of process priority, and the switching between processes will consume more resources, so if the switching between processes is frequent, the efficiency will be relatively poor, and the utilization rate of processor resources will not be very high.

And when the highest priority task is running, it will continue to occupy the CPU until it ends or blocks, otherwise other tasks will not get the chance to run, so the real-time performance of the system will be relatively poor

[0004] In summary, there are obviously inconveniences and defects in the actual use of the existing technology, so it is necessary to improve

Images