Task scheduling method and device

Abstract

The embodiment of the invention provides a task scheduling method and device. The problem that the design mode of a traditional scheduling center does not meet the requirements for high availability and high stability is solved. The task scheduling method comprises the following steps: receiving a batch issuing request, registering batches and checking batch information; judging whether the task is an emergency task based on the batch information; if the task is an emergency task, distributing the emergency task to a green channel processing queue; if the task is a common task, obtaining a timestamp of the task based on the service attribute priority of the common task, and distributing the common task to a waiting queue; acquiring a flow control rule, and judging whether the common task enters a processing queue or not according to a current flow control number; and if the common task enters the processing queue, sending the common task to a target execution machine for processing.

Description

Technical Field

[0001] The present invention relates to the technical field of business scheduling, and in particular to a task scheduling method and device. Background Art

[0002] According to the design mode of the traditional dispatch center, there is no direct correlation between dispatch and business system. When the business system registers multiple task instances to the dispatch component and exceeds the load limit of the business system itself, the dispatch component will initiate the dispatch of these multiple task instances to the business system, which will cause the resources of the entire business system to be occupied instantly, directly resulting in no available resources for subsequent business. This design mode is completely inconsistent with the design concept of high availability and high stability. Summary of the invention

[0003] In view of this, an embodiment of the present invention provides a task scheduling method and device, which solves the problem that the design mode of the traditional scheduling center does not meet the requirements of high availability and high stability.

[0004] In the first aspect, a task scheduling method provided by an embodiment of the present invention includes: receiving a batch request, registering a batch and checking the batch information; judging whether it is an urgent task based on the batch information; if it is an urgent task, assigning the urgent task to a green channel processing queue; if it is an ordinary task, obtaining a timestamp of the task based on the business attribute priority of the ordinary task, and assigning the ordinary task to a waiting queue; obtaining a flow control rule, and judging whether the ordinary task enters the processing queue according to the current flow control number; if it enters the processing queue, sending the ordinary task to a target executor for processing.

[0005] In one embodiment, obtaining the timestamp of the ordinary task based on the business attribute priority of the ordinary task includes: obtaining the time of the ordinary task based on the business attribute priority of the ordinary task; and obtaining the timestamp of the ordinary task based on the current time and the time of the ordinary task.

[0006] In one implementation, allocating the common tasks to a waiting queue includes: sorting the waiting queue in ascending order of timestamps.

[0007] In one embodiment, the acquiring of the flow control rules includes: setting different flow control rules for different types of tasks based on business attributes, so as to control the number of tasks with the same business attributes to be processed simultaneously to a preset threshold.

[0008] In one embodiment, judging whether the ordinary task enters the processing queue according to the current flow control number includes: checking the flow control rules and the current flow control number to judge whether a task can enter the processing queue; when a task can enter the processing queue, the task with the smallest timestamp in the waiting queue is placed in the processing queue, and the flow control number is +1; when the processing queue task is downgraded due to the return of the execution machine, the downgraded task in the processing queue is returned to the waiting queue, and the flow control number is -1; when the current task in the processing queue is successfully processed, completely fails, or is suspended due to an exception, the current task in the processing queue will exit the processing queue to wait for manual processing, and the flow control number is -1.

[0009] In one embodiment, sending the ordinary task to the target execution machine for processing includes: when the ordinary task enters the processing queue, taking out the ordinary task and assigning a thread to process it, obtaining the information of the target execution machine and distributing it to the target execution machine for processing, while carrying the business serial number registered and uploaded by the execution machine.

[0010] In one embodiment, after the step of assigning the urgent task to the green channel processing queue, it includes: taking out the urgent task and assigning thread processing, obtaining the information of the target execution machine and distributing it to the target execution machine for processing, while carrying the business serial number registered and uploaded by the execution machine.

[0011] In one embodiment, before the step of receiving the batch request, the step further includes: loading parameter configuration, initializing queue information; registering and managing execution machine information and step information.

