Distribution type task scheduling method, distribution type task scheduling system and distribution type task scheduling device

Abstract

The invention discloses a distribution type task scheduling method, a distribution type task scheduling system and a distribution type task scheduling device. The distribution type task scheduling system comprises a control server and a plurality of execution servers, wherein the control server comprises a scheduling controller; each execution controller comprises a plurality of task grooves; a certain amount of resources are assigned to each task groove; when the system is operated, the scheduling controller maintains two queues including a task waiting queue and a task groove queue; when each task X is received, if the task groove in the task groove queue is suitable for processing the task X, the task X is assigned to the task groove; otherwise, the task X is added into the task waiting queue; when a task request actively sent by the task groove X is received for each time, if a task suitable for being processed by the task groove X exists in the task waiting queue, the task is assigned to the task groove X; and otherwise, the task groove X is added into the task groove queue. With the adoption of the scheme provided by the invention, the resource use ratio is increased and the task processing efficiency can be improved.

Description

technical field [0001] The invention relates to task scheduling technology, in particular to a distributed task scheduling method, system and device. Background technique [0002] Distributed task scheduling refers to assigning multiple tasks divided by an application or business to multiple servers for processing. Distributed task scheduling can solve the problem of insufficient resources of a single server and achieve the purpose of large-scale data computing. [0003] Usually, a distributed task scheduling system includes a control server, and other servers are called execution servers. The control server can be used to manage each execution server in a unified manner. Assign it to an execution server. [0004] For the execution server, it can only passively accept the assigned task, but the task may not be suitable for its processing, for example: suppose the available memory of the execution server is 700M, the currently executed task occupies 200M, and the newly allo...

AI Technical Summary

Problems solved by technology

[0004] For the execution server, it can only passively accept the assigned task, but the task may not be suitable for its processing, for example: suppose the available memory of the execution server is 700M, the currently executed task occupies 200M, and the newly allocated one The task needs to occupy 600M of memory, so the newly allocated task will not be able to be executed, that is, it can only be executed after the current task is executed, then the remaining 500M memory is equivalent to being wasted, and if the current task needs to be executed For a longer time, the newly assigned tasks need to wait for a longer time, thus reducing the task processing efficiency

Images