CN115576673A - Task scheduling method and device - Google Patents
Task scheduling method and device Download PDFInfo
- Publication number
- CN115576673A CN115576673A CN202211293005.9A CN202211293005A CN115576673A CN 115576673 A CN115576673 A CN 115576673A CN 202211293005 A CN202211293005 A CN 202211293005A CN 115576673 A CN115576673 A CN 115576673A
- Authority
- CN
- China
- Prior art keywords
- task
- rerun
- target
- clearing
- dirty data
- 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.)
- Pending
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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
- G06F16/215—Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Quality & Reliability (AREA)
- Data Mining & Analysis (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a task scheduling method and a task scheduling device, wherein the method comprises the following steps: the scheduling system acquires a task to be rerun; determining the task type of the task to be rerun; matching a dirty data clearing scheme for the task to be rerun according to the task type; calling the matched dirty data clearing scheme, and clearing the dirty data corresponding to the task to be rerun; and after the clearing is finished, executing the task to be rerun. By the scheme, the technical problem that the existing scheduling system is only responsible for task scheduling but not responsible for data cleaning to cause excessive dirty data is solved, and the technical effect of effectively removing the dirty data is achieved.
Description
Technical Field
The present application relates to the field of distributed technologies, and in particular, to a task scheduling method and apparatus.
Background
In the current task scheduling system, generally, when a task fails or an execution result is wrong, the current task needs to be rerun, but although a task rerun mechanism exists in the scheduling system, a cleaning operation for a last execution result is not performed, so that more and more dirty data in the system is caused.
In view of the above problems, no effective solution has been proposed.
This section is intended to provide a background or context to the embodiments of the application that are recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.
Disclosure of Invention
The embodiment of the application provides a task scheduling method and device, which are used for reducing dirty data in a system and improving task scheduling efficiency.
An embodiment of the present application provides a task scheduling method, including: the scheduling system acquires a task to be rerun; determining the task type of the task to be rerun; matching a dirty data clearing scheme for the task to be rerun according to the task type; calling the matched dirty data clearing scheme to clear the dirty data corresponding to the task to be rerun; and after the clearing is finished, executing the task to be rerun.
In one embodiment, before the scheduling system acquires the task to be rerun, the method further includes: the scheduling system acquires a target execution task; pushing a re-running parameter configuration interface for executing a task on a target to a target user; receiving configuration parameters input in the configuration interface; configuring the target execution task according to the configuration parameters; and executing the target execution task, and taking the target execution task as the task to be rerun under the condition of determining that the execution fails.
In one embodiment, the configuration parameters include at least one of: the running times and the running interval time can be repeated.
In one embodiment, pushing a rerun parameter configuration interface for performing a task on a target to a target user comprises: determining whether a resume switch of the target execution task is turned on; and under the condition that the rerun switch is determined to be turned on, pushing a rerun parameter configuration interface for executing the task on the target to the target user.
In one embodiment, invoking the matched dirty data removal scheme to remove the dirty data corresponding to the task to be rerun includes: calling the matched dirty data clearing scheme; determining data associated with the task to be rerun in a database; determining data of a current scheduling date from the data associated with the task to be rerun as target data; and executing clearing operation on the target data according to the clearing scheme.
An embodiment of the present application further provides a task scheduling apparatus, located in a scheduling system, including: the first acquisition module is used for acquiring the task to be rerun by the scheduling system; the determining module is used for determining the task type of the task to be rerun; the matching module is used for matching a dirty data clearing scheme for the task to be rerun according to the task type; the clearing module is used for calling the matched dirty data clearing scheme and clearing the dirty data corresponding to the task to be rerun; and the execution module is used for executing the task to be rerun after the clearing is finished.
In one embodiment, the above apparatus further comprises: the second acquisition module is used for acquiring a target execution task before the scheduling system acquires the task to be rerun; the pushing module is used for pushing a rerun parameter configuration interface for executing the task on the target to a target user; the receiving module is used for receiving the configuration parameters input in the configuration interface; the configuration module is used for configuring the target execution task according to the configuration parameters; and the execution module is used for executing the target execution task, and taking the target execution task as the task to be rerun under the condition of determining that the execution fails.
The embodiment of the present application further provides a computer device, which includes a memory, a processor, and a computer program stored on the memory and capable of running on the processor, and when the processor executes the computer program, the task scheduling method is implemented.
An embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the method for scheduling tasks is implemented.
An embodiment of the present application further provides a computer program product, where the computer program product includes a computer program, and when the computer program is executed by a processor, the method for task scheduling described above is implemented.
In the embodiment of the application, a cleaning mechanism for dirty data is set for the scheduling system, after a rerun task is acquired, a corresponding cleaning scheme is scheduled to clean the dirty data, after the cleaning is completed, the rerun task is performed, the technical problem that the existing scheduling system is only responsible for task scheduling and is not responsible for the excessive dirty data caused by data cleaning is solved through the scheme, and the technical effect of effectively cleaning the dirty data is achieved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts. In the drawings:
FIG. 1 is a flowchart of a task scheduling method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of an architecture in which a data clearing mechanism is introduced into a rerun mechanism of a scheduling system according to an embodiment of the present application;
FIG. 3 is a flowchart of a method of one embodiment of a task re-running method in an embodiment of the present application;
fig. 4 is a block diagram of a hardware structure of an electronic device of a task scheduling method in an embodiment of the present application;
fig. 5 is a block diagram of an embodiment of a task scheduling device in the embodiment of the present application.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present application more apparent, the embodiments of the present application are further described in detail below with reference to the accompanying drawings. The exemplary embodiments and descriptions of the present application are provided herein to explain the present application and not to limit the present application.
Considering that when a current task needs to be rerun, although a task rerun mechanism exists in a scheduling system, a cleaning scheme does not exist for a previous processing result before rerun, and generally the cleaning of data is triggered only when data is full in a fixed time point or a database, so that dirty data cannot be cleaned in time.
Therefore, in the embodiment, a data cleaning mechanism can be introduced into the task scheduling system, so that dirty data can be cleaned before rerun, and thus the dirty data can be cleaned timely and efficiently.
Fig. 1 is a flowchart of a task scheduling method according to an embodiment of the present application. Although the present application provides method operational steps or apparatus configurations as illustrated in the following examples or figures, more or fewer operational steps or modular units may be included in the methods or apparatus based on conventional or non-inventive efforts. In the step or structure in which the necessary cause and effect relationship does not logically exist, the execution sequence of the steps or the module structure of the apparatus is not limited to the execution sequence or the module structure described in the embodiment of the present application and shown in the drawings. When the described method or module structure is applied in an actual device or end product, the method or module structure according to the embodiments or shown in the drawings can be executed sequentially or executed in parallel (for example, in a parallel processor or multi-thread processing environment, or even in a distributed processing environment).
Specifically, as shown in fig. 1, the task scheduling method may include the following steps:
step 101: the scheduling system acquires a task to be rerun;
specifically, the scheduling system is a system capable of scheduling a plurality of task flows in the system or application, for example, if the scheduling system is a banking application, the scheduling system may schedule each transfer flow, payment flow, and the like in the banking application to control smooth implementation of each task flow.
For example, if a user currently performs a payment operation and needs to trigger a deduction task, but the task is not completed successfully, the task needs to be rerun so that the deduction can be completed successfully; if the user needs to trigger a deposit task, but the task is not successfully completed, the task needs to be rerun so that the deposit can be successfully completed. However, these tasks may have some data changes in the process of execution, which may be added to the database as new data, but if rerun, the new data becomes dirty data.
In this example, as shown in fig. 2, a data clearing mechanism is introduced into the rerun mechanism of the scheduling system, so that when the task fails to execute and needs to be rerun, dirty data can be cleared first, and then the rerun of the data can be executed.
For the target execution task, parameters such as the re-running times need to be set, for example, the number of re-running times, the time interval of re-running, and the like, for example, for a deduction task, the number of re-running times is 2, and if the re-running times are not successful, a task execution failure can be returned. The time interval of the re-running is, for example, 2 seconds, and then the re-running operation is performed after 2 seconds when it is determined that the execution has failed.
Specifically, before the scheduling system acquires the task to be rerun, the method may include:
s1: the scheduling system acquires a target execution task;
s2: pushing a re-running parameter configuration interface for executing a task on a target to a target user;
s3: receiving configuration parameters input in the configuration interface;
s4: configuring the target execution task according to the configuration parameters;
s5: and executing the target execution task, and taking the target execution task as the task to be rerun under the condition of determining that the execution fails.
Step 102: determining the task type of the task to be rerun;
considering that the process data is stored in different places for different tasks, i.e. different types of tasks, corresponding to the operation on different types of databases, different cleaning schemes may be set based on different types of tasks, and when determining a cleaning scheme, the determination may be based on the type of task.
For example, in a task type: in the case of mysql orientation, the corresponding purging scheme may be: performing delete operation on newly added data in the database in the scheduling period of the current day; in the case of HDFS-oriented, the corresponding purging scheme may be: deleting the newly added directory in the scheduling period of the current day; in the case of a file system, the corresponding purging scheme may be: and executing deletion operation on the newly added files in the scheduling period of the current day.
Step 103: matching a dirty data clearing scheme for the task to be rerun according to the task type;
step 104: calling the matched dirty data clearing scheme to clear the dirty data corresponding to the task to be rerun;
in order to enable the clearing operation to be completed more quickly and accurately when the data is cleared, in this example, it is considered that a new time point can be set for each new data, so that the dirty data which needs to be cleared can be accurately and quickly located based on the new time point set on each data when the data is cleared.
Step 105: and after the clearing is finished, executing the task to be rerun.
In the implementation, considering that for the rerun task, the rerun mechanism is not supported by each task, for this reason, a rerun switch may be set for each task, and for the rerun task, the rerun switch is turned on, and for the unretroble task, the rerun switch is turned off. In order to efficiently realize the restart switch, a "0" is set to indicate that the switch is turned off and a "1" indicates that the switch is turned on during coding, so that the restart switch can be efficiently set.
Specifically, pushing a rerun parameter configuration interface for executing a task on a target to a target user may include: determining whether a resume switch of the target execution task is turned on; and under the condition that the rerun switch is determined to be turned on, pushing a rerun parameter configuration interface for executing the task on the target to the target user.
When data cleaning is executed, the matched dirty data cleaning scheme can be called; determining data associated with the task to be rerun in a database; determining data of a current scheduling date from the data associated with the tasks to be rerun as target data; and executing clearing operation on the target data according to the clearing scheme. That is, the date of the call can be used as the basis for data removal, and the data on the current day can be removed.
The above method is described below with reference to a specific example, however, it should be noted that the specific example is only for better describing the present application and is not to be construed as limiting the present application.
In this example, the task scheduling system may be a task scheduling platform such as Elasitc-Job, easy Scheduler, dolphin Scheduler, etc.; the dirty data may be data or files generated after a previous task is executed, and the data generated before the previous task is useless data, i.e., dirty data, with respect to a task requiring rerun.
Specifically, in this example, a processing method for task rerun in a scheduling system is provided, which solves the problem of dirty data generation in the task rerun mechanism in the current scheduling system by creating a new task rerun mechanism.
To this end, in this example, for the scheduling system, the following modules may be provided to implement data rerun that removes dirty data:
1) A task rerun switch is configured, and a task rerun mechanism can be selectively turned on or off by setting the switch;
2) Selecting a task re-running type, and self-adapting a task re-running scheme according to the current task type, wherein the re-running scheme has a cleaning scheme of dirty data before re-running for different types of tasks.
3) And configuring task re-running parameters, specifically, selecting basic parameters such as re-running times, interval time and the like.
Specifically, a task rerun module is arranged in the scheduling system, a data cleaning module is added for each type of task, and a corresponding data cleaning rule is set.
Specifically, in this example, a task rerun method is provided, which may be as shown in fig. 3, and includes the following steps:
step 301: configuring relevant parameters of task re-running;
step 302: adding a corresponding data cleaning mechanism according to the current task type;
step 303: when the task is executed again, data cleaning is executed in advance, and the dirty data processing left over by the previous task is completed;
step 304: and running the specific re-running task configured by the task module.
In the above example, the dirty data processing process before task rerun is added to the scheduling system level, and corresponding dirty data cleaning strategies are configured corresponding to various task types in the scheduling system, so that the rerun function of the scheduling system is simpler and easier to use.
The method embodiments provided in the above embodiments of the present application may be executed in a mobile terminal, a computer terminal, or a similar computing device. Taking the electronic device as an example, fig. 4 is a block diagram of a hardware structure of the electronic device of the task scheduling method provided in the present application. As shown in fig. 4, the electronic device 10 may include one or more (only one shown in the figure) processors 02 (the processors 02 may include, but are not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA), a memory 04 for storing data, and a transmission module 06 for communication functions. It will be understood by those skilled in the art that the structure shown in fig. 4 is only an illustration and is not intended to limit the structure of the electronic device. For example, the electronic device 10 may also include more or fewer components than shown in FIG. 4, or have a different configuration than shown in FIG. 4.
The memory 04 may be used to store software programs and modules of application software, such as program instructions/modules corresponding to the task scheduling method in the embodiment of the present application, and the processor 02 executes various functional applications and data processing by running the software programs and modules stored in the memory 04, that is, implements the task scheduling method of the application program. The memory 04 may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 04 may further include memory located remotely from the processor 02, which may be connected to the electronic device 10 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission module 06 is used for receiving or transmitting data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the electronic device 10. In one example, the transmission module 06 includes a Network adapter (NIC) that can be connected to other Network devices through a base station so as to communicate with the internet. In one example, the transmission module 06 may be a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.
In the software aspect, the task scheduling device may be as shown in fig. 5, and may include:
a first obtaining module 501, configured to obtain a task to be rerun by a scheduling system;
a determining module 502, configured to determine a task type of the task to be rerun;
a matching module 503, configured to match a dirty data removal scheme for the to-be-rerun task according to the task type;
a clearing module 504, configured to invoke the matched dirty data clearing scheme, and clear the dirty data corresponding to the task to be rerun;
and an executing module 505, configured to execute the task to be rerun after the clearing is completed.
In one embodiment, the task scheduling device may further include: the second acquisition module is used for acquiring a target execution task before the scheduling system acquires the task to be rerun; the pushing module is used for pushing a rerun parameter configuration interface for executing the task on the target to a target user; the receiving module is used for receiving the configuration parameters input in the configuration interface; the configuration module is used for configuring the target execution task according to the configuration parameters; and the execution module is used for executing the target execution task, and taking the target execution task as the task to be rerun under the condition of determining that the execution fails.
In one embodiment, the configuration parameters may include, but are not limited to, at least one of: the running times and the running interval time can be repeated.
In one embodiment, pushing a rerun parameter configuration interface to a target user to perform a task on the target may include: determining whether a resume switch of the target execution task is turned on; and under the condition that the rerun switch is determined to be turned on, pushing a rerun parameter configuration interface for executing the task on the target to the target user.
In an embodiment, the cleaning module 504 may specifically call the matched dirty data cleaning scheme; determining data associated with the task to be rerun in a database; determining data of a current scheduling date from the data associated with the task to be rerun as target data; and executing clearing operation on the target data according to the clearing scheme.
An embodiment of the present application further provides a specific implementation manner of an electronic device, which is capable of implementing all steps in the task scheduling method in the foregoing embodiment, where the electronic device specifically includes the following contents: a processor (processor), a memory (memory), a communication Interface (Communications Interface), and a bus; the processor, the memory and the communication interface complete mutual communication through the bus; the processor is configured to call a computer program in the memory, and when executing the computer program, the processor implements all the steps in the task scheduling method in the foregoing embodiments, for example, when executing the computer program, the processor implements the following steps:
step 1: the scheduling system acquires a task to be rerun;
step 2: determining the task type of the task to be rerun;
and step 3: matching a dirty data clearing scheme for the task to be rerun according to the task type;
and 4, step 4: calling the matched dirty data clearing scheme, and clearing the dirty data corresponding to the task to be rerun;
and 5: and after the clearing is finished, executing the task to be rerun.
An embodiment of the present application further provides a computer-readable storage medium capable of implementing all the steps in the task scheduling method in the foregoing embodiment, where the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the computer program implements all the steps in the task scheduling method in the foregoing embodiment, for example, when the processor executes the computer program, the processor implements the following steps:
step 1: the scheduling system acquires a task to be rerun;
and 2, step: determining the task type of the task to be rerun;
and step 3: matching a dirty data clearing scheme for the task to be rerun according to the task type;
and 4, step 4: calling the matched dirty data clearing scheme to clear the dirty data corresponding to the task to be rerun;
and 5: and after the clearing is finished, executing the task to be rerun.
An embodiment of the present application further provides a computer program product, where the computer program product includes a computer program, and when the computer program is executed by a processor, the method for task scheduling described above is implemented.
In the embodiment of the application, a cleaning mechanism for dirty data is set for the scheduling system, after a re-running task is obtained, a corresponding cleaning scheme is scheduled to clean the dirty data, and after the cleaning is completed, the task re-running is performed.
According to the technical scheme, the data acquisition, storage, use, processing and the like meet relevant regulations of national laws and regulations.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above-mentioned embodiments are further described in detail for the purpose of illustrating the invention, and it should be understood that the above-mentioned embodiments are only illustrative of the present invention and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (10)
1. A method for task scheduling, comprising:
the scheduling system acquires a task to be rerun;
determining the task type of the task to be rerun;
matching a dirty data clearing scheme for the task to be rerun according to the task type;
calling the matched dirty data clearing scheme to clear the dirty data corresponding to the task to be rerun;
and after the clearing is finished, executing the task to be rerun.
2. The method of claim 1, further comprising, prior to the scheduling system obtaining the task to be rerun:
the scheduling system acquires a target execution task;
pushing a re-running parameter configuration interface for executing a task on a target to a target user;
receiving configuration parameters input in the configuration interface;
configuring the target execution task according to the configuration parameters;
and executing the target execution task, and taking the target execution task as the task to be rerun under the condition of determining that the execution fails.
3. The method of claim 2, wherein the configuration parameter comprises at least one of: the running times and the running interval time can be repeated.
4. The method of claim 2, wherein pushing a rerun parameter configuration interface to a target user to perform a task on the target comprises:
determining whether a resume switch of the target execution task is turned on;
and under the condition that the rerun switch is determined to be turned on, pushing a rerun parameter configuration interface for executing the task on the target to the target user.
5. The method according to claim 1, wherein invoking the matched dirty data cleaning scheme to clean the dirty data corresponding to the task to be rerun comprises:
calling the matched dirty data clearing scheme;
determining data associated with the task to be rerun in a database;
determining data of a current scheduling date from the data associated with the task to be rerun as target data;
and executing clearing operation on the target data according to the clearing scheme.
6. A task scheduling apparatus, in a scheduling system, comprising:
the first acquisition module is used for acquiring the task to be rerun by the scheduling system;
the determining module is used for determining the task type of the task to be rerun;
the matching module is used for matching a dirty data clearing scheme for the task to be rerun according to the task type;
the clearing module is used for calling the matched dirty data clearing scheme and clearing the dirty data corresponding to the task to be rerun;
and the execution module is used for executing the task to be rerun after the clearing is finished.
7. The apparatus of claim 6, further comprising:
the second acquisition module is used for acquiring a target execution task before the scheduling system acquires the task to be rerun;
the pushing module is used for pushing a rerun parameter configuration interface for executing the task on the target to a target user;
the receiving module is used for receiving the configuration parameters input in the configuration interface;
the configuration module is used for configuring the target execution task according to the configuration parameters;
and the execution module is used for executing the target execution task, and taking the target execution task as the task to be rerun under the condition of determining that the execution fails.
8. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 5 when executing the computer program.
9. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when executed by a processor, implements the method of any of claims 1 to 5.
10. A computer program product, characterized in that the computer program product comprises a computer program which, when being executed by a processor, carries out the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211293005.9A CN115576673A (en) | 2022-10-21 | 2022-10-21 | Task scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211293005.9A CN115576673A (en) | 2022-10-21 | 2022-10-21 | Task scheduling method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115576673A true CN115576673A (en) | 2023-01-06 |
Family
ID=84587289
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211293005.9A Pending CN115576673A (en) | 2022-10-21 | 2022-10-21 | Task scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115576673A (en) |
-
2022
- 2022-10-21 CN CN202211293005.9A patent/CN115576673A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110225078B (en) | Application service updating method, system and terminal equipment | |
| CN102752136A (en) | Method for operating and scheduling communication equipment | |
| CN109445927B (en) | Task management method and device for storage cluster | |
| CN110134505A (en) | A kind of distributed computing method of group system, system and medium | |
| CN110442480B (en) | Mirror image data cleaning method, device and system | |
| CN103399787B (en) | A kind of MapReduce operation streaming dispatching method and dispatching patcher calculating platform based on Hadoop cloud | |
| CN109358873A (en) | A kind of application program update method, storage medium and terminal device | |
| CN109241099A (en) | A kind of data query method and terminal device | |
| CN104092763A (en) | Application program installation package pushing method and device | |
| CN104503750A (en) | Process clearing method and process clearing device | |
| CN110362394B (en) | Task processing method and device, storage medium and electronic device | |
| CN107463390B (en) | Software upgrading method and upgrading server | |
| CN109725916B (en) | Topology updating system and method for stream processing | |
| CN111221650A (en) | System resource recovery method and device based on process type association | |
| CN114518974A (en) | Checkpoint recovery method, device, equipment and medium for data processing task | |
| CN108958980A (en) | Prevent method, electronic device and the computer readable storage medium of Activity life cycle exception | |
| CN109426554B (en) | Timing implementation method and device for server | |
| CN115576673A (en) | Task scheduling method and device | |
| CN111831452A (en) | Task execution method and device, storage medium and electronic device | |
| CN105760209B (en) | Remove method, apparatus and the automatic elastic group of virtual machine | |
| CN114721801A (en) | Dynamic scheduling method and device for batch task execution time | |
| CN114780177A (en) | Transaction execution method and device, storage medium and electronic device | |
| CN111026526B (en) | Timer configuration method and device for program, storage medium and terminal equipment | |
| CN114281250A (en) | Method and device for cleaning storage file, storage medium and electronic device | |
| CN114398286A (en) | Automatic testing method and device, electronic equipment and storage medium |
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 |