CN102693156A - Process scheduling method based on configurable strategy - Google Patents

Abstract

The present invention proposes a process scheduling method based on configurable policies, which includes the following steps: the first step is to read the policy file when the system is initialized, and the high-occupancy level process and the low-occupancy level process are recorded in the policy file; The second step is to schedule high-occupancy processes in the order recorded in the policy file; the third step is to schedule ordinary processes; the fourth step is to schedule low-occupancy processes in the order recorded in the policy file; the fifth step is to schedule idle processes; Six steps, after the time slice of the current process is exhausted or actively suspended, return to the second step. The process scheduling method based on configurable policies of the present invention sets processes to different occupancy levels through policy files, provides more flexible process scheduling configurations for computer systems with different hardware environments and targets, and can improve user response time and network throughput, etc. index.

Description

A Process Scheduling Method Based on Configurable Policy

technical field

The invention relates to the field of computer science and technology, in particular to a process scheduling method based on a configurable strategy.

Background technique

Processor time resources are important resources in computer systems, and process scheduling is the process of allocating processor time resources. The relevant methods and researches on process scheduling have a history of many years, and among them, the time-sharing scheduling method that is currently commonly used has been used and continuously improved for more than 30 years. The multi-core processor technology that has appeared in recent years has brought new problems to process scheduling, and various improved algorithms have also appeared, but their basic principles have not changed.

The traditional process scheduling method takes fairness as the starting point, and adjusts the proportion of processor time occupied by processes by adjusting the priority of the process. The data transfer relationship between each process is ignored, and the processor time is only allocated according to the priority. Although this method can adapt to most situations in different environments, there are usually extreme situations. For example, the Windows operating system uses a priority-based round-robin scheduling method, and the task manager provides users with the function of ending an unresponsive process in an abnormal situation. This abnormal situation is usually that the unresponsive process falls into an endless loop and no longer responds to user input. At this time, the unresponsive process will occupy a large amount of processor resources. In order to enable the task manager to respond to the user's end process request quickly, the Windows operating system will set the priority of the task manager process to "high". , when the unresponsive process occupies a large amount of memory and other resources, it will still cause the task manager to respond slowly, and it is even difficult to activate it through the shortcut keys Ctrl+Alt+Del.

In a computer system, making high-priority processes absolutely prioritized may cause unfair phenomena such as starvation, but for service processes, it is necessary to set an absolute priority mechanism to improve user response time and other indicators. Therefore, how to more flexibly configure process scheduling, improve user response time, and improve network throughput is an important issue.

Contents of the invention

The present invention aims at at least solving the technical problems existing in the prior art, and particularly innovatively proposes a process scheduling method based on configurable policies.

In order to achieve the above object of the present invention, the present invention provides a process scheduling method based on configurable policies, which includes the following steps:

S1: read the policy file when the system is initialized, and the high-occupancy level process and the low-occupancy level process are recorded in the policy file;

S2: Scheduling high-occupancy-level processes according to the order recorded in the policy file;

S3: Scheduling ordinary processes;

S4: Scheduling low-occupancy-level processes according to the order recorded in the policy file;

S5: Scheduling idle processes;

S6: After the time slice of the current process is exhausted or actively suspended, return to step S2.

The process scheduling method based on configurable policies of the present invention sets processes to different occupancy levels through policy files, provides more flexible process scheduling configurations for computer systems with different hardware environments and targets, and can improve user response time and network throughput, etc. index.

Additional aspects and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.

Description of drawings

The above and/or additional aspects and advantages of the present invention will become apparent and comprehensible from the description of the embodiments in conjunction with the following drawings, wherein:

Fig. 1 is a flow chart of the process scheduling method based on configurable strategies of the present invention;

Fig. 2 is the policy file content of the first preferred embodiment of the process scheduling method based on configurable policies in the present invention;

Fig. 3 is the content of the policy file of the second preferred embodiment of the process scheduling method based on the configurable policy of the present invention;