[0012] In the second aspect, an embodiment of the present invention provides a task scheduling device, comprising: a scheduling center and an execution machine; the execution machine is used to receive batch issuance requests and register batches; the scheduling center is used to check batch information; based on the batch information, determine whether it is an urgent task; if it is an urgent task, assign the urgent task to a green channel processing queue; if it is an ordinary task, obtain the timestamp of the task based on the business attribute priority of the ordinary task, and assign the ordinary task to a waiting queue; obtain flow control rules, and determine whether the ordinary task enters the processing queue based on the current flow control number; if it enters the processing queue, send the ordinary task to the target executor for processing.

[0013] In a third aspect, an embodiment of the present invention provides a computer device, comprising a memory, a processor, and a computer program stored in the memory, wherein the processor executes the computer program to implement the steps of the above-mentioned method.

[0014] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the above-mentioned method are implemented.

[0015] In a fifth aspect, an embodiment of the present invention provides a computer program product, comprising a computer program / instructions, which implements the steps of the above-mentioned method when executed by a processor.

[0016] The embodiment of the present invention provides a task scheduling method and device, which receives a batch request, registers a batch and checks the batch information; determines whether it is an urgent task based on the batch information; if it is an urgent task, the urgent task is assigned to the green channel processing queue; if it is an ordinary task, the timestamp of the task is obtained based on the business attribute priority of the ordinary task, and the ordinary task is assigned to the waiting queue; obtains the flow control rule, and determines whether the ordinary task enters the processing queue according to the current flow control number; if it enters the processing queue, the ordinary task is sent to the target execution machine for processing. The present invention can control the flow of instance tasks according to business attributes, reduce the occupation of system resources by too many flow tasks under the same business attributes, and ensure the normal operation of the business system. For tasks that fail to obtain priority processing, they need to enter the queuing queue and wait, and can enter the processing queue only after the task being processed exits the processing queue. At the same time, urgent tasks can also be processed by additional reserved business system resources, thereby avoiding the inability to process urgent tasks due to flow control. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] Figure 1 FIG. 1 is a flow chart of a task scheduling method provided by an embodiment of the present invention.

[0018] Figure 2 Shown is a design block diagram of a task scheduling method provided by an embodiment of the present invention.

[0019] Figure 3 Shown is a block diagram of a design scheme for a rural credit batch platform before modification in the prior art.

[0020] Figure 4 The figure shows a block diagram of a design scheme of a rural credit batch platform after being modified, provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0021] In order to enable those skilled in the art to better understand the technical solution of the present disclosure, and to fully understand and implement how the present disclosure applies technical means to solve technical problems and achieve the corresponding technical effects, the technical solution in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only embodiments of a part of the present disclosure, not all of the embodiments. The embodiments of the present disclosure and the various features in the embodiments can be combined with each other without conflict, and the technical solutions formed are all within the scope of protection of the present disclosure. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in this field without making creative work should fall within the scope of protection of the present disclosure.

[0022] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product, or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products, or devices.

[0023] It should be noted that the steps shown in the flowcharts of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and that, although a logical order is shown in the flowcharts, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0024] The inventor of the present application has found that when using a traditional dispatch center, after the business system registers a task with the dispatch center, the dispatch center will generate a task instance for it, and then immediately assign a thread for processing, and directly send it to the execution machine for processing. Under normal circumstances, there is no impact on the business system. However, when a large number of tasks are registered in a short period of time, the dispatch center will send a large number of requests to the execution machine. If there is no flow control, it will cause the business system transaction to be blocked, the processing is slow, and it cannot respond to other tasks. In severe cases, it will directly cause the business system to be paralyzed, affecting the normal operation of the business. In order to solve the above problems, the present invention proposes a task scheduling method and device, which can control the flow of instance tasks according to business attributes, reduce the occupation of system resources by too many flow tasks under the same business attributes, and ensure the normal operation of the business system. For tasks that fail to obtain priority processing, they need to enter the queuing queue and wait, and they can enter the processing queue only after the task being processed exits the processing queue. At the same time, urgent tasks can also be processed by additional reserved business system resources, thereby avoiding the inability to process urgent tasks due to flow control. The specific implementation method is described in the following embodiment.

