CN113778676B - Task scheduling system, method, computer device and storage medium - Google Patents
Task scheduling system, method, computer device and storage medium Download PDFInfo
- Publication number
- CN113778676B CN113778676B CN202111024485.4A CN202111024485A CN113778676B CN 113778676 B CN113778676 B CN 113778676B CN 202111024485 A CN202111024485 A CN 202111024485A CN 113778676 B CN113778676 B CN 113778676B
- Authority
- CN
- China
- Prior art keywords
- task
- time
- scheduling
- tasks
- module
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/62—Establishing a time schedule for servicing the requests
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5015—Service provider selection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5021—Priority
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/548—Queue
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The embodiment of the application provides a task scheduling system, a task scheduling method, computer equipment and a storage medium. In the embodiment of the application, after the first time with more time-triggered tasks is identified, task information required by the scheduled tasks is acquired from the database at the second time earlier than the first time, and when the first time arrives, the task information required by the scheduled tasks is distributed to the service nodes in the service processing system. Therefore, the distribution efficiency of task information of the scheduling task to the service processing system is improved, and the execution efficiency of the service processing system for executing the scheduling task is further improved.
Description
Technical Field
The embodiment of the application relates to the technical field of Internet, in particular to a task scheduling system, a task scheduling method, computer equipment and a storage medium.
Background
Currently, it is often necessary to distribute respective scheduling tasks to the service processing systems at different times for the service processing systems to execute. Because of different actual service demands, the number of scheduling tasks required to be distributed to the service processing system is relatively large in some times, and the number of scheduling tasks required to be distributed to the service processing system is relatively small in some times. However, more scheduled tasks distributed to the service processing system occupy longer time, which affects the execution efficiency of the service processing system in executing the scheduled tasks.
Disclosure of Invention
The embodiment of the application provides a task scheduling system, a task scheduling method, computer equipment and a storage medium. The method is used for improving the distribution efficiency of distributing the scheduling tasks to the service processing system and improving the execution efficiency of executing the scheduling tasks of the service processing system.
In a first aspect, an embodiment of the present application provides a task scheduling system, including: the system comprises a time triggering module, a scheduling module and a distributing module; the time triggering module is in communication connection with the scheduling module, and the scheduling module is in communication connection with the distribution module;
the time triggering module is used for determining a first time, and the number of tasks of the time triggering tasks required to be triggered at the first time is greater than or equal to a number threshold; transmitting a task information preloading instruction associated with the first time to the scheduling module, wherein the task information preloading instruction comprises a plurality of first task names and second time earlier than the first time, and the plurality of first task names respectively identify a plurality of first scheduling tasks which need to be triggered by a time triggering task of the first time; and when the first time arrives, sending a first scheduling instruction comprising the plurality of first task names to the scheduling module;
the scheduling module is used for pre-loading instructions according to the task information, and inquiring task information stored in the database according to the plurality of first task names at the second time to acquire the task information of the plurality of first scheduling tasks; transmitting task information of the plurality of first scheduling tasks to the distribution module according to the first scheduling instruction at the first time;
the distribution module is configured to send task information of the plurality of first scheduling tasks to one or more first service nodes, where the first service nodes are service nodes that need to execute the first scheduling tasks.
In a second aspect, an embodiment of the present application provides a task scheduling method, including:
determining a first time, wherein the number of tasks of time triggering tasks required to be triggered at the first time is greater than or equal to a number threshold; inquiring task information stored in a database according to a plurality of first task names at a second time earlier than the first time to acquire task information of a plurality of first scheduling tasks; and when the first time arrives, respectively sending the task information of the plurality of first scheduling tasks to one or more first service nodes, wherein the first service nodes are service nodes which need to execute the first scheduling tasks.
In a third aspect, embodiments of the present application provide a computer device, comprising: a processing component and a storage component;
the storage component stores one or more computer instructions; the one or more computer instructions are to be invoked for execution by the processing component;
the processing assembly is configured to:
determining a first time, wherein the number of tasks of time triggering tasks required to be triggered at the first time is greater than or equal to a number threshold; inquiring task information stored in a database according to a plurality of first task names at a second time earlier than the first time to acquire task information of a plurality of first scheduling tasks; and when the first time arrives, respectively sending the task information of the plurality of first scheduling tasks to one or more first service nodes, wherein the first service nodes are service nodes which need to execute the first scheduling tasks.
In the embodiment of the application, after the first time with more time-triggered tasks is identified, task information required by the scheduled tasks is acquired from the database at the second time earlier than the first time, and when the first time arrives, the task information required by the scheduled tasks is distributed to the service nodes in the service processing system. Therefore, the distribution efficiency of task information of the scheduling task to the service processing system is improved, and the execution efficiency of the service processing system for executing the scheduling task is further improved.
These and other aspects of the present application will be more readily apparent from the following description of the embodiments.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, a brief description will be given below of the drawings that are needed in the embodiments or the prior art descriptions, and it is obvious that the drawings in the following description are some embodiments of the present application, and that other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic structural diagram of a task scheduling system according to an embodiment of the present application;
fig. 2 is a flowchart of a task scheduling method provided in an embodiment of the present application;
fig. 3 is a schematic structural diagram of a computer device according to an embodiment of the present application.
Detailed Description
In order to enable those skilled in the art to better understand the present application, the following description will make clear and complete descriptions of the technical solutions in the embodiments of the present application with reference to the accompanying drawings in the embodiments of the present application.
In some of the flows described in the specification and claims of this application and in the foregoing figures, a number of operations are included that occur in a particular order, but it should be understood that the operations may be performed in other than the order in which they occur or in parallel, that the order of operations such as 101, 102, etc. is merely for distinguishing between the various operations, and that the order of execution is not by itself represented by any order of execution. In addition, the flows may include more or fewer operations, and the operations may be performed sequentially or in parallel. It should be noted that, the descriptions of "first" and "second" herein are used to distinguish different messages, devices, modules, etc., and do not represent a sequence, and are not limited to the "first" and the "second" being different types.
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.
Fig. 1 is a schematic structural diagram of a task scheduling system according to an embodiment of the present application. As shown in fig. 1, the task scheduling system may include a time trigger module 13, a scheduling module 14, and a distribution module 15; the time trigger module 13 is in communication with a scheduling module 14, and the scheduling module 14 is in communication with a distribution module 15.
In the embodiment of the application, one time triggering task corresponds to one scheduling task, the time triggering task indicates at which time the corresponding scheduling task needs to be triggered, and the scheduling task is a task which needs to be issued to a service node in a service processing system for execution.
In this embodiment of the present application, the time triggering module 13 is configured to determine a first time, where a number of tasks of the time triggering task that needs to be triggered at the first time is greater than or equal to a number threshold; transmitting a task information preloading instruction associated with the first time to the scheduling module 14, wherein the task information preloading instruction comprises a plurality of first task names and a second time earlier than the first time, and the plurality of first task names respectively identify a plurality of first scheduling tasks which need to be triggered by the time triggering task of the first time; and upon arrival of the first time, sending a first scheduling instruction including a plurality of first task names to the scheduling module 14.
Wherein the quantity threshold is set according to actual service requirements. If the number of the time triggering tasks required to be triggered at a certain time is greater than or equal to the number threshold, the service processing system is required to execute more scheduling tasks at the time. If the number of the time-triggered tasks required to be triggered at a certain time is smaller than the number threshold, the service processing system is indicated to execute fewer scheduled tasks at the time.
Notably, the present embodiment extends the functionality of the time trigger module 13. The time trigger module 13 may send a task information preloading instruction associated with a first time to the scheduling module 14 after identifying the first time when there are more time trigger tasks. The task information preloading instruction instructs the scheduling module 14 to load task information required by the first scheduling task associated with the first time into the scheduling module 14 in advance, so that when a scheduling instruction for the first scheduling task is issued to the scheduling module 14 at the first time, the distribution efficiency of the scheduling module 14 for distributing the task information of the first scheduling task to the service processing system through the distribution module 15 can be improved, and the execution efficiency of the service processing system for executing the scheduling task can be improved.
Notably, the task information preloading mode can effectively solve the problem of high load of a task scheduling system caused by high-frequency triggering.
It should be noted that the second time is determined according to the actual application requirement, so long as the second time is guaranteed to be earlier than the first time. In addition, the second time may be one or more second times. For example, there are a plurality of first scheduled tasks that need to be triggered at the first time, the same second time may be allocated to the plurality of first scheduled tasks, and different second times may be allocated to the plurality of first scheduled tasks.
It should be noted that, the task information preloading instruction carries a plurality of first task names, which can enable the scheduling module 14 to accurately confirm which scheduling tasks are the first scheduling tasks needing to load the task information in advance.
In the embodiment of the present application, the scheduling module 14 is configured to pre-load the instruction according to the task information, and query the task information stored in the database according to the plurality of first task names at the second time to obtain the task information of the plurality of first scheduled tasks; task information of a plurality of first scheduling tasks is sent to the distribution module 15 according to the first scheduling instruction at a first time.
It is noted that task information of a plurality of scheduled tasks is stored in advance in a database, and the task information includes, for example, but not limited to, task name, execution time, operation parameters required when the scheduled tasks are operated, and distribution mode. The operation parameters include, for example, parameters of resources required for scheduling the task to run, such as virtual computing resources such as threads, processes, or data streams, or hardware resources such as processors, network connections, or expansion cards.
The distribution mode refers to a mode of distributing task information of a scheduling task to a service processing system. For example, the distribution manner includes, but is not limited to, distribution by HTTP (Hypertext Transfer Prtcl, hypertext transfer protocol) interface manner or distribution by MQ (Message Queue) manner.
The distributing module 15 is configured to send task information of the plurality of first scheduling tasks to one or more first service nodes, where the first service nodes are service nodes that need to execute the first scheduling tasks, respectively.
Further optionally, the task information of the first scheduled task includes a first distribution manner for distributing the first scheduled task; when the distribution module 15 sends the task information of the plurality of first scheduling tasks to one or more first service nodes, the method specifically is used for: and respectively transmitting the task information of the plurality of first scheduling tasks to one or more first service nodes through a plurality of first distribution modes corresponding to the plurality of first scheduling tasks. The first distribution manner is, for example, distribution by an HTTP (Hypertext Transfer Prtcl, hypertext transfer protocol) interface manner or distribution by an MQ (Message Queue) manner.
Notably, the first service node is any service node in the service processing system. The service processing system may be any system for enhancing various services, and the services provided by the service node may be services written in different programming languages, such as C language, java language, python language, and the like.
The task scheduling system provided by the embodiment of the invention comprises a time triggering module 13, a scheduling module 14 and a distributing module 15, wherein after a first time with more time triggering tasks is identified by the time triggering module 13, a task information preloading instruction associated with the first time can be sent to the scheduling module 14, and the task information preloading instruction instructs the scheduling module 14 to load task information required by the first scheduling task associated with the first time into the scheduling module 14 in advance, so that when a scheduling instruction for the first scheduling task is issued to the scheduling module 14 at the first time, the distributing efficiency of the scheduling module 14 for distributing the task information of the first scheduling task to the service processing system through the distributing module 15 can be improved, and further the executing efficiency of the executing scheduling task of the service processing system is improved. In addition, the task scheduling system can also solve the problem that the unified scheduling of services written in different programming languages is complex and complicated, and realize the unified scheduling of the services in cross languages.
Further optionally, the time trigger module 13 is further configured to: determining task priorities among the plurality of first scheduled tasks;
when the time triggering module 13 sends a first scheduling instruction including a plurality of first task names to the scheduling module 14, the time triggering module is specifically configured to: upon arrival of the first time, sending a first scheduling instruction to the scheduling module 14 including a plurality of first task names and task priorities among the plurality of first scheduling tasks;
the scheduling module 14 is specifically configured to, when sending task information of a plurality of first scheduled tasks to the distribution module 15 according to the first scheduling instruction at a first time: the task information of the plurality of first scheduling tasks is sent to the distribution module 15 according to the first scheduling instruction sequentially at the first time in the order of the task priority from high to low.
Notably, the task priority between the individual scheduled tasks may be set in advance. When the task priority among the scheduling tasks is set, flexible setting can be performed according to the attribute information of the scheduling tasks.
It should be understood that, when the scheduling module 14 provides the task information of each first scheduling task to the distributing module 15 according to the order of the task priority from top to bottom, the distributing module 15 may also provide the task information of each first scheduling task to the service processing system according to the order of the task priority from top to bottom, so as to implement the task priority scheduling task to be preferentially executed by the service processing system, and implement targeted task scheduling.
In some embodiments of the present application, the time trigger module 13 is further configured to: determining a third time when the number of tasks of the time-triggered tasks to be triggered is less than the number threshold, and when the third time arrives, sending a second scheduling instruction including a second task name to the scheduling module 14; the second task name identifies a second scheduled task that the time-triggered task at the third time needs to trigger;
the scheduling module 14 is further configured to query task information stored in the database according to the second scheduling instruction at a third time to obtain task information of a second scheduled task, and send the task information of the second scheduled task to the distribution module 15;
and the distribution module 15 is configured to send task information of the second scheduling task to one or more second service nodes, where the second service nodes are service nodes that need to execute the second scheduling task.
It should be noted that, after identifying the third time with fewer time-triggered tasks, the time triggering module 13 may send a second scheduling instruction including the second task name to the scheduling module 14 when the third time arrives, where the scheduling module 14 searches task information stored in the query database to obtain the task information of the second scheduling task, and distributes the task information to the second execution service node in the service processing system through the distribution module 15.
In some embodiments of the present application, the task scheduling system further comprises: a task information configuration interface 11, a registration module 12; the task information configuration interface 11 is connected to the registration module 12.
The task information configuration interface 11 is configured to receive task information configured for a scheduled task and send the task information to the registration module 12. The registration module 12 is configured to store the task information in a database, generate an associated time trigger task for the scheduled task according to the task information, and send the time trigger task to the time trigger module 13. The time triggering module 13 is further configured to receive the time triggering task, and count the number of tasks of the time triggering task that needs to be triggered at each time point.
It should be noted that, the dashed box in fig. 1 represents optional components of the task information configuration interface 11 and the registration module 12 for the task scheduling system.
Specifically, the task information configuration interface 11 may receive task information configured for a scheduled task, which is input by a task scheduling user on the task scheduling configuration interface. These task information include, for example, but are not limited to, task name, execution time, operating parameters required to schedule the task to run, and distribution. Wherein the execution time may be a time expressed by a Cron time expression. For example, "0 15 10? * "means 10:15 am trigger per day. "0 0/5 14? "means triggering every 5 minutes during the 2 pm to 2:55 pm period of each day. "0 0-5 14? "means triggering every 1 minute during 2 pm to 2:05 pm every day. "0, 44 143WED" means 2:10 and 2:44 triggers on Wednesday of March. "0 15 10? * MON-FRI "indicates a 10:15 am trigger from Monday to Friday.
The task scheduling configuration interface may be a web-form interface. In addition, the service processing system can also feed back information to the task scheduling system, and the task scheduling system displays the feedback information on a task scheduling configuration interface for a user to check. The feedback information is, for example, whether the scheduled task is execution success or execution failure, the execution success number or execution failure number, and the like.
Notably, by configuring task information of the scheduling task through task information configuration, it is possible to implement uniform issuing of task information required for executing the scheduling task to service nodes deploying services written in different programming languages.
The registration module 12 may register task information into the database by using the thread pool to improve registration efficiency. For task information submitted by the task information configuration interface 11 at different times, a synchronous or asynchronous mode can be adopted to generate corresponding time trigger tasks, wherein the asynchronous mode can improve the generation efficiency of the time trigger tasks.
Further alternatively, the registration module 12 may also save registration time, registration result information, and the like in a database. The registration result information refers to result information of registration of task information submitted by the task information configuration interface 11 into the database, for example, registration failure information or registration success information. The registration time refers to the time when the task information submitted by the task information configuration interface 11 is registered in the database.
Further optionally, when the task information configuration interface 11 sends task information to the registration module 12, the task information configuration interface is specifically configured to: the task information converted into the specified data format is sent to the registration module 12. The specified data format is, for example, JSON (JavaScript Object Notation, object representation).
Fig. 2 is a flowchart of a task scheduling method provided in an embodiment of the present application. As shown in fig. 2, the task scheduling method includes:
201. and determining a first time, wherein the first time needs to trigger the first time when the number of tasks of the time triggering tasks is greater than or equal to a number threshold.
202. And inquiring task information stored in the database according to the plurality of first task names at a second time earlier than the first time to acquire task information of a plurality of first scheduling tasks.
203. And when the first time arrives, respectively transmitting the task information of the first scheduling tasks to one or more first service nodes, wherein the first service nodes are service nodes which need to execute the first scheduling tasks.
Further optionally, when the first time arrives, sending the task information of the plurality of first scheduling tasks to the one or more first service nodes respectively includes:
determining task priorities among the plurality of first scheduled tasks;
and when the first time arrives, sequentially sending the task information of the first scheduling tasks to one or more first service nodes according to the order of the task priority from top to bottom.
Further optionally, the method further comprises: determining a third time when the number of tasks of the time triggering task to be triggered is smaller than a number threshold, inquiring task information stored in a database according to the second task name to acquire task information of a second scheduling task when the third time arrives, and sending the task information of the second scheduling task to one or more first service nodes; the second task name identifies a second scheduled task that the time-triggered task at the third time needs to trigger.
Further optionally, the method further comprises: receiving task information configured for the scheduled task, storing the task information into a database, generating associated time trigger tasks for the scheduled task according to the task information, and counting the number of the time trigger tasks required to be triggered at each time point.
Further optionally, saving the task information to the database includes: and storing the task information converted into the specified data format into a database.
Further optionally, the task information of the first scheduled task includes a first distribution manner for distributing the first scheduled task; the transmitting task information of the plurality of first scheduling tasks to the one or more first service nodes respectively includes:
and respectively transmitting the task information of the plurality of first scheduling tasks to one or more first service nodes through a plurality of first distribution modes corresponding to the plurality of first scheduling tasks.
According to the task scheduling method, after the first time with more time-triggered tasks is identified, task information required by the scheduled tasks is acquired from the database at the second time earlier than the first time, and when the first time arrives, the task information required by the scheduled tasks is distributed to the service nodes in the service processing system. Therefore, the distribution efficiency of task information of the scheduling task to the service processing system is improved, and the execution efficiency of the service processing system for executing the scheduling task is further improved.
For the implementation of the task scheduling method, reference may be made to the content of the task scheduling system described above, which is not described herein.
The embodiment of the application also provides computer equipment. Fig. 3 is a schematic structural diagram of a computer device according to an embodiment of the present application. Referring to fig. 3, the control computer device includes: comprising a storage component 31 and a processing component 32; wherein the storage component 31 stores one or more computer instructions; one or more computer instructions to be invoked for execution by the processing component 32;
wherein the storage component 31 is configured to store various types of data to support operations at the terminal. The memory component may be implemented by any type or combination of volatile or nonvolatile memory devices such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disk.
The processing component 32 may include one or more processors to execute computer instructions to perform all or part of the steps in the information push method provided by embodiments of the present application. Of course, the processing component may also be implemented as one or more Application Specific Integrated Circuits (ASICs), digital Signal Processors (DSPs), digital Signal Processing Devices (DSPDs), programmable Logic Devices (PLDs), field Programmable Gate Arrays (FPGAs), controllers, microcontrollers, microprocessors or other electronic elements for executing the methods described above.
Specifically, the processing component 32 is configured to: determining a first time, wherein the number of tasks of time triggering tasks required to be triggered at the first time is greater than or equal to a number threshold; inquiring task information stored in a database according to a plurality of first task names at a second time earlier than the first time to acquire task information of a plurality of first scheduling tasks; and when the first time arrives, respectively transmitting the task information of the first scheduling tasks to one or more first service nodes, wherein the first service nodes are service nodes which need to execute the first scheduling tasks.
Further optionally, when the first time arrives, the processing component 32 sends the task information of the plurality of first scheduling tasks to one or more first service nodes respectively, specifically for: determining task priorities among the plurality of first scheduled tasks; and when the first time arrives, sequentially sending the task information of the first scheduling tasks to one or more first service nodes according to the order of the task priority from top to bottom.
Further optionally, the processing component 32 is further configured to: determining a third time when the number of tasks of the time triggering task to be triggered is smaller than a number threshold, inquiring task information stored in a database according to the second task name to acquire task information of a second scheduling task when the third time arrives, and sending the task information of the second scheduling task to one or more first service nodes; the second task name identifies a second scheduled task that the time-triggered task at the third time needs to trigger.
Further optionally, the processing component 32 is further configured to receive task information configured for the scheduled task, store the task information in the database, generate an associated time-triggered task for the scheduled task according to the task information, and count the number of tasks of the time-triggered task that need to be triggered at each time point.
Further optionally, the processing component 32 is specifically configured to, when storing the task information in the database: and storing the task information converted into the specified data format into a database.
Further optionally, the task information of the first scheduled task includes a first distribution manner for distributing the first scheduled task; the processing component 32 sends the task information of the plurality of first scheduled tasks to the one or more first service nodes, respectively, specifically for:
and respectively transmitting the task information of the plurality of first scheduling tasks to one or more first service nodes through a plurality of first distribution modes corresponding to the plurality of first scheduling tasks.
In addition, the computer device may also include a display component 33, which may be an Electroluminescent (EL) element, a liquid crystal display or a micro display having a similar structure, or a retina-directly displayable or similar laser-scanned display.
Of course, the computer device may naturally also include other components, such as input/output interfaces, communication components, and the like.
The input/output interface provides an interface between the processing component and a peripheral interface module, which may be an output device, an input device, etc.
The communication component is configured to facilitate communication between the computer device and other devices, whether wired or wireless, etc.
As used herein, a "computer device" may be a remote web server, a computer networking device, a chipset, a desktop computer, a notebook computer, a workstation, or any other processing device or equipment.
The computer device may be a physical device or an elastic computing host provided by the cloud computing platform, and the computer device may be a cloud server, and the processing component, the storage component, and the like may be a base server resource rented or purchased from the cloud computing platform.
The embodiment of the application also provides a computer readable storage medium, which stores a computer program, and the computer program can implement the task processing method of the embodiment shown in fig. 2 when executed by a computer.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, which are not repeated herein.
The apparatus embodiments described above are merely illustrative, wherein elements illustrated as separate elements may or may not be physically separate, and elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on such understanding, the foregoing technical solutions may be embodied essentially or in part in the form of a software product, which may be stored in a computer-readable storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the various embodiments or methods of some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present application, and are not limiting thereof; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the corresponding technical solutions.
Claims (9)
1. A task scheduling system, comprising: the system comprises a time triggering module, a scheduling module and a distributing module; the time triggering module is in communication connection with the scheduling module, and the scheduling module is in communication connection with the distribution module;
the time triggering module is used for determining a first time, and the number of tasks of the time triggering tasks required to be triggered at the first time is greater than or equal to a number threshold; transmitting a task information preloading instruction associated with the first time to the scheduling module, wherein the task information preloading instruction comprises a plurality of first task names and second time earlier than the first time, and the plurality of first task names respectively identify a plurality of first scheduling tasks which need to be triggered by a time triggering task of the first time; and when the first time arrives, sending a first scheduling instruction comprising the plurality of first task names to the scheduling module;
the scheduling module is used for pre-loading instructions according to the task information, and inquiring task information stored in the database according to the plurality of first task names at the second time to acquire the task information of the plurality of first scheduling tasks; transmitting task information of the plurality of first scheduling tasks to the distribution module according to the first scheduling instruction at the first time;
the distribution module is configured to send task information of the plurality of first scheduling tasks to one or more first service nodes, where the first service nodes are service nodes that need to execute the first scheduling tasks.
2. The system of claim 1, wherein the time trigger module is further configured to: determining task priorities among the plurality of first scheduled tasks;
when the time triggering module sends a first scheduling instruction including the plurality of first task names to the scheduling module, the time triggering module is specifically configured to: when the first time arrives, a first scheduling instruction comprising task priorities among the plurality of first task names and the plurality of first scheduling tasks is sent to the scheduling module;
the scheduling module is specifically configured to, when the task information of the plurality of first scheduling tasks is sent to the distribution module according to the first scheduling instruction at the first time: and according to the order of the task priority from high to low, sequentially sending the task information of the plurality of first scheduling tasks to the distribution module at the first time according to the first scheduling instruction.
3. The system of claim 1, wherein the time trigger module is further configured to: determining a third time when the number of tasks of the time triggering tasks needing to be triggered is smaller than a number threshold value, and sending a second scheduling instruction comprising a second task name to the scheduling module when the third time arrives; the second task name identifies a second scheduling task that needs to be triggered by the time-triggered task at the third time;
the scheduling module is further configured to query task information stored in the database at the third time according to the second scheduling instruction to obtain task information of the second scheduling task, and send the task information of the second scheduling task to the distribution module.
4. The system of claim 1, further comprising: task information configuration interface and registration module; the task information configuration interface is connected with the registration module;
the task information configuration interface is used for receiving task information configured for scheduling tasks and sending the task information to the registration module;
the registration module is used for storing the task information into a database, generating an associated time trigger task for the scheduling task according to the task information, and sending the time trigger task to the time trigger module;
the time triggering module is also used for receiving the time triggering tasks and counting the task number of the time triggering tasks which need to be triggered at each time point.
5. The system of claim 4, wherein when the task information configuration interface sends the task information to the registration module, the task information configuration interface is specifically configured to: and sending the task information converted into the appointed data format to the registration module.
6. The system of claim 4, wherein the task information of the first scheduled task includes a first distribution manner for distributing the first scheduled task;
the distribution module is specifically configured to, when sending task information of the plurality of first scheduling tasks to one or more first service nodes, respectively:
and respectively transmitting the task information of the plurality of first scheduling tasks to one or more first service nodes through a plurality of first distribution modes corresponding to the plurality of first scheduling tasks.
7. A method for task scheduling, comprising:
determining a first time, wherein the time required to be triggered by the first time triggers the first time when the number of tasks of the tasks is greater than or equal to a number threshold;
inquiring task information stored in a database according to a plurality of first task names at a second time earlier than the first time to acquire task information of a plurality of first scheduling tasks;
and when the first time arrives, respectively sending the task information of the plurality of first scheduling tasks to one or more first service nodes, wherein the first service nodes are service nodes which need to execute the first scheduling tasks.
8. A computer device comprising a processing component and a storage component;
the storage component stores one or more computer instructions; the one or more computer instructions are to be invoked for execution by the processing component;
the processing assembly is configured to:
determining a first time, wherein the number of tasks of a time triggering task which needs to be triggered at the first time is greater than or equal to a number threshold;
inquiring task information stored in a database according to a plurality of first task names at a second time earlier than the first time to acquire task information of a plurality of first scheduling tasks;
and when the first time arrives, respectively sending the task information of the plurality of first scheduling tasks to one or more first service nodes, wherein the first service nodes are service nodes which need to execute the first scheduling tasks.
9. A computer readable storage medium, characterized in that a computer program is stored, which, when executed by a computer, carries out the steps in the method of claim 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111024485.4A CN113778676B (en) | 2021-09-02 | 2021-09-02 | Task scheduling system, method, computer device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111024485.4A CN113778676B (en) | 2021-09-02 | 2021-09-02 | Task scheduling system, method, computer device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113778676A CN113778676A (en) | 2021-12-10 |
| CN113778676B true CN113778676B (en) | 2023-05-23 |
Family
ID=78840689
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111024485.4A Active CN113778676B (en) | 2021-09-02 | 2021-09-02 | Task scheduling system, method, computer device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113778676B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105378450A (en) * | 2013-02-18 | 2016-03-02 | 赛拉诺斯股份有限公司 | Systems and methods for multi-analysis |
| CN110362390A (en) * | 2019-06-06 | 2019-10-22 | 银江股份有限公司 | A kind of distributed data integrated operations dispatching method and device |
| CN110955717A (en) * | 2019-11-19 | 2020-04-03 | 深圳市航通智能技术有限公司 | Visual dynamic display method and system based on big data |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2420215A1 (en) * | 2000-08-23 | 2002-06-27 | Neurogen Corporation | High affinity small molecule c5a receptor modulators |
| US20150312102A1 (en) * | 2014-02-18 | 2015-10-29 | Seven Networks, Inc. | Policy management for signaling optimization in a wireless network for traffic utilizing proprietary and non-proprietary protocols |
-
2021
- 2021-09-02 CN CN202111024485.4A patent/CN113778676B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105378450A (en) * | 2013-02-18 | 2016-03-02 | 赛拉诺斯股份有限公司 | Systems and methods for multi-analysis |
| CN110362390A (en) * | 2019-06-06 | 2019-10-22 | 银江股份有限公司 | A kind of distributed data integrated operations dispatching method and device |
| CN110955717A (en) * | 2019-11-19 | 2020-04-03 | 深圳市航通智能技术有限公司 | Visual dynamic display method and system based on big data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113778676A (en) | 2021-12-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11188380B2 (en) | Method and apparatus for processing task in smart device | |
| CN111290854B (en) | Task management method, device, system, computer storage medium and electronic equipment | |
| US10146599B2 (en) | System and method for a generic actor system container application | |
| US9430294B2 (en) | Elastic management framework | |
| CN112486648A (en) | Task scheduling method, device, system, electronic equipment and storage medium | |
| CN108733461B (en) | Distributed task scheduling method and device | |
| CN108132833A (en) | A kind of distributed timing method for scheduling task and device based on zookeeper technologies | |
| CN104572290A (en) | Method and device for controlling message processing threads | |
| CN111625331B (en) | Task scheduling method, device, platform, server and storage medium | |
| CN109656782A (en) | Visual scheduling monitoring method, device and server | |
| CN112181621A (en) | Task scheduling system, method, equipment and storage medium | |
| CN115840631A (en) | RAFT-based high-availability distributed task scheduling method and equipment | |
| CN110569113A (en) | Method and system for scheduling distributed tasks and computer readable storage medium | |
| CN104991823B (en) | The method and apparatus for realizing Javascript multi-task mechanism | |
| CN114924858A (en) | Task scheduling method and device, storage medium and electronic equipment | |
| CN113778676B (en) | Task scheduling system, method, computer device and storage medium | |
| CN114168297A (en) | Method, device, equipment and medium for scheduling collection tasks | |
| US20150067097A1 (en) | Managing data distribution to networked client computing devices | |
| US7614056B1 (en) | Processor specific dispatching in a heterogeneous configuration | |
| CN113032125A (en) | Job scheduling method, device, computer system and computer-readable storage medium | |
| JP2014013473A (en) | Software update device | |
| CN114090201A (en) | Resource scheduling method, device, equipment and storage medium | |
| CN113377360A (en) | Task execution method, device, electronic equipment, storage medium and program product | |
| CN112817992A (en) | Method, device, electronic equipment and readable storage medium for executing change task | |
| Panahi et al. | The design and implementation of service reservations in Real-Time SOA |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |