CN112799806A - Timed task processing method and device, computer equipment and readable storage medium - Google Patents
Timed task processing method and device, computer equipment and readable storage medium Download PDFInfo
- Publication number
- CN112799806A CN112799806A CN202110093749.5A CN202110093749A CN112799806A CN 112799806 A CN112799806 A CN 112799806A CN 202110093749 A CN202110093749 A CN 202110093749A CN 112799806 A CN112799806 A CN 112799806A
- Authority
- CN
- China
- Prior art keywords
- preset
- processing
- timing task
- processing node
- task
- 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
- 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/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
-
- 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
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/48—Indexing scheme relating to G06F9/48
- G06F2209/484—Precedence
-
- 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/5017—Task decomposition
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The application belongs to the technical field of research and development management, and provides a timed task processing method and device, computer equipment and a computer readable storage medium. According to the method, the preset timed task is obtained, the current preset processing stage identification of the preset timed task is identified, the preset target processing node identification corresponding to the preset processing stage identification is obtained according to the preset processing stage identification, the preset timed task is sent to the target processing node corresponding to the preset target processing node identification according to the preset target processing node identification, so that the target processing node processes the preset timed task, the target processing node is a first preset timed task processing container constructed based on a DBJob class or a second preset timed task processing container constructed based on a preset Quartz Job class, and the timed task is scheduled and coordinated between the DBJob class and the Quartz Job class, so that the efficiency and the effect of processing the timed task can be improved.
Description
Technical Field
The present application relates to the field of research and development management technologies, and in particular, to a method and an apparatus for processing a timed task, a computer device, and a computer-readable storage medium.
Background
In the traditional technology, two technical means are generally adopted for realizing the timing task, wherein one technical means is the ORACLE native DBJob, and the other technical means is the JAVA third-party component Quartz Job. The two types of JOBs have advantages and disadvantages, some tasks are complex, any one type of JOB cannot realize timing tasks independently, and the two types of JOBs cannot be simply coupled, so that the realization efficiency of the timing tasks is reduced.
Disclosure of Invention
The application provides a timing task processing method and device, computer equipment and a computer readable storage medium, which can solve the problem of low timing task processing efficiency in the prior art.
In a first aspect, the present application provides a method for processing a timing task, including: acquiring a preset timing task, and identifying a current preset processing stage identifier of the preset timing task; acquiring a preset target processing node identifier corresponding to the preset processing stage identifier according to the preset processing stage identifier; and sending the preset timing task to a target processing node corresponding to the preset target processing node identification according to the preset target processing node identification so that the target processing node processes the preset timing task, wherein the target processing node comprises a first preset timing task processing container constructed based on a DBJob class and a second preset timing task processing container constructed based on a Quartz Job class.
In a second aspect, the present application further provides a timed task processing device, including: the device comprises a first acquisition unit, a second acquisition unit and a processing unit, wherein the first acquisition unit is used for acquiring a preset timing task and identifying a current preset processing stage identifier of the preset timing task; a second obtaining unit, configured to obtain, according to the preset processing stage identifier, a preset target processing node identifier corresponding to the preset processing stage identifier; and the sending unit is used for sending the preset timing task to a target processing node corresponding to the preset target processing node identification according to the preset target processing node identification so as to enable the target processing node to process the preset timing task, wherein the target processing node comprises a first preset timing task processing container constructed based on the DBJob class and a second preset timing task processing container constructed based on the Quartz Job class.
In a third aspect, the present application further provides a computer device, which includes a memory and a processor, where the memory stores a computer program, and the processor implements the steps of the timed task processing method when executing the computer program.
In a fourth aspect, the present application further provides a computer readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform the steps of the timed task processing method.
The application provides a timing task processing method and device, computer equipment and a computer readable storage medium. This application is through acquireing preset timing task, and discernment preset processing stage sign at the time of preset timing task, according to preset processing stage sign, acquire preset target processing node sign that preset processing stage sign corresponds, according to preset target processing node sign, will preset timing task send to preset target processing node that target processing node sign corresponds, so that target processing node will preset timing task handles, wherein, target processing node is for the first preset timing task processing container that founds based on DBJob class or for the second preset timing task processing container that founds based on predetermineeing quartzJob class. The preset timing task is sent to the target processing node constructed based on the DBJob class or the target processing node constructed based on the Quartz Job class, so that the preset timing task is processed, the target processing node constructed based on the DBJob class and the target processing node constructed based on the Quartz Job class are integrated, the preset timing task can be scheduled and coordinated between the target processing node constructed based on the DBJob class and the target processing node constructed based on the Quartz Job class, the respective advantages of the DBJob class and the Quartz Job class in the processing timing task are fully utilized, the respective defects of the DBJob class and the Quartz Job class in the processing timing task are avoided, particularly for complex tasks, the DBJob class and the Quartz Job class are combined to process the timing task, the preset timing task is scheduled between the two types of JOBs on the two types of JOBs, and the two types of JOBs can flexibly process the preset timing task in a coordinated manner, the efficiency and effect of processing the timing task can be improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic flowchart of a method for processing a timed task according to an embodiment of the present application;
fig. 2 is a schematic view of a first sub-flow of a timing task processing method according to an embodiment of the present application;
fig. 3 is a second sub-flowchart of a method for processing a timed task according to an embodiment of the present application;
fig. 4 is a third sub-flow diagram of a timing task processing method according to an embodiment of the present application;
fig. 5 is a fourth sub-flowchart of the method for processing a timed task according to the embodiment of the present application;
FIG. 6 is a schematic block diagram of a timed task processing apparatus provided in an embodiment of the present application; and
fig. 7 is a schematic block diagram of a computer device provided in an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
Referring to fig. 1, fig. 1 is a schematic flowchart of a method for processing a timed task according to an embodiment of the present application. As shown in FIG. 1, the method includes the following steps S11-S13:
and S11, acquiring a preset timing task, and identifying the current preset processing stage identifier of the preset timing task.
Specifically, for a complex preset timing task, a processing procedure of the preset timing task may be divided into a plurality of processing stages (i.e., a plurality of processing steps), each processing stage processes the preset timing task correspondingly, each processing stage is preset with a corresponding preset processing stage identifier, and all the processing stages jointly form a complete processing procedure of the preset timing task.
After a preset timing task is obtained, according to the preset timing task, a current preset processing stage identifier included in the preset timing task is identified, where the preset processing stage identifier may be a preset processing number corresponding to each processing stage, or a processing result corresponding to a previous processing stage corresponding to each processing stage, so as to describe what processing needs to be performed next by the timing task.
And S12, acquiring a preset target processing node identifier corresponding to the preset processing stage identifier according to the preset processing stage identifier.
Specifically, after the preset timing task is divided into a plurality of processing stages, a preset processing node corresponding to each preset processing stage may be preset, so that each preset processing node processes the content of the corresponding preset processing stage in the preset timing task. Wherein, the preset processing stages and the preset processing nodes corresponding to the preset processing stages can be matched with the preset processing stage identifiers corresponding to the preset processing stages and the preset processing node identifiers corresponding to the preset processing nodes, which processing stage is processed by which processing node is described by the preset matching relationship between the preset processing stage identifiers and the preset processing node identifiers, different processing stages in the timed tasks are processed by different preset processing nodes, each preset processing node can process the timed tasks based on the JOBs of different processed timed tasks, so that each type of JOB can fully utilize the advantages of itself to process the contents of the timed tasks which are good for processing, and the disadvantages of each type of JOB in the process of the timed tasks are avoided, therefore, various JOBs for processing the timing task are integrated to complete the complex timing task, the processing efficiency and the processing quality of the timing task are improved, and inconvenience caused by processing the timing task by adopting a single JOB is avoided.
After the current preset processing stage identifier of the preset timing task is acquired, acquiring a preset target processing node identifier corresponding to the preset processing stage identifier from a preset processing flow corresponding to the preset timing task according to the preset processing stage identifier, and thus determining which preset target processing node the timing task should be processed by according to the preset target processing node identifier.
And S13, sending the preset timing task to a target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timing task, wherein the target processing node comprises a first preset timing task processing container constructed based on the DBJob class and a second preset timing task processing container constructed based on the Quartz Job class.
Specifically, after acquiring the preset target processing node identifier, determining which preset target processing node the timing task is processed by according to the preset target processing node identifier, and sending the preset timing task to the preset target processing node corresponding to the preset target processing node identifier, so that the target processing node processes the preset timing task, where the target processing node includes a first preset timing task processing container constructed based on the DBJob class and a second preset timing task processing container constructed based on the preset QuartzJob class, that is, the preset timing task is processed through the first preset timing task processing container constructed based on the DBJob class or the second preset timing task processing container constructed based on the preset QuartzJob class, and as for whether the preset timing task is processed through the first preset timing task processing container constructed based on the DBJob class or the second preset timing task processing container constructed based on the preset QuartzJob class Processing, namely, according to preset determination, presetting to process the preset timing task through a first preset timing task processing container constructed by a DBJob class, at the moment, processing the preset timing task through the first preset timing task processing container constructed by the DBJob class, presetting to process the preset timing task through a second preset timing task processing container constructed by the preset Quartz Job class, at the moment, processing the preset timing task through a second preset timing task processing container constructed by the preset Quartz Job class, so as to realize scheduling and coordination of the timing task between the DBJob class and the Quartz Job class, realize interaction of the DBJob class and the Quartz Job class, fully utilize the advantages of the DBJob class and the Quartz Job class in processing the timing task, realize integration of the DBJob class and the Quartz Job class to process complex timing tasks, and realize that the JOB of DB and the JOB of JAVA can assist cooperation, the method solves the application scene of more complex timing tasks and can improve the processing efficiency of the complex timing tasks.
In the embodiment of the application, a preset timing task is acquired, a current preset processing stage identifier of the preset timing task is identified, a preset target processing node identifier corresponding to the preset processing stage identifier is acquired according to the preset processing stage identifier, and the preset timing task is sent to a target processing node corresponding to the preset target processing node identifier so that the target processing node can process the preset timing task, wherein the target processing node is a first preset timing task processing container constructed based on a DBJob class or a second preset timing task processing container constructed based on a preset quarttzjob class. The preset timing task is sent to the target processing node constructed based on the DBJob class or the target processing node constructed based on the Quartz Job class, so that the preset timing task is processed, the target processing node constructed based on the DBJob class and the target processing node constructed based on the Quartz Job class are integrated, the preset timing task can be scheduled and coordinated between the target processing node constructed based on the DBJob class and the target processing node constructed based on the Quartz Job class, the respective advantages of the DBJob class and the Quartz Job class in the processing timing task are fully utilized, the respective defects of the DBJob class and the Quartz Job class in the processing timing task are avoided, particularly for complex tasks, the DBJob class and the Quartz Job class are combined to process the timing task, the preset timing task is scheduled between the two types of JOBs on the two types of JOBs, and the two types of JOBs can flexibly process the preset timing task in a coordinated manner, the efficiency and effect of processing the timing task can be improved.
In an embodiment, after the step of sending the preset timing task to the target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timing task, the method further includes:
if it is monitored that the target processing node successfully processes the preset timing task, acquiring a next preset processing node identifier corresponding to the preset timing task, and processing the preset timing task according to the next preset processing node identifier until all preset processing nodes corresponding to the preset timing task respectively successfully process the preset timing task.
Specifically, the processing state of the target processing node on the corresponding processing stage in the timed task is monitored, if it is monitored that a preset target processing node successfully completes processing on the corresponding processing stage in the timed task, the next preset processing node identifier corresponding to the preset timed task is obtained, and sending the preset timing task to a next preset target processing node corresponding to the next preset processing node identification according to the next preset processing node identification, and enabling the next preset target processing node to process the timing task, and circulating the processing process of processing the preset timing task until all the preset processing nodes corresponding to the preset timing task successfully process the preset timing task, thereby finishing the processing of the timing task.
In the embodiment of the application, by acquiring a preset timing task, identifying a current preset processing stage identifier of the preset timing task, acquiring a preset target processing node identifier corresponding to the preset processing stage identifier according to the preset processing stage identifier, sending the preset timing task to a target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timing task, wherein the target processing node is a first preset timing task processing container constructed based on a dbjobe class or a second preset timing task processing container constructed based on a preset quarttzjobe class, and if the target processing node is monitored to process the preset timing task successfully, acquiring a next preset processing node identifier corresponding to the preset timing task, and processing the preset timing task according to the next preset processing node identifier until all preset processing nodes corresponding to the preset timing task successfully process the preset timing task respectively, and scheduling and coordinating the timing task between the target processing node constructed based on the DBJob class and the target processing node constructed based on the Quartz Job class by monitoring the processing states of the target processing nodes constructed based on the DBJob class and the target processing nodes constructed based on the Quartz Job class respectively for processing the timing task, so that the respective advantages of the DBJob class and the Quartz Job class in processing the timing task are fully utilized, the respective defects of the DBJob class and the Quartz Job class in processing the timing task are avoided, particularly for complex tasks, the DBJob class and the Quartz Job class are combined to process the timing task, and the efficiency and the effect of processing the timing task can be improved.
Referring to fig. 2, fig. 2 is a schematic view of a first sub-flow of a timed task processing method according to an embodiment of the present application. As shown in fig. 2, in this embodiment, the step of acquiring the preset timing task includes:
s21, monitoring a plurality of preset third-party timing tasks based on the DBJob class;
and S22, if the processing state corresponding to the preset third-party timing task is monitored to be a stage successful completion state, acquiring the preset third-party timing task.
Specifically, because the third-party timing task is generally a single product line, only the timing task function corresponding to the product line is processed, and for a complex timing task, especially an integrated system including a plurality of timing tasks, the DBJob class can implement a monitoring function, but the DBJob class cannot implement processing of the plurality of timing tasks, and the quarttzjob class can implement processing of the plurality of timing tasks, but cannot implement monitoring of the timing tasks. In the embodiment of the application, a plurality of preset third-party timing tasks are monitored based on a preset DBJob class, if the processing state corresponding to the preset third-party timing task is monitored to be a stage successful completion state, the preset third-party timing task is obtained, and the preset timing task is interacted between a target processing node constructed based on the DBJob class and a target processing node constructed based on the Quartz Job class in the following, so that the DBJob class and the Quartz Job class are combined to realize integrated processing of the plurality of timing tasks, respective advantages of the DBJob class and the Quartz Job class in the processing timing tasks can be fully utilized, respective defects of the DBJob class and the Quartz Job class in the processing timing tasks are avoided, particularly for complex tasks, the DBJob class and the Quartz Job class are combined to process the timing tasks, compared with the traditional technology, the DBJob class or the Quartz Job class is only adopted to process the timing tasks, and the DBJob class or the Quartz Job class is combined to form the quartz Job class, and scheduling and coordinating are carried out between the DBJob class and the Quartz Job class, so that a plurality of timing tasks are processed simultaneously, automatic batching processing of the timing tasks can be realized, and the efficiency and the effect of processing the timing tasks are improved.
Referring to fig. 3, fig. 3 is a second sub-flowchart of a method for processing a timed task according to an embodiment of the present application. As shown in fig. 3, in this embodiment, the step of obtaining, according to the preset processing stage identifier, a preset target processing node identifier corresponding to the preset processing stage identifier includes:
s31, acquiring a preset timing task processing flow configuration table corresponding to the preset processing stage identifier according to the preset processing stage identifier;
s32, acquiring a preset timing task processing flow corresponding to the preset processing stage identifier according to the preset timing task processing flow configuration table;
and S33, acquiring a preset target processing node identifier corresponding to the preset processing stage identifier according to the preset timed task processing flow.
Specifically, for each preset timing task, a preset timing task processing flow corresponding to the preset timing task may be configured and processed through a preset timing task processing flow configuration table corresponding to the preset timing task, where the preset timing task processing flow includes all preset processing stage identifiers included in each preset timing task and a preset target processing node identifier corresponding to each preset processing stage identifier, so as to form a matching relationship between the preset processing stage identifiers included in each preset timing task and the preset target processing node identifiers corresponding to the preset processing stage identifiers, so as to describe which preset target processing node each preset processing node of the preset timing task is preset to be processed by, and each preset timing task processing flow configuration table may include preset timing task processing flows corresponding to a plurality of preset timing tasks, therefore, automatic batching of a plurality of timing tasks is realized.
After acquiring the current preset processing stage identifier of the preset timing task, acquiring a preset timing task processing flow configuration table corresponding to the preset processing stage identifier according to the preset processing stage identifier, acquiring a preset timed task processing flow corresponding to the preset timed task from the preset timed task processing flow configuration table according to the preset timed task processing flow configuration table, namely the preset timed task processing flow corresponding to the preset processing stage identifier, acquiring a preset target processing node identifier corresponding to the preset processing stage identifier according to the preset timed task processing flow, and then determining which preset target processing node is used for processing the preset timing task in the current preset processing stage, and subsequently sending the preset timing task to the corresponding preset target processing node for processing.
In the embodiment of the present application, when a target processing node constructed based on a dbjobb class and a target processing node constructed based on a quartzjobb class are integrated to implement processing of a timed task, especially when automatic batching of complex multitasks is implemented, a preset timed task processing flow corresponding to each preset timed task may be configured through a preset timed task processing flow configuration table, where the preset timed task processing flow includes a preset processing stage identifier included in each preset timed task and a matching relationship between the preset target processing node identifiers corresponding to the preset processing stage identifier, so as to describe which preset target processing node each preset processing node of the preset timed task is preset to process, and manually may specify which preset target processing node each preset processing node is preset to process, and may perform processing on the preset processing stage identifier and the matching between the preset target processing node identifiers corresponding to the preset processing stage identifier according to needs The matching relation is updated to realize right the flexible processing of the preset timing task, the preset timing task processing flow configuration table is visual and can be displayed for technical personnel to check and configure, compared with the prior art, any type of JOB is adopted to independently realize the timing task, the preset timing task runs in a memory, and right the preset timing task processing flow corresponding to the preset timing task is not visual and right the problem that the preset timing task processing flow cannot be edited is solved.
Referring to fig. 4, fig. 4 is a third sub-flow diagram of a timed task processing method according to an embodiment of the present application. As shown in fig. 4, in this embodiment, the step of obtaining, according to the preset processing stage identifier, a preset timing task processing flow configuration table corresponding to the preset processing stage identifier includes:
s41, determining a preset timing task processing flow configuration table identifier corresponding to the preset processing stage identifier according to the preset processing stage identifier;
and S42, acquiring a preset timing task processing flow configuration table corresponding to the preset processing stage identifier according to the preset timing task processing flow configuration table identifier.
Specifically, not only can one preset timed task processing flow configuration table include the set-time task processing flows corresponding to the multiple preset timed tasks, so that the multiple preset timed tasks can be processed, but also multiple preset timed task processing flow configuration tables can be set, and each preset timed task processing flow configuration table can include the set-time task processing flows corresponding to the multiple preset timed tasks, so that the batch processing of the preset timed tasks is realized.
Aiming at the situation that a plurality of preset timed task processing flow configuration tables exist, each preset timed task processing flow configuration table comprises a set timed task processing flow corresponding to a plurality of preset timed tasks, according to the preset processing stage identification, a preset timed task processing flow configuration table corresponding to the preset processing stage identification is determined from the plurality of preset timed task processing flow configuration tables, the preset timed task processing flow configuration table corresponding to the preset timed task processing flow configuration table identification can be determined by determining the preset timed task processing flow configuration table identification corresponding to the preset processing stage identification, then the preset timed task processing flow configuration table corresponding to the preset processing stage identification is obtained according to the set timed task processing flow configuration table identification, and further the batch automatic batching of the timed tasks can be realized, especially, in a complex system, for example, an e-commerce system, when automatic batching for processing a large batch of timing tasks is required, the efficiency of automatic batching for the timing tasks can be improved.
In an embodiment, the step of sending the preset timing task to the target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timing task includes:
and according to each preset target processing node identifier, sending the preset timing tasks corresponding to the preset target processing node identifiers to the target processing nodes corresponding to the preset target processing node identifiers in a concurrent manner, so that each target processing node processes the corresponding preset timing task.
Specifically, when batch timing tasks are processed, a first preset timing task processing container constructed based on a dbjobclass and a second preset timing task processing container constructed based on a preset quartz jobclass are integrated in one system, and because each processing node is adopted to process a corresponding preset processing stage in the preset timing tasks, a plurality of first preset timing task processing containers based on the dbjobclass and a plurality of second preset timing task processing containers based on the preset quartz jobclass can be constructed, and each constructed container is used as a processing node corresponding to one processing stage in the timing tasks, so that a plurality of processing nodes are formed.
If a plurality of preset timed tasks are simultaneously obtained, and the current preset processing stage identifier of each preset timed task is obtained, the preset target processing node identifier corresponding to each preset processing stage identifier is obtained according to each preset processing stage identifier, the preset timed tasks corresponding to the preset target processing node identifiers are sent to the target processing nodes corresponding to the preset target processing node identifiers in a concurrent mode according to each preset target processing node identifier, so that each target processing node processes the corresponding preset timed tasks, and therefore the preset timed tasks corresponding to the first preset timed task processing containers based on the DBJob class and the preset timed tasks corresponding to the second preset timed task processing containers based on the Quartz Job class are processed by the first preset timed task processing containers, and the concurrent processing of batch timed tasks can be realized, compared with the prior art that a single-thread sequential timing task processing mode is adopted in a single-class JOB timing task processing mode, in the embodiment of the application, a plurality of processing nodes are constructed based on integration of a dbjobb class and a quartzjobb class, each processing node independently processes a corresponding preset processing stage in the preset timing task, and the plurality of processing nodes can process a plurality of corresponding preset processing stages in the plurality of preset timing tasks, so that concurrent execution of batch timing tasks can be realized in a multi-thread mode, and the processing efficiency of the batch preset timing tasks can be improved.
Further, the concurrency number of all preset timing tasks can be adjusted, the concurrency number of all the preset timing tasks comprises the total concurrency number of all the JOBs and the maximum concurrency number of each JOB, the concurrency number of each JOB can be adjusted in real time, each JOB with the maximum concurrency number larger than 1 can be monitored, if the JOB is operated at full load for more than half an hour, the maximum concurrency number is increased, the maximum concurrency number cannot exceed one time of the original concurrency number, and therefore dynamic efficiency adjustment of the preset timing tasks is achieved.
Referring to fig. 5, fig. 5 is a fourth sub-flowchart illustrating a method for processing a timed task according to an embodiment of the present application. As shown in fig. 5, in this embodiment, the step of sending the preset timing task to the target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timing task includes:
s51, judging whether the preset node type corresponding to the preset target processing node identification is a preset DBJob type processing node identification or not;
s52, if the preset target processing node identification is a preset DBJob type processing node identification, sending the preset timing task to a first preset timing task processing container constructed based on the DBJob type, so that the first preset timing task processing container processes the preset timing task;
and S53, if the preset target processing node identification is not the preset DBJob type processing node identification, sending the preset timing task to a second preset timing task processing container constructed based on the DBJob type, so that the second preset timing task processing container processes the preset timing task.
Specifically, in an integrated system of a first preset timing task processing container constructed based on a DBJob class and a second preset timing task processing container constructed based on a preset quartz job class, the preset timing task may be sent to a target processing node corresponding to the preset processing node number according to a preset target processing node identifier, such as a preset processing node number, so that the target processing node processes the preset timing task. In another case, the preset timing task may be sent to a target processing node corresponding to a preset node type to which the preset target processing node identifier belongs according to a preset node type to which the preset target processing node identifier belongs, so that the target processing node processes the preset timing task, and by determining whether the preset node type corresponding to the preset target processing node identifier is a preset DBJob type processing node identifier, if the preset target processing node identifier is a preset DBJob type processing node identifier, the preset timing task may be sent to a first preset timing task processing container constructed based on DBJob types, so that the first preset timing task processing container processes the preset timing task, and if the preset target processing node identifier is not the preset DBJob type processing node identifier, namely, the preset target processing node identification is a preset Quartz Job type processing node identification, the preset timing task is sent to a second preset timing task processing container constructed based on a DBJob type, so that the second preset timed task processing container processes the preset timed task, wherein the first preset timed task processing container and the second preset timed task processing container can be respectively provided with a plurality of containers, when the preset timed task is sent to the first preset timed task processing container or the second preset timed task processing container, the preset timing task can be sent to a processing node corresponding to one of the first preset timing task processing containers or a processing node corresponding to one of the second preset timing task processing containers in a random manner, and the preset timing task is processed.
In an embodiment, after the step of monitoring that the target processing node successfully processes the preset timing task is performed, the method further includes:
acquiring a preset priority level corresponding to the preset timing task;
judging whether other preset timing tasks corresponding to other preset priority levels higher than the preset priority level exist or not;
if other preset timing tasks corresponding to other preset priority levels higher than the preset priority level exist, executing the processing of the other preset timing tasks, and pausing the timing tasks;
and if other preset timing tasks corresponding to other preset priority levels higher than the preset priority level do not exist, executing the step of acquiring a next preset processing node identifier corresponding to the preset timing task and processing the preset timing task according to the next preset processing node identifier.
Specifically, for the processing of a plurality of preset timing tasks, a preset priority level for processing can be set for each preset timing task, and the plurality of timing tasks are respectively processed according to the high-low sequence of the preset priority level, so that the preset timing tasks with high priority levels are subjected to priority processing, thereby ensuring that the important preset timing tasks with high priority levels are processed in time, and improving the efficiency and efficiency of the processing of the important preset timing tasks.
If it is monitored that the target processing node successfully processes the preset timing task, acquiring a preset priority level corresponding to the preset timing task, judging whether other preset timing tasks corresponding to other preset priority levels higher than the preset priority level exist, if other preset timing tasks corresponding to other preset priority levels higher than the preset priority level exist, preferentially executing the processing of the other preset timing tasks, suspending the timing task, if other preset timing tasks corresponding to other preset priority levels higher than the preset priority level do not exist, acquiring a next preset processing node identifier corresponding to the preset timing task, and processing the preset timing task according to the next preset processing node identifier, and circulating the processing process of the preset timing task until all the preset processing nodes corresponding to the preset timing task successfully process the preset timing task respectively, thereby completing the processing of the preset timing task and automatically realizing the concurrent processing of the requests with high priority and large demand.
In an embodiment, after the step of monitoring that the target processing node successfully processes the preset timing task is performed, the method further includes:
judging whether the preset timing task has a corresponding preset breakpoint or not;
if the preset timed task has a corresponding preset breakpoint, performing corresponding breakpoint processing on the preset timed task;
and if the preset timed task does not have the corresponding preset breakpoint, executing the step of acquiring the next preset processing node identifier corresponding to the preset timed task and processing the preset timed task according to the next preset processing node identifier.
Wherein, the Breakpoint is Breakpoint, and the english is Breakpoint, which can interrupt the program at the required place.
Specifically, after the step that the target processing node successfully processes the preset timed task is monitored, whether the preset timed task has a corresponding preset breakpoint or not can be judged, if the preset timed task has a corresponding preset breakpoint, the preset timed task is correspondingly processed, after the breakpoint corresponding to the preset timed task is processed, the preset timed task is continued, that is, the step of obtaining a next preset processing node identifier corresponding to the preset timed task and processing the preset timed task according to the next preset processing node identifier is continuously executed, if the preset timed task does not have a corresponding preset breakpoint, the step of obtaining a next preset processing node identifier corresponding to the preset timed task is continuously executed, and processing the preset timing task according to the next preset processing node identification until all preset processing nodes corresponding to the preset timing task respectively process the preset timing task successfully. In the embodiment of the application, different processing nodes are adopted to process the corresponding preset processing stages in the preset timed tasks according to actual needs, so that after each preset processing stage in the preset timed tasks is processed, whether the preset timed tasks have corresponding preset breakpoints or not is judged, if the preset timed tasks have corresponding preset breakpoints, the preset timed tasks are processed at the corresponding breakpoints, whether the preset breakpoints are processed or not is judged, if the preset breakpoints are processed, the preset timed tasks can be continuously executed, so as to realize the continuation of the preset timed tasks, namely after the breakpoints corresponding to the preset timed tasks are processed, namely, the next preset processing node identifier corresponding to the preset timed tasks is continuously obtained, and processing the preset timed task according to the next preset processing node identifier, if the preset timed task has no corresponding preset breakpoint, executing the steps of obtaining the next preset processing node identifier corresponding to the preset timed task and processing the preset timed task according to the next preset processing node identifier until all preset processing nodes corresponding to the preset timed task respectively successfully process the preset timed task, aiming at automatic batching and concurrent execution of the timed task, the embodiment of the application can improve the convenience of the breakpoint and the continuation of the preset timed task, thereby realizing manual real-time intervention processing in the preset timed task processing process, in particular to JOB implementation process, facilitating manual intervention aiming at abnormal conditions, and not influencing batch processing and concurrent execution of other preset timed tasks, therefore, the processing efficiency of a plurality of tasks in preset time can be improved.
It should be noted that, the timing task processing method described in each of the above embodiments may recombine the technical features included in different embodiments as needed to obtain a combined implementation, but all of them are within the protection scope claimed in the present application.
Referring to fig. 6, fig. 6 is a schematic block diagram of a timed task processing device according to an embodiment of the present application. Corresponding to the timing task processing method, the embodiment of the application also provides a timing task processing device. As shown in fig. 6, the timed task processing apparatus includes a unit for executing the above-described timed task processing method, and the timed task processing apparatus may be configured in a computer device. Specifically, referring to fig. 6, the timed task processing device 60 includes a first obtaining unit 61, a second obtaining unit 62 and a sending unit 63.
The first obtaining unit 61 is configured to obtain a preset timing task, and identify a current preset processing stage identifier of the preset timing task;
a second obtaining unit 62, configured to obtain, according to the preset processing stage identifier, a preset target processing node identifier corresponding to the preset processing stage identifier;
a sending unit 63, configured to send the preset timing task to a target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timing task, where the target processing node includes a first preset timing task processing container constructed based on the DBJob class and a second preset timing task processing container constructed based on the quarttzjob class.
In one embodiment, the timed task processing device 60 further includes:
and the third obtaining unit is used for obtaining a next preset processing node identifier corresponding to the preset timing task if it is monitored that the preset timing task is successfully processed by the target processing node, and processing the preset timing task according to the next preset processing node identifier until all preset processing nodes corresponding to the preset timing task respectively successfully process the preset timing task.
In one embodiment, the first obtaining unit 61 includes:
the monitoring subunit is used for monitoring a plurality of preset third-party timing tasks based on the DBJob class;
and the first obtaining subunit is configured to obtain the preset third-party timing task if it is monitored that the processing state corresponding to the preset third-party timing task is a periodic successful completion state.
In one embodiment, the second obtaining unit 62 includes:
the second acquiring subunit is configured to acquire, according to the preset processing stage identifier, a preset timing task processing flow configuration table corresponding to the preset processing stage identifier;
a third obtaining subunit, configured to obtain, according to the preset timed task processing flow configuration table, a preset timed task processing flow corresponding to the preset processing stage identifier;
and the fourth acquiring subunit is configured to acquire, according to the preset timed task processing flow, a preset target processing node identifier corresponding to the preset processing stage identifier.
In an embodiment, the second acquiring subunit includes:
the determining subunit is configured to determine, according to the preset processing stage identifier, a preset timed task processing flow configuration table identifier corresponding to the preset processing stage identifier;
and the fifth acquiring subunit is configured to acquire the preset timing task processing flow configuration table corresponding to the preset processing stage identifier according to the preset timing task processing flow configuration table identifier.
In an embodiment, the sending unit 63 is specifically configured to send, according to each preset target processing node identifier, a preset timing task corresponding to each of the plurality of preset target processing node identifiers to a target processing node corresponding to each of the preset target processing node identifiers in a concurrent manner, so that each target processing node processes the corresponding preset timing task.
In one embodiment, the sending unit 63 includes:
a judging subunit, configured to judge whether a preset node type corresponding to the preset target processing node identifier is a preset dbjobclass processing node identifier;
the first sending subunit is configured to send the preset timing task to a first preset timing task processing container constructed based on the dbjoba class if the preset target processing node identifier is a preset dbjoba class processing node identifier, so that the first preset timing task processing container processes the preset timing task;
and the second sending subunit is configured to send the preset timing task to a second preset timing task processing container constructed based on the dbjoba class if the preset target processing node identifier is not the preset dbjoba class processing node identifier, so that the second preset timing task processing container processes the preset timing task.
It should be noted that, as can be clearly understood by those skilled in the art, the specific implementation processes of the timing task processing apparatus and each unit may refer to the corresponding descriptions in the foregoing method embodiments, and for convenience and brevity of description, no further description is provided herein.
Meanwhile, the division and connection manner of each unit in the above described timed task processing device are only used for illustration, in other embodiments, the timed task processing device may be divided into different units as required, or each unit in the timed task processing device may adopt different connection order and manner to complete all or part of the functions of the above described timed task processing device.
The above-mentioned timed task processing means may be implemented in the form of a computer program that can be run on a computer device as shown in fig. 7.
Referring to fig. 7, fig. 7 is a schematic block diagram of a computer device according to an embodiment of the present application. The computer device 500 may be a computer device such as a desktop computer or a server, or may be a component or part of another device.
Referring to fig. 7, the computer device 500 includes a processor 502, a memory, which may include a non-volatile storage medium 503 and an internal memory 504, which may also be a volatile storage medium, and a network interface 505 connected by a system bus 501.
The non-volatile storage medium 503 may store an operating system 5031 and a computer program 5032. The computer program 5032, when executed, may cause the processor 502 to perform the steps of the timed task processing method described above.
The processor 502 is used to provide computing and control capabilities to support the operation of the overall computer device 500.
The internal memory 504 provides an environment for the operation of the computer program 5032 in the non-volatile storage medium 503, and when the computer program 5032 is executed by the processor 502, the processor 502 can be enabled to execute a timing task processing method as described above.
The network interface 505 is used for network communication with other devices. Those skilled in the art will appreciate that the configuration shown in fig. 7 is a block diagram of only a portion of the configuration associated with the present application and does not constitute a limitation of the computer device 500 to which the present application may be applied, and that a particular computer device 500 may include more or less components than those shown, or may combine certain components, or have a different arrangement of components. For example, in some embodiments, the computer device may only include a memory and a processor, and in such embodiments, the structures and functions of the memory and the processor are consistent with those of the embodiment shown in fig. 7, and are not described herein again.
Wherein the processor 502 is configured to run the computer program 5032 stored in the memory to implement the following steps: acquiring a preset timing task, and identifying a current preset processing stage identifier of the preset timing task; acquiring a preset target processing node identifier corresponding to the preset processing stage identifier according to the preset processing stage identifier; and sending the preset timing task to a target processing node corresponding to the preset target processing node identification according to the preset target processing node identification so that the target processing node processes the preset timing task, wherein the target processing node comprises a first preset timing task processing container constructed based on a DBJob class and a second preset timing task processing container constructed based on a Quartz Job class.
In an embodiment, after implementing the step of sending the preset timing task to the target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timing task, the processor 502 further implements the following steps:
if it is monitored that the target processing node successfully processes the preset timing task, acquiring a next preset processing node identifier corresponding to the preset timing task, and processing the preset timing task according to the next preset processing node identifier until all preset processing nodes corresponding to the preset timing task respectively successfully process the preset timing task.
In an embodiment, when the processor 502 implements the step of acquiring the preset timing task, the following steps are specifically implemented:
monitoring a plurality of preset third-party timing tasks based on the DBJob class;
and if the processing state corresponding to the preset third-party timing task is a stage successful completion state, acquiring the preset third-party timing task.
In an embodiment, when the processor 502 implements the step of obtaining the preset target processing node identifier corresponding to the preset processing stage identifier according to the preset processing stage identifier, the following steps are specifically implemented:
acquiring a preset timing task processing flow configuration table corresponding to the preset processing stage identifier according to the preset processing stage identifier;
acquiring a preset timing task processing flow corresponding to the preset processing stage identifier according to the preset timing task processing flow configuration table;
and acquiring a preset target processing node identifier corresponding to the preset processing stage identifier according to the preset timed task processing flow.
In an embodiment, when the processor 502 implements the step of obtaining the preset timing task processing flow configuration table corresponding to the preset processing stage identifier according to the preset processing stage identifier, the following steps are specifically implemented:
determining a preset timing task processing flow configuration table identifier corresponding to the preset processing stage identifier according to the preset processing stage identifier;
and acquiring a preset timing task processing flow configuration table corresponding to the preset processing stage identifier according to the preset timing task processing flow configuration table identifier.
In an embodiment, when the processor 502 implements the step of sending the preset timing task to the target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timing task, the following steps are specifically implemented:
and according to each preset target processing node identifier, sending the preset timing tasks corresponding to the preset target processing node identifiers to the target processing nodes corresponding to the preset target processing node identifiers in a concurrent manner, so that each target processing node processes the corresponding preset timing task.
In an embodiment, when the processor 502 implements the step of sending the preset timing task to the target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timing task, the following steps are specifically implemented:
judging whether a preset node type corresponding to the preset target processing node identification is a preset DBJob type processing node identification or not;
if the preset target processing node identification is a preset DBJob type processing node identification, sending the preset timing task to a first preset timing task processing container constructed based on the DBJob type, so that the first preset timing task processing container processes the preset timing task;
and if the preset target processing node identification is not the preset DBJob type processing node identification, sending the preset timing task to a second preset timing task processing container constructed based on the DBJob type, so that the second preset timing task processing container processes the preset timing task.
It should be understood that in the embodiment of the present Application, the Processor 502 may be a Central Processing Unit (CPU), and the Processor 502 may also be other general-purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, and the like. Wherein a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
It will be understood by those skilled in the art that all or part of the processes in the method for implementing the above embodiments may be implemented by a computer program, and the computer program may be stored in a computer readable storage medium. The computer program is executed by at least one processor in the computer system to implement the flow steps of the embodiments of the method described above.
Accordingly, the present application also provides a computer-readable storage medium. The computer-readable storage medium may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium, the computer-readable storage medium storing a computer program that, when executed by a processor, causes the processor to perform the steps of:
a computer program product which, when run on a computer, causes the computer to perform the steps of the timed task processing method described in the embodiments above.
The computer readable storage medium may be an internal storage unit of the aforementioned device, such as a hard disk or a memory of the device. The computer readable storage medium may also be an external storage device of the device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), etc. provided on the device. Further, the computer-readable storage medium may also include both an internal storage unit and an external storage device of the apparatus.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described apparatuses, devices and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
The storage medium is an entity and non-transitory storage medium, and may be various entity storage media capable of storing computer programs, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a magnetic disk, or an optical disk.
Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of illustrating clearly the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative. For example, the division of each unit is only one logic function division, and there may be another division manner in actual implementation. For example, various elements or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented.
The steps in the method of the embodiment of the application can be sequentially adjusted, combined and deleted according to actual needs. The units in the device of the embodiment of the application can be combined, divided and deleted according to actual needs. In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing an electronic device (which may be a personal computer, a terminal, or a network device) to perform all or part of the steps of the method according to the embodiments of the present application.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive various equivalent modifications or substitutions within the technical scope of the present application, and these modifications or substitutions should be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A timed task processing method comprises the following steps:
acquiring a preset timing task, and identifying a current preset processing stage identifier of the preset timing task;
acquiring a preset target processing node identifier corresponding to the preset processing stage identifier according to the preset processing stage identifier;
and sending the preset timing task to a target processing node corresponding to the preset target processing node identification according to the preset target processing node identification so that the target processing node processes the preset timing task, wherein the target processing node comprises a first preset timing task processing container constructed based on a DBJob class and a second preset timing task processing container constructed based on a Quartz Job class.
2. The timed task processing method according to claim 1, wherein after the step of sending the preset timed task to the target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timed task, the method further comprises:
if it is monitored that the target processing node successfully processes the preset timing task, acquiring a next preset processing node identifier corresponding to the preset timing task, and processing the preset timing task according to the next preset processing node identifier until all preset processing nodes corresponding to the preset timing task respectively successfully process the preset timing task.
3. The timed task processing method according to claim 1, wherein said step of acquiring a preset timed task comprises:
monitoring a plurality of preset third-party timing tasks based on the DBJob class;
and if the processing state corresponding to the preset third-party timing task is a stage successful completion state, acquiring the preset third-party timing task.
4. The timed task processing method according to claim 1, wherein the step of obtaining, according to the preset processing stage identifier, a preset target processing node identifier corresponding to the preset processing stage identifier includes:
acquiring a preset timing task processing flow configuration table corresponding to the preset processing stage identifier according to the preset processing stage identifier;
acquiring a preset timing task processing flow corresponding to the preset processing stage identifier according to the preset timing task processing flow configuration table;
and acquiring a preset target processing node identifier corresponding to the preset processing stage identifier according to the preset timed task processing flow.
5. The timed task processing method according to claim 4, wherein the step of obtaining, according to the preset processing stage identifier, the preset timed task processing flow configuration table corresponding to the preset processing stage identifier includes:
determining a preset timing task processing flow configuration table identifier corresponding to the preset processing stage identifier according to the preset processing stage identifier;
and acquiring a preset timing task processing flow configuration table corresponding to the preset processing stage identifier according to the preset timing task processing flow configuration table identifier.
6. The timed task processing method according to claim 1, wherein the step of sending the preset timed task to the target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timed task comprises:
and according to each preset target processing node identifier, sending the preset timing tasks corresponding to the preset target processing node identifiers to the target processing nodes corresponding to the preset target processing node identifiers in a concurrent manner, so that each target processing node processes the corresponding preset timing task.
7. The timed task processing method according to any one of claims 1 to 6, wherein the step of sending the preset timed task to the target processing node corresponding to the preset target processing node identifier according to the preset target processing node identifier, so that the target processing node processes the preset timed task includes:
judging whether a preset node type corresponding to the preset target processing node identification is a preset DBJob type processing node identification or not;
if the preset target processing node identification is a preset DBJob type processing node identification, sending the preset timing task to a first preset timing task processing container constructed based on the DBJob type, so that the first preset timing task processing container processes the preset timing task;
and if the preset target processing node identification is not the preset DBJob type processing node identification, sending the preset timing task to a second preset timing task processing container constructed based on the DBJob type, so that the second preset timing task processing container processes the preset timing task.
8. A timed task processing apparatus, comprising:
the device comprises a first acquisition unit, a second acquisition unit and a processing unit, wherein the first acquisition unit is used for acquiring a preset timing task and identifying a current preset processing stage identifier of the preset timing task;
a second obtaining unit, configured to obtain, according to the preset processing stage identifier, a preset target processing node identifier corresponding to the preset processing stage identifier;
and the sending unit is used for sending the preset timing task to a target processing node corresponding to the preset target processing node identification according to the preset target processing node identification so as to enable the target processing node to process the preset timing task, wherein the target processing node comprises a first preset timing task processing container constructed based on the DBJob class and a second preset timing task processing container constructed based on the Quartz Job class.
9. A computer device, comprising a memory and a processor coupled to the memory; the memory is used for storing a computer program; the processor is adapted to run the computer program to perform the steps of the method according to any of claims 1-7.
10. A computer-readable storage medium, characterized in that the storage medium stores a computer program which, when being executed by a processor, realizes the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110093749.5A CN112799806A (en) | 2021-01-22 | 2021-01-22 | Timed task processing method and device, computer equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110093749.5A CN112799806A (en) | 2021-01-22 | 2021-01-22 | Timed task processing method and device, computer equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112799806A true CN112799806A (en) | 2021-05-14 |
Family
ID=75811495
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110093749.5A Pending CN112799806A (en) | 2021-01-22 | 2021-01-22 | Timed task processing method and device, computer equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112799806A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114615170A (en) * | 2022-01-20 | 2022-06-10 | 北京华耀科技有限公司 | Message processing method, message processing equipment and computer storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20030048699A (en) * | 2001-12-12 | 2003-06-25 | 삼성전자주식회사 | Method and system for data base access of information memory useing management information base in network management protocol |
| CN105824695A (en) * | 2016-03-18 | 2016-08-03 | 浪潮软件集团有限公司 | Timed task scheduling plug-in Quartz use |
| CN107015853A (en) * | 2016-10-10 | 2017-08-04 | 阿里巴巴集团控股有限公司 | The implementation method and device of phased mission system |
-
2021
- 2021-01-22 CN CN202110093749.5A patent/CN112799806A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20030048699A (en) * | 2001-12-12 | 2003-06-25 | 삼성전자주식회사 | Method and system for data base access of information memory useing management information base in network management protocol |
| CN105824695A (en) * | 2016-03-18 | 2016-08-03 | 浪潮软件集团有限公司 | Timed task scheduling plug-in Quartz use |
| CN107015853A (en) * | 2016-10-10 | 2017-08-04 | 阿里巴巴集团控股有限公司 | The implementation method and device of phased mission system |
Non-Patent Citations (1)
| Title |
|---|
| 曹智: "分布式异构数据库智能集成的研究", 中国优秀硕士学位论文全文数据库信息科技辑（月刊）, no. 1, pages 138 - 325 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114615170A (en) * | 2022-01-20 | 2022-06-10 | 北京华耀科技有限公司 | Message processing method, message processing equipment and computer storage medium |
| CN114615170B (en) * | 2022-01-20 | 2023-08-04 | 北京华耀科技有限公司 | Message processing method, device and computer storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111045933B (en) | Regression strategy updating method and device, storage medium and terminal equipment | |
| WO2019095580A1 (en) | Test method and apparatus, computer device, and readable storage medium | |
| CN108762905B (en) | Method and device for processing multitask events | |
| CN112506581B (en) | Method, apparatus, electronic device and readable storage medium for rendering applet | |
| WO2020237798A1 (en) | Upgrade method and device | |
| CN112799806A (en) | Timed task processing method and device, computer equipment and readable storage medium | |
| CN108446300B (en) | Data information scanning method and device | |
| CN109102245B (en) | Processing method, system and device for approval process | |
| WO2019148657A1 (en) | Method for testing associated environments, electronic device and computer readable storage medium | |
| US20150370599A1 (en) | Processing tasks in a distributed system | |
| CN113407525B (en) | K-line data inspection method and device, computer equipment and readable storage medium | |
| WO2020253045A1 (en) | Configured supplementary processing method and device for data of which forwarding has abnormality, and readable storage medium | |
| CN112132544B (en) | Inspection method and device of business system | |
| CN112367205B (en) | Processing method and scheduling system for HTTP scheduling request | |
| CN115437766A (en) | Task processing method and device | |
| CN115344370A (en) | Task scheduling method, device, equipment and storage medium | |
| US8739166B2 (en) | Progress-driven progress information in a service-oriented architecture | |
| CN114663063A (en) | Method, device and equipment for realizing workflow engine and storage medium | |
| CN113420713A (en) | Abnormity monitoring method and device, electronic equipment and computer readable medium | |
| CN112084014A (en) | Data processing method, device, equipment and medium | |
| CN117251769B (en) | Abnormal data identification method, device, equipment and medium based on monitoring component | |
| US11797418B1 (en) | Automatic creation of trace spans from log data | |
| EP4040294A1 (en) | Process scheduling method and apparatus of vision software | |
| WO2017019054A1 (en) | Systems and methods facilitating multi-word atomic operation support for system on chip environments | |
| CN114461632A (en) | Multi-type data reporting and checking method and device based on rule base 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 |