[0025] This embodiment provides a task scheduling method. Figure 1 and Figure 2 As shown, the task scheduling method is completed based on a task scheduling device, and the task scheduling device includes a scheduling center and an execution machine. The task scheduling method includes:

[0026] Step 01: Receive a consignment batch request, register the batch and check the batch information.

[0027] Furthermore, after the user-side system sends a batch request to the execution machine, the execution machine registers the batch and registers the batch to the dispatch center, and the dispatch center checks the batch information.

[0028] Step 02: Determine whether it is an urgent task based on the batch information.

[0029] Furthermore, whether it is an urgent task or a common task is determined based on the batch information.

[0030] Step 03: If it is an urgent task, the urgent task is assigned to the green channel processing queue.

[0031] Furthermore, after the urgent task is assigned to the green channel processing queue, the urgent task is taken out and assigned to a thread for processing, the information of the target execution machine is obtained and distributed to the target execution machine for processing, and the business serial number registered and sent by the execution machine is carried. Therefore, the urgent task can also be processed by the additional reserved business system resources, thereby avoiding the phenomenon that the urgent task cannot be processed due to flow control.

[0032] Step 04: If it is a common task, the timestamp of the task is obtained based on the business attribute priority of the common task, and the common task is assigned to a waiting queue.

[0033] Furthermore, if it is a common task, firstly, the time of the common task is obtained based on the business attribute priority of the common task; then, the timestamp of the common task is obtained based on the current time and the time of the common task. It can be considered that the timestamp is finally calculated by subtracting the time calculated by the common task priority from the current time. The higher the priority of the common task, the smaller the timestamp.

[0034] After assigning common tasks to the waiting queue, the waiting queue will sort all common tasks in ascending order of timestamps. Afterwards, if there are common tasks that can enter the processing queue, the waiting queue will give priority to adding common tasks with the smallest timestamps to the processing queue. Common tasks that fail to obtain priority processing need to enter the queuing queue and wait until the task being processed exits the processing queue before entering the processing queue.

[0035] Step 05: Obtain the flow control rules, and determine whether the common task enters the processing queue according to the current flow control number.

[0036] Furthermore, different flow control rules are set for different types of tasks based on business attributes, so as to control the number of tasks with the same business attribute to be processed simultaneously as a preset threshold. Preferably, flow control is set according to different business attributes, such as flow control according to different combinations of channels, batch types, etc. Therefore, the method can perform flow control on instance tasks according to business attributes, reduce the occupation of system resources by too many flow tasks under the same business attributes, and ensure the normal operation of the business system.

[0037] Check the flow control rules and current flow control number to determine whether there are tasks that can enter the processing queue;

[0038] When a task can enter the processing queue, the task with the smallest timestamp in the waiting queue is put into the processing queue, and the flow control number is increased by 1;

[0039] When the processing queue task is downgraded due to the return of the execution machine, the downgraded task in the processing queue is returned to the waiting queue, and the flow control number is -1;

[0040] When the current task in the processing queue is successfully processed, fails completely, or is paused due to an exception, the current task in the processing queue will exit the processing queue to wait for manual processing, and the flow control number is -1.

[0041] Step 06: If it enters the processing queue, the ordinary task is sent to the target execution machine for processing.

[0042] Furthermore, when the common task enters the processing queue, the common task is taken out and assigned to a thread for processing, the information of the target execution machine is obtained and distributed to the target execution machine for processing, and the business serial number registered and uploaded by the execution machine is carried at the same time.

[0043] In addition to the above steps, the task scheduling method also includes step 07 before the step of receiving the batch request: loading parameter configuration, initializing queue information; registering and managing execution machine information and step information.

[0044] Furthermore, the dispatch center loads parameter configuration and initializes queue information when it starts. When the execution machine starts, the machine information and step information are registered to the dispatch center, and the dispatch center manages the execution machine information.