Fig. 4 is the policy file content of the third preferred embodiment of the configurable policy-based process scheduling method of the present invention.

Detailed ways

Embodiments of the present invention are described in detail below, examples of which are shown in the drawings, wherein the same or similar reference numerals designate the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the figures are exemplary only for explaining the present invention and should not be construed as limiting the present invention.

In describing the present invention, it should be understood that the terms "longitudinal", "transverse", "upper", "lower", "front", "rear", "left", "right", "vertical", The orientation or positional relationship indicated by "horizontal", "top", "bottom", "inner", "outer", etc. are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than Nothing indicating or implying that a referenced device or element must have a particular orientation, be constructed, and operate in a particular orientation should therefore not be construed as limiting the invention.

The present invention provides a process scheduling method based on a configurable strategy, as shown in Figure 1, the process scheduling method includes the following steps:

S1: read the policy file when the system is initialized, and the high-occupancy level process and the low-occupancy level process are recorded in the policy file;

S2: Scheduling high-occupancy-level processes according to the order recorded in the policy file;

S3: Scheduling ordinary processes;

S4: Scheduling low-occupancy-level processes according to the order recorded in the policy file;

S5: Scheduling idle processes;

S6: After the time slice of the current process is exhausted or actively suspended, return to step S2.

In the present invention, the content of the policy file is customized according to different target environments. In this embodiment, step S2 or step S4 can be omitted by changing the content of the policy file. In another embodiment of the present invention, if the policy file is empty, the process scheduling method degenerates into a traditional process scheduling method.

In this embodiment, a round-robin algorithm is used to schedule processes in steps S2 to S5. In the process of scheduling high-occupancy-level processes and low-occupancy-level processes, processes of the same occupancy level are sorted through policy files. In a preferred embodiment of the present invention, the processes of the same occupation level are sorted through the parameters specified in the policy file, and this parameter can be a time parameter. In another preferred embodiment of the present invention, the processes of the same occupation level Sort by earliest end time first algorithm.

Fig. 2 is the content of the policy file of the first preferred embodiment of the process scheduling method based on configurable policies in the present invention. This embodiment is a process scheduling method under the desktop system environment. For the desktop system environment, the user response time index is more valued. That is, user actions should be responded to as soon as possible. In the desktop system, there is a window management process gui.exe, and user operations are judged through this process first, and forwarded to the processes to which different windows belong for processing. To improve user response time, the window management process should be scheduled as quickly as possible. In addition, the user requirements of the desktop system believe that frequent network operations will prolong user response time, and design a network packet management process net_admin.exe for this purpose, hoping that the process will only process network data when it is idle. To achieve this goal, the policy file can be configured as shown in Figure 2. Among them, the content after the symbol "#" is just a comment and will not have any impact on process scheduling. In the policy file, each line represents an occupancy level, which is divided into high occupancy level and low occupancy level, distinguished by <high> and <low> respectively. The second part in the angle brackets is the scheduling algorithm of this level. In this embodiment, the round-robin algorithm is used, which is represented by RR, that is, the first process of this level is scheduled when it is scheduled to this level for the first time, and the second process is scheduled. The second one, when the number of processes exceeds this level, it will cycle to the first one, and so on. According to the policy configured in Figure 2, set the process gui.exe as a high-occupancy process, and set the process net_admin.exe as a low-occupancy process. The scheduling algorithm will first check whether the process gui.exe is schedulable, and if it is schedulable, schedule the process gui.exe; otherwise, schedule other ordinary processes according to the normal algorithm; if there are no other ordinary processes to be scheduled, check whether the process net_admin.exe is schedulable, and if it is schedulable, schedule the process net_admin.exe; otherwise, scheduling idle processes takes up processor time piece.

