CN113434291A

CN113434291A - Real-time scheduling optimization method based on channel

Info

Publication number: CN113434291A
Application number: CN202110710874.6A
Authority: CN
Inventors: 洪薇; 洪健; 李京昆; 刘文思
Original assignee: Hubei Yangzhong Jushi Information Technology Co ltd
Current assignee: Hubei Yangzhong Jushi Information Technology Co ltd
Priority date: 2021-06-25
Filing date: 2021-06-25
Publication date: 2021-09-24

Abstract

The invention discloses a real-time scheduling optimization method based on a channel, which relates to the technical field of information scheduling and comprises the following steps: s1: and starting a scheduling system and adding a plurality of tasks to be scheduled. The invention adjusts the system task scheduling sequence in real time according to the execution time of various tasks, and finally the task which is executed faster in the scheduling process can be floated at the top of the channel and the task which is executed slower is settled at the bottom of the channel after the scheduling system starts to run, so that each round of tasks can lead most tasks to be executed successfully and return results as much as possible, thereby avoiding that the task with long part of execution time prolongs the execution time of each round of tasks, reducing the time of the scheduling system for executing the task round integrally, and successfully solving the problem that the scheduling system can lead the execution time of the whole task to be prolonged because the execution time of part of tasks is long.

Description

Real-time scheduling optimization method based on channel

Technical Field

The invention relates to an information scheduling method, in particular to a real-time scheduling optimization method based on a channel.

Background

At present, various data processing tasks in the information age have extremely high processing response capability and have extremely large data volume, but in the current traditional task scheduling system, the tasks need to be orderly and circularly scheduled, and each scheduling task is responded and executed according to a preset rule as soon as possible, the traditional task scheduling system traditionally sequences and executes the tasks one by one, and simultaneously schedules each round of tasks by utilizing a circular queue, when the scheduling system finishes the completion, the sequence of the tasks is immediately determined, in the whole scheduling process of the system, the execution sequence of the tasks does not change, namely, after the task with a smaller sequence number is executed in the scheduling process of each round of tasks, the task with a larger sequence number is executed, and the channel is a data type (chan) in Go language, and can be used in Gogouutine (coroutine, also called micro-thread, a more flexible concurrency program component) that are typically viewed as pipes for the communication by the gorutines, such communication between the gorutines does not require any explicit locking, the locks being managed internally by the channels themselves. The channel and the goroutine enable the go programming language to be concurrent, and the channel has the advantages that by providing atomic communication primitives, a complex locking mechanism under race conditions (race conditions) is avoided,

however, the prior art has a problem that, when there are a plurality of tasks with the same response level to be scheduled, if the processing time of part of tasks is long, the processing according to the traditional circular queue processing mode can prolong the running time of the whole task turn, the conventional mode has the defects that in each task scheduling, tasks with long execution time need to be waited for to be completed so as to continue to execute the following tasks, even if the later task is executed very fast, the task needs to wait for the previous task to be executed completely, so that the whole round time of the task is prolonged, and therefore in the process of task scheduling, the task scheduling and processing as fast as possible becomes a problem to be paid attention, and a simple and feasible method with high stability and no task omission or task repeated processing in each task processing is needed to process.

Disclosure of Invention

The invention aims to provide a real-time scheduling optimization method based on a channel, which aims to solve the problems that when the existing scheduling method proposed in the background art schedules a plurality of levels of same task responses, the processing time of part of tasks is longer and the running time of the whole task round is prolonged.

In order to achieve the purpose, the invention provides the following technical scheme: a method for channel-based real-time scheduling optimization, comprising the steps of:

s1: and starting a scheduling system and adding a plurality of tasks to be scheduled.

S2: a channel with a buffer size equal to the total number of tasks is established.

S3: on the basis of step S2, the tasks to be scheduled are put into the channel one by one.

S4: on the basis of step S3, the scheduling system concurrently reads the tasks in the channels and starts executing the tasks according to the task contents.

S5: on the basis of step S4, immediately after the execution of each task is completed, the task is replaced back to the channel established at S2, and the replacement operation is the same as the placement operation at S3.

S6: on the basis of step S5, the processes of S4 and S5 are repeated.