[0045] Compared with the prior art, the task scheduling method provided by the present invention greatly improves the high availability and high stability of the application system, avoids the problem of unavailability of other categories of tasks due to a peak in a single category of tasks, limits such tasks to ensure the availability and stability of the business system, and at the same time, centralized management and scheduling also reduces the resource consumption caused by internal driving for the batch platform, and concentrates more resources on task processing.

[0046] In one embodiment of the present invention, when the business system needs to use the dispatch center to schedule tasks, it is necessary to configure the task scheduling process on the dispatch center, and it is necessary to bind the flow control rules to the task. When the business system registers a task instance with the dispatch center, the dispatch center will check it according to the flow control rules. When the dispatch center initiates task scheduling to the business system, it obtains the available concurrency based on the business attributes and flow control rules sent by the business system. If the concurrency meets the flow control requirements, it will initiate the task call to control whether the task can be scheduled. When the business system registers an urgent task, the dispatch center determines whether the task skips flow control based on the task attributes and directly schedules the task through the reserved business system resources.

[0047] In one embodiment of the present invention, taking a certain rural credit batch platform as an example, the systems or components involved include a batch platform (the system implements task scheduling itself), a channel-end system (counter, online banking, third-party system), and a core system.

[0048] The technical problem to be solved by this embodiment is to solve the problem that when the task peak comes, too many tasks are processed at the same time, resulting in excessive resource consumption, thus slowing down the platform task processing. By separating the task scheduling and setting flow control for each task, the impact of large traffic on the batch platform is controlled. At the same time, centralized management and scheduling also reduce the resource consumption caused by internal drive for the batch platform, and more resources are concentrated on task processing. Figure 3As shown; after the transformation, a rural credit batch platform is as follows Figure 4 shown.

[0049] In conjunction with the above drawings, this embodiment adopts the following scheduling method:

[0050] 1. After the online banking system sends the batch request to the execution machine, the execution machine registers the batch to the dispatch center;

[0051] 2. After receiving the task, the dispatch center checks whether it is an urgent task, calculates the priority timestamp according to the channel and type (the higher the priority, the smaller the timestamp calculated by subtracting the priority from the current time, and the waiting queue is sorted in ascending order by timestamp), and then puts it into the waiting queue; if it is an urgent task, it directly enters the green channel processing queue, assigns a processing thread to it, and then obtains the distributed executor according to the executor management and sends the task for processing.

[0052] 3. After getting the task from the waiting queue, get the flow control rules according to the channel and type and determine whether to enter the processing queue according to the current flow control number. For example, if the online banking channel accounts for 50% and the agency payment type accounts for 80%, then by calculating that the total flow control accounts for 40%, and setting the total flow control to 200, this type of task can be processed at most 200*40%=80 tasks at the same time; calculate whether the current task can enter the processing queue according to the current concurrent number of such tasks recorded.

[0053] 4. After the task enters the processing queue, a processing thread will be assigned to it, and then the distributed executor will be obtained according to the executor management and the task will be sent for processing.

[0054] When the task peak comes, by setting flow control for tasks of different categories, the number of tasks of the same category that can be processed simultaneously can be controlled to the set threshold, thereby reducing the occupation of system resources by such tasks and solving the problem of slow processing due to excessive consumption of system resources. At the same time, processing resources are reserved for tasks of other categories to ensure timely processing of tasks of other categories. The extraction of the original internal task scheduling of the execution system also reduces the consumption of some resources for the execution system, and at the same time, these resources are used for task processing, which also improves the processing efficiency of the execution system. The queue priority sets more reasonable allocation rules for tasks, increases the processing frequency of high-priority tasks, and the setting of green channels provides a means of rapid processing for temporary and urgent tasks, thereby improving customer experience.

[0055] This embodiment provides a task scheduling device, referring to Figure 2As shown in FIG. 1 , the task scheduling device includes a scheduling center and an execution machine. The scheduling center is a component independently developed by Advanced Digital Communications Co., Ltd., which is used to schedule services provided by various business systems in a specified manner. The execution machine is a batch platform, that is, an application system that needs to use a scheduling component to schedule tasks.