Fig. 3 is the content of the policy file of the second preferred embodiment of the process scheduling method based on configurable policies in the present invention. This embodiment is a process scheduling method in the network server environment. For the network server environment, the network throughput index is more important. In the network server system, in order to avoid network attacks to a certain extent, it is hoped that the network data packets can be discriminated and intercepted through the process firewall.exe as soon as possible. At the same time, the administrator hopes to configure and manage the server through the remote access process telnet.exe. The result of this management may have a significant impact on the long-term efficiency of customer network requests, so it is hoped that the remote access can be implemented as soon as possible. To achieve this goal, the policy file can be configured as shown in Figure 3. According to the policy configured in Figure 3, the process firewall.exe and the process telnet.exe are set as high-occupancy processes at the same time, but the level of the process telnet.exe is lower than the level of the process firewall.exe, the scheduling algorithm will first check whether firewall.exe Schedulable, if schedulable, schedule firewall.exe; otherwise, check whether telnet.exe is schedulable, if schedulable, schedule telnet.exe; otherwise, schedule other ordinary processes according to the normal algorithm; if no other ordinary processes need to be scheduled, then schedule Idle processes take processor time slices.

Fig. 4 is the policy file content of the third preferred embodiment of the process scheduling method based on the configurable strategy of the present invention. This embodiment is a process scheduling method under the environment of the automobile control system. The automobile control system is a real-time embedded system, requiring The control operation on the user input completes the corresponding action within a given time. In this control system, it is hoped that the process bumper.exe that controls the airbag is executed first, the process brake.exe that controls the brake and the process turning.exe that control the steering take second place, the process accelerator.exe that controls the accelerator is third, and other processes are normal Execution, wherein braking and steering have the same level, in this embodiment, the earliest end time priority algorithm commonly used in real-time operating systems is used for scheduling.

In this embodiment, the policy file can be configured as shown in FIG. 4 . According to the policy configured in Figure 4, the scheduling algorithm will first check whether the process bumper.exe is schedulable, and if it is schedulable, then schedule the process bumper.exe; otherwise, according to the earliest end time scheduling policy, check the two processes of brake.exe and turning.exe End time, schedule the process with earlier end time; if both processes are unschedulable, check whether the process accelerator.exe is schedulable, if so, schedule the process accelerator.exe; otherwise, schedule other ordinary processes according to the normal algorithm ; If there are no other ordinary processes to be scheduled, scheduling idle processes takes up processor time slices.

The process scheduling method based on configurable policies of the present invention sets processes to different occupancy levels through policy files, provides more flexible process scheduling configurations for computer systems with different hardware environments and targets, and can improve user response time and network throughput. and other indicators.

In the description of this specification, descriptions referring to the terms "one embodiment", "some embodiments", "example", "specific examples", or "some examples" mean that specific features described in connection with the embodiment or example , structure, material or characteristic is included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.

Although the embodiments of the present invention have been shown and described, those skilled in the art can understand that various changes, modifications, substitutions and modifications can be made to these embodiments without departing from the principle and spirit of the present invention. The scope of the invention is defined by the claims and their equivalents.

Claims (5)

1. A process scheduling method based on a configurable policy, characterized in that, comprising the steps: S1: read the policy file when the system is initialized, and the high-occupancy level process and the low-occupancy level process are recorded in the policy file; S2: Scheduling high-occupancy-level processes according to the order recorded in the policy file; S3: Scheduling ordinary processes; S4: Scheduling low-occupancy-level processes according to the order recorded in the policy file; S5: Scheduling idle processes; S6: After the time slice of the current process is exhausted or actively suspended, return to step S2. 2. The process scheduling method based on configurable policies according to claim 1, characterized in that, in the step S2 and step S4, the processes of the same occupancy level are sorted through the policy file. 3. The process scheduling method based on configurable policies according to claim 2, wherein in the policy file, the processes of the same occupancy level are sorted by the earliest end time priority algorithm. 4. The process scheduling method based on configurable policies according to claim 1, characterized in that, in the steps S2 to S5, a polling algorithm is used to schedule the processes. 5. The process scheduling method based on configurable policies according to claim 1, characterized in that, during the process scheduling process, step S2 or step S4 is omitted by changing the content of the policy file.

Images