MULTI-TASK DYNAMIC RESOURCE SCHEDULING METHOD

Disclosed in the present invention is a multi-task dynamic resource scheduling method. When a new task is received, candidate tasks corresponding to the new task are selected from all running tasks, and priority corresponding to each running task is determined on the basis of a running duration of e...

Full description

Saved in:
Bibliographic Details
Main Authors ZHOU, Jianer, JI, Dongcen, HUANG, Yong
Format Patent
LanguageChinese
English
French
Published 25.11.2021
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:Disclosed in the present invention is a multi-task dynamic resource scheduling method. When a new task is received, candidate tasks corresponding to the new task are selected from all running tasks, and priority corresponding to each running task is determined on the basis of a running duration of each running task; an adjustment resource corresponding to each candidate task is determined according to a system allocation resource corresponding to the new task; and the allocation resource corresponding to each candidate task is adjusted according to the adjustment resource of each candidate task, and the adjusted system resource is allocated to the new task. By using a containerized resource isolation method, this embodiment implements a dynamic resource scheduling mechanism based on the execution time of tasks; thus, there is no need to predict the time required for task operation in advance; according to the execution time of tasks, dynamic priority is set for different tasks; more resources are allocated fo
Bibliography:Application Number: WO2021CN94170