[0056] Furthermore, in this embodiment, the execution machine is used to receive a request for issuing a batch on behalf of another and register the batch;

[0057] The dispatch center is used to check batch information; determine whether it is an urgent task based on the batch information; if it is an urgent task, assign the urgent task to the green channel processing queue; if it is an ordinary task, obtain the timestamp of the task based on the business attribute priority of the ordinary task, and assign the ordinary task to the waiting queue; obtain the flow control rules, and determine whether the ordinary task enters the processing queue according to the current flow control number; if it enters the processing queue, send the ordinary task to the target execution machine for processing.

[0058] Among them, the green channel is different from the general scheduling channel. Additional resources are provided for the green channel to use, and it is independent of the ordinary channel.

[0059] When the scheduling center is started, the default configuration of the scheduling thread and the task is initialized. The task configuration is manually configured in the management interface. When the executor sends a request task to the scheduling center, the scheduling center registers the information of the task request, and then generates task instance information for this task according to the task configuration. When a timed triggered task is configured, the scheduling center will generate task instance information according to the timed task information. The scheduling center assigns a thread to this task instance for processing, and asynchronously calls the services of each executor in the SDK way through the scheduling strategy, while carrying additional information sent by the request. After the executor service processing is completed, the processing result is sent to the scheduling center. The scheduling center checks whether there is a next task flow according to the task configuration, otherwise the task is terminated. If so, the task instance information of the next flow is generated, and the scheduling of the above task instance is repeated.

[0060] On the basis of the above embodiments, this embodiment provides a computer device, including a memory, a processor, and a computer program stored in the memory, wherein the processor executes the computer program to implement the steps of the method described in the above embodiments.

[0061] In some implementations of this embodiment, a computer-readable storage medium is provided, on which a computer program is stored, characterized in that when the computer program is executed by a processor, the steps of the method described in the above embodiment are implemented.

[0062] In some implementations of this embodiment, a computer program product is provided, including a computer program / instructions, characterized in that when the computer program is executed by a processor, the steps of the method described in the above embodiment are implemented.

[0063] The processor may include, but is not limited to, one or more processors or microprocessors. Each processor may be an application specific integrated circuit (ASIC), a digital signal processor (DSP), a digital signal processing device (DSPD), a programmable logic device (PLD), a field programmable gate array (FPGA), a controller, a microcontroller, a microprocessor or other electronic components to execute the method in the above embodiments.

[0064] The computer-readable storage medium may be implemented by any type of volatile or non-volatile storage device or a combination thereof, and the computer-readable storage medium may include but is not limited to, for example, random access memory (RAM), read-only memory (ROM), flash memory, EPROM memory, EEPROM memory, registers, computer storage media (e.g., hard disk, floppy disk, solid-state drive, removable disk, CD-ROM, DVD-ROM, Blu-ray disc, etc.).

[0065] The computer-readable storage medium may also store at least one computer executable program / instruction, which may be, for example, a computer-readable instruction. The computer-readable storage medium includes, but is not limited to, for example, a volatile memory and / or a non-volatile memory. The volatile memory may include, for example, a random access memory (RAM) and / or a cache memory (cache), etc. The computer-readable storage medium may include, for example, a read-only memory (ROM), a hard disk, a flash memory, etc. For example, a non-transitory computer-readable storage medium may be connected to a computing device such as a computer, and then, when the computing device runs the computer-readable instructions stored on the computer-readable storage medium, the various methods described above may be performed.

[0066] In addition, the computer device may also include (but not limited to) a data bus, an input / output (I / O) bus, a display, and input / output devices (eg, keyboard, mouse, speaker, etc.), etc.

[0067] The processor may communicate with external devices via an I / O bus via a wired or wireless network.

[0068] In one embodiment, the at least one computer executable instruction may also be compiled into or constitute a software product / computer program product, wherein one or more computer executable instructions are executed by a processor to perform the various functions and / or method steps in the embodiments described in the present technology.

