Patent ID: 11934871
Assignee: INSPUR SUZHOU INTELLIGENT TECHNOLOGY CO., LTD.
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 0:
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.