Task scheduling method and system

Abstract

The embodiment of the invention discloses a task scheduling method and system. A scheduling node obtains waiting tasks belonging to the scheduling node in a preset time period from a task database according to a preset algorithm. The scheduling node stores the obtained waiting tasks in the task resource pool of the scheduling node. When the execution time of the tasks in the task resource pool is arrived, the scheduling node sends a task triggering message to a business node; the business node processes the waiting tasks according to the task triggering message. In the task scheduling process, a plurality of tasks belonging to the scheduling node in the preset time period are drawn from the task database by the scheduling node; the access times of the task database is reduced; the processing capability of the single scheduling node is improved; the shared lock mechanism of the database is unnecessarily used in the task scheduling process; the wait resource is reduced; and the concurrent processing performance of mass tasks is improved.

Description

technical field [0001] The present invention relates to the field of computer technology, in particular to a task scheduling method and system. Background technique [0002] A cloud server is a computing service that is simple, efficient, and has elastically scalable processing capabilities. Elastic scaling refers to the management service that automatically adjusts its elastic computing resources according to the user's business needs and strategies. It can automatically increase cloud host instances when business grows, and automatically reduce cloud host instances when business declines. Users can specify timing policies, period policies, and monitoring trigger policies to achieve elastic scaling; among them, timing policies and period policies will generate a large number of tasks in public cloud scenarios, and these tasks need to be dispatched by the dispatch center. [0003] Each scheduling node in the scheduling cluster executes different tasks. For any scheduling no...

AI Technical Summary

Problems solved by technology

[0003] Each scheduling node in the scheduling cluster executes different tasks. For any scheduling node, each time a task is executed, the database needs to be read and written once, and the task to be executed is read, so that the processing capability of a single scheduling node depends on the database. read and write capabilities; and, in order to ensure that a given task is only executed on a single scheduling node, the current solution is: when the scheduling node that can preempt the task first in the scheduling cluster executes the task, A shared lock will be added to the corresponding task in the database, so that other scheduling nodes cannot occupy the shared lock until the previous node releases the shared lock; at this time, other scheduling nodes are in a waiting state, resulting in a large number of Waiting for resources, this situation will become more and more serious as the number of nodes increases

Images