[0069] In the embodiments provided in the present disclosure, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely schematic. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architecture, functions and operations of the devices, methods and computer program products according to multiple embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of a code, and the above-mentioned module, program segment or a part of the code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of boxes in the block diagram and / or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0070] It should be noted that in the present disclosure, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element limited by the sentence "includes a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

[0071] Although the embodiments disclosed in the present disclosure are as above, the above contents are only embodiments adopted for facilitating the understanding of the present disclosure and are not intended to limit the present disclosure. Any technician in the technical field to which the present disclosure belongs can make any modifications and changes in the form and details of the implementation without departing from the spirit and scope disclosed in the present disclosure, but the scope of patent protection of the present disclosure shall still be subject to the scope defined in the attached claims.

Claims

1. A task scheduling method, characterized in that: include: Receive batch dispatch requests, register batches and check batch information; Determining whether it is an urgent task based on the batch information; If it is an urgent task, the urgent task is assigned to the green channel processing queue; If it is a common task, the timestamp of the task is obtained based on the business attribute priority of the common task, and the common task is assigned to a waiting queue; Obtaining a flow control rule, and determining whether the common task enters a processing queue according to a current flow control number; If it enters the processing queue, the common task is sent to the target execution machine for processing.

2. The task scheduling method according to claim 1, characterized in that: The obtaining the timestamp of the common task based on the business attribute priority of the common task includes: Obtaining the time of the common task based on the business attribute priority of the common task; The timestamp of the common task is obtained based on the current time and the time of the common task.

3. The task scheduling method according to claim 2, characterized in that: The allocating the common tasks to the waiting queue includes: sorting the waiting queue in ascending order of timestamps.

4. The task scheduling method according to claim 1, characterized in that: The obtaining of the flow control rules includes: setting different flow control rules for different types of tasks based on business attributes, so as to control the number of tasks with the same business attribute to be processed simultaneously to a preset threshold.

5. The task scheduling method according to claim 1, characterized in that: The determining, according to the current flow control number, whether the common task enters the processing queue comprises: Check the flow control rules and current flow control number to determine whether there are tasks that can enter the processing queue; When a task can enter the processing queue, the task with the smallest timestamp in the waiting queue is put into the processing queue, and the flow control number is increased by 1; When the processing queue task is downgraded due to the return of the execution machine, the downgraded task in the processing queue is returned to the waiting queue, and the flow control number is -1; When the current task in the processing queue is successfully processed, fails completely, or is paused due to an exception, the current task in the processing queue will exit the processing queue to wait for manual processing, and the flow control number is -1.

6. The task scheduling method according to claim 1, characterized in that: Sending the common task to the target execution machine for processing includes: when the common task enters the processing queue, taking out the common task and assigning a thread for processing, obtaining the information of the target execution machine and distributing it to the target execution machine for processing, and carrying the business serial number registered and sent by the execution machine.

7. The task scheduling method according to claim 1, characterized in that: After the step of assigning the urgent task to the green channel processing queue, it includes: taking out the urgent task and assigning thread processing, obtaining the information of the target execution machine and distributing it to the target execution machine for processing, and carrying the business serial number registered and sent by the execution machine.

8. The task scheduling method according to claim 1, characterized in that: Before the step of receiving the batch request for dispatch, the method further includes: Load parameter configuration and initialize queue information; Register and manage execution machine information and step information.

9. A task scheduling device, characterized in that: include: Dispatch center and execution machine; The execution machine is used to receive a request for issuing a batch on behalf of another and register the batch; The dispatch center is used to check batch information; Determining whether it is an urgent task based on the batch information; If it is an urgent task, the urgent task will be assigned to the green channel processing queue; if it is an ordinary task, the timestamp of the task will be obtained based on the business attribute priority of the ordinary task, and the ordinary task will be assigned to the waiting queue; the flow control rules will be obtained, and it will be determined whether the ordinary task enters the processing queue according to the current flow control number; if it enters the processing queue, the ordinary task will be sent to the target execution machine for processing.

10. A computer device comprising a memory, a processor and a computer program stored in the memory, characterized in that: The processor executes the computer program to implement the steps of the method according to any one of claims 1 to 8.

Images