As a preferred embodiment of the present invention, the task traversal scheduled in S2 is independent of the sequence.

As a preferred embodiment of the present invention, in S4, only scheduling limitation of tasks is performed.

As a preferred embodiment of the present invention, the number of channels of the total number of tasks in S2 is the same as the number of tasks scheduled in S1.

As a preferred embodiment of the present invention, the replacing operation of S5 for replacing the task to S2 is the same as the placing operation of S3.

Compared with the prior art, the invention has the beneficial effects that:

the invention adjusts the system task scheduling sequence in real time according to the execution time of various tasks, and finally floats the task which is executed faster in the scheduling process at the top of the channel and sinks the task which is executed slower at the bottom of the channel after the scheduling system starts to run, so that each round of tasks can lead most of tasks to be executed successfully and return results as much as possible, thereby avoiding that the task which is long in part of execution time drags the execution time of each round of tasks, reducing the time of the scheduling system for executing the whole task round, successfully solving the problem that the execution time of the whole task is draged because the execution time of part of tasks is long in the scheduling system, namely, the task which is processed faster is executed as early as possible, the task which is processed slower is put at the last to be executed so as to reduce the time required by the whole task round, and improving the response speed of task execution, thereby solving the problem that when the existing scheduling method schedules a plurality of tasks with the same level, there are problems that the processing time of part of tasks is long and the running time of the whole task turn is prolonged.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

The invention provides a technical scheme for a real-time scheduling optimization method based on a channel, which comprises the following steps:

S6: on the basis of step S5, the processes of S4 and S5 are repeated, in order to realize that, in each task processing round, the fastest tasks processed in the previous round are always processed first, and the tasks with the slowest processing speed in the previous round are put back to the channel last and are executed latest in the next round, the task traversal scheduled in S2 is not related to the sequence, only the scheduling limitation of the tasks is performed in S4, the number of channels of the total number of tasks in S2 is the same as the number of tasks scheduled in S1, and the put-back operation of S5 for putting back the tasks in S2 is the same as the put-in operation of S3.

When the method is used, firstly, a scheduling system is started, a plurality of tasks to be scheduled are added, then a channel with the buffer size of the total number of the tasks is established, the tasks to be scheduled are placed into the channel one by one in the established channel with the buffer size of the total number of the tasks in a traversing mode, then the scheduling system is enabled to read the tasks in the channel concurrently, the tasks are executed according to the task content, after the execution of each task is completed, the tasks are immediately placed back into the channel with the buffer size of the total number of the tasks, and the purpose of quickly executing the tasks can be achieved by repeating the operation for a plurality of times in the using process.

In the present invention, unless otherwise explicitly specified or limited, for example, it may be fixedly attached, detachably attached, or integrated; can be mechanically or electrically connected; the terms may be directly connected or indirectly connected through an intermediate, and may be communication between two elements or interaction relationship between two elements, unless otherwise specifically limited, and the specific meaning of the terms in the present invention will be understood by those skilled in the art according to specific situations.

Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.

Claims

1. A method for channel-based real-time scheduling optimization, comprising: the method comprises the following steps:

s1: starting a scheduling system, and adding a plurality of tasks to be scheduled;

s2: establishing a channel with the buffering size of the total number of tasks;

s3: on the basis of the step S2, traversing the tasks to be scheduled one by one and putting the tasks into a channel;

s4: on the basis of the step S3, the scheduling system concurrently reads the tasks in the channels and starts to execute the tasks according to the task content;

s5: on the basis of step S4, immediately after the execution of each task is completed, the task is replaced to the channel established at S2;

s6: on the basis of step S5, the processes of S4 and S5 are repeated.

2. A method for channel-based real-time scheduling optimization according to claim 1, characterized in that: the task traversal scheduled in S2 is order independent.

3. A method for channel-based real-time scheduling optimization according to claim 1, characterized in that: in S4, only the scheduling definition of the task is performed.

4. A method for channel-based real-time scheduling optimization according to claim 1, characterized in that: the number of channels of the total number of tasks in S2 is the same as the number of tasks scheduled in S1.

5. A method for channel-based real-time scheduling optimization according to claim 1, characterized in that: the put back operation of the S5 put back task S2 is the same as the put operation of S3.