Heterogeneous multi-core system-oriented process scheduling method

Abstract

The invention discloses a process scheduling method for heterogeneous multi-core system. The method is implemented in the way that all the processes share the same queue for ready processes. Each process has a flag to indicate that the process is running in the main core or assistant core. The operating system in the method uses client-management structure. The core of the operating system runs in the main process, other processes deal with a variety of applications that only can run on it. When applications request the operating system services, the request would be passed on to the procedure on the main operating system. The process scheduler uses a split load scheduling algorithm and the processor allocation algorithm to achieving a reasonable process scheduling.

Description

technical field

[0001] The invention relates to the field of computer operating systems, in particular to a process scheduling method for heterogeneous multi-core systems. Background technique

[0002] In an operating system, process scheduling is responsible for dynamically assigning processors to processes. Therefore, it is also called processor scheduling or low-level scheduling. The program that implements process scheduling in the operating system is called the process scheduler, or dispatcher.

[0003] There are many processor scheduling strategies; the following are introduced here:

[0004] 1. First come first serve algorithm

[0005] The first-come-first-serve algorithm allocates processors according to the order in which processes enter the ready queue. The process that enters the ready queue first is selected first. Once the running process occupies the processor, it will continue to run until the end of the run or block. This algorithm is easy to implement, ...

Images