A Job Scheduling and Computing Resource Allocation Method

Abstract

The invention relates to an operation scheduling and computing resource allocation method and belongs to the technical field of computers. The method comprises the following steps: S1, allocating calculation resources for a user according to the business demand of the user; S2, establishing an operation queue according to the business demand of the user, recording the priority, submission time and required calculation finishing time information of each operation, and allocating corresponding computing resources for each operation. S3, calculating estimated running time length of each task in each queue; S4, performing task scheduling according to the priority and the estimated running time of the operation by utilizing the user as a scheduling range; S5, performing task scheduling by utilizing task types and relation included in the operations as reference; and S6, after calculation is finished, releasing computing resources. The method is capable of avoiding the problem that low-priority business cannot be scheduled in time, ensuring that all the operations are calculated within specified time, and improving the fairness and timeliness of operation scheduling.

Description

technical field [0001] The invention belongs to the technical field of computers, and relates to a job scheduling and computing resource allocation method. Background technique [0002] In the process of supercomputing service business development, the FIFO (First In First Out) scheduling mechanism is mainly used to allocate tasks, and all jobs are uniformly submitted to a queue, and the jobs in the queue are run sequentially in the order of submission . However, with the increase of supercomputing users, business volume, and business types, the traditional FIFO scheduling mechanism can no longer meet the current needs of supercomputing business scheduling. [0003] In the existing job scheduling method, usually only the priority of the business is considered, resulting in the inability to schedule the business with low priority in time, which reduces the fairness and timeliness of job scheduling. [0004] In existing resource allocation methods, usually only all resources...

AI Technical Summary

Problems solved by technology

However, with the increase of supercomputing users, business volume, and business types, the traditional FIFO scheduling mechanism can no longer meet the current needs of supercomputing business scheduling

[0003] In the existing job scheduling methods, usually only the priority of the business is considered, resulting in the inability to schedule the low-priority business in time, reducing the fairness and timeliness of job scheduling

[0004] In existing resource allocation methods, usually only all resources are considered as a unified computing resource pool, resulting in inflexible division of computing resources and low utilization efficiency

Images