Task scheduling method and apparatus, electronic device, and readable storage medium

Patent metadata

Field	Value
Publication number	US-2024103907-A1
Application number	US-202118037414-A
Country	US
Kind code	A1
Filing date	Sep 29, 2021
Priority date	Jun 1, 2021
Publication date	Mar 28, 2024
Grant date	—

Abstract

A task scheduling method includes: when a task requirement is obtained, splitting the task requirement to obtain the plurality of subtasks having a constraint relationship; performing execution condition detection on non-candidate subtasks, determining a non-candidate subtask that satisfies an execution condition as a candidate subtask, and putting the candidate subtask into a task queue; performing state detection on a server network composed of edge servers to obtain server state information and communication information; inputting the server state information, the communication information, and queue information corresponding to the task queue into an action value evaluation model to obtain the plurality of evaluated values respectively corresponding to the plurality of scheduling actions; and determining a target scheduling action from the plurality of scheduling actions by using the evaluated values, and scheduling the candidate subtask in the task queue on the basis of the target scheduling action.

First claim

1 . A method for task scheduling, comprising:
splitting a task requirement to obtain a plurality of subtasks with constraint relationships when the task requirement is acquired; performing execution condition detection on a non-candidate subtask, determining the non-candidate subtask that meets execution conditions as a candidate subtask, and placing the candidate subtask into a task queue; performing state detection on a server network composed of edge servers to obtain server state information and communication information; inputting the server state information, the communication information and queue information corresponding to the task queue into an action value evaluation model to obtain a plurality of evaluation values corresponding to a plurality of scheduling actions; and determining a target scheduling action among the plurality of scheduling actions by using the evaluation values, and scheduling the candidate subtask in the task queue based on the target scheduling action; performing the execution condition detection on the non-candidate subtask comprises: judging whether the non-candidate subtask is a requirement starting task; determining that the non-candidate subtask meets the execution condition when the non-candidate subtask is the requirement starting task; judging whether preorder tasks of the non-candidate subtask are all completely executed when the non-candidate subtask is not the requirement starting task; determining that the non-candidate subtask meets the execution condition when the preorder tasks are all completely executed; and determining that the non-candidate subtasks do not meet the execution condition when the preorder tasks are not all completely executed.

2 . (canceled)

3 . The method for task scheduling according to claim 1 , wherein performing the state detection on the server network composed of edge servers to obtain the server state information and the communication information comprises:
performing remaining calculation time detection on the edge servers to obtain the server state information; and performing remaining transmission time detection on network channels in the server network to obtain the communication information.

4 . The method for task scheduling according to claim 1 , wherein a training process of the action value evaluation model comprises:
acquiring a plurality of training data, and inputting the plurality of training data into an initial network to obtain a plurality of training evaluation values corresponding to the training data; determining target training scheduling action by using the training evaluation values, performing task scheduling according to the target training scheduling action, and obtaining a performance parameter corresponding to the respective training data; obtaining a target evaluation value by using the performance parameter, and obtaining a loss value by using the training evaluation values and the target evaluation value; and updating the initial network by using the loss value, and obtaining the action value evaluation model by iterative training.

5 . The method for task scheduling according to claim 4 , wherein acquiring the plurality of training data comprises:
judging whether a number of candidate training data reaches a sampling threshold; generating new candidate training data by using the training data and the performance parameter corresponding to a last training round when the number of candidate training data reaches the sampling threshold, and randomly selecting a sampling threshold number of training data from the candidate training data; determining latest candidate training data from the candidate training data when the number of candidate training data does not reach the sampling threshold, and inputting the latest candidate training data into the initial network to obtain the plurality of training evaluation values corresponding to respective scheduling actions; determining a training scheduling action by using the training evaluation values, and performing the task scheduling based on the training scheduling action; performing state detection on the server network after the task scheduling is carried out, and generating post-scheduling environment information by using obtained post-scheduling state information, post-scheduling communication information and post-scheduling queue information corresponding to the task queue; and obtaining a training performance parameter corresponding to the training scheduling action by using the post-scheduling environmental information, generating the target training data by using the training performance parameter, the post-scheduling environmental information, the training scheduling action and the latest candidate training data, and determining the target training data as the candidate training data.

6 . The method for task scheduling according to claim 5 , wherein obtaining the training performance parameter corresponding to the training scheduling action by using the post-scheduling environmental information comprises:
obtaining a task processing delay by using data processing time and data transmission time of the subtasks to be scheduled involved in the training scheduling action; performing remaining calculation time detection on servers to be scheduled involved in the training scheduling action to obtain the remaining calculation time; adding the task processing delay and the remaining calculation time to obtain task delays corresponding to the servers to be scheduled; and obtaining an average delay by using the task delays, and determining the average delay as the training performance parameter.

7 . The method for task scheduling according to claim 1 , wherein splitting the task requirement to obtain the plurality of subtasks with constraint relationships comprises:
performing subtask detection on the task requirement to obtain the plurality of subtasks; and performing input data and output data detection on the plurality of subtasks to obtain a detection result, and obtaining the constraint relationships among the subtasks based on the detection result.

8 . (canceled)

9 . An electronic device, comprising a memory and a processor, wherein:
the memory is configured for storing a computer program; and the processor is configured for executing the computer program to realize the method for task scheduling according to claim 1 .

10 . A computer-readable storage medium, applied for storing a computer program, wherein the computer program, when executed by a processor, implements the method for task scheduling according to claim 1 .

11 . The method for task scheduling according to claim 1 , wherein the task requirement is a computing task performed by using an edge computing network.

12 . The method for task scheduling according to claim 1 , wherein the task requirement is expressed as:
Req={{SubTask k } k∈K ,{t w } w∈W } wherein Subtask k represents a k-th subtask with a total of K subtasks; t w represents timing constraint and logical sequence constraint between the subtasks; and W represents a set of edges.

13 . The method for task scheduling according to claim 12 , wherein for each subtask,
SubTask i ={{Dt n } n∈N ,{t w } w∈W i ,Proc} wherein Dt n is input data obtained from other edge servers required by the subtask; N is a set of edge servers; Dt n is input data obtained from an n-th edge server; Proc is a request of the subtask for computing resources of the edge server; and W i is a set of timing constraints and logical sequence constraints corresponding to an i-th subtask.

14 . The method for task schedulin

Assignees

• Inspur Suzhou Intelligent Technology Co Ltd

Inventors

• Zhang Yaqiang
• Li Ruyang
• Zhao Yaqian
• Li Rengang

Classifications

• G06F9/4881 Primary

  Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title

• G06F9/5072

  Grid computing · CPC title