CN110532083A - Timed task dispatching method and device - Google Patents
Timed task dispatching method and device Download PDFInfo
- Publication number
- CN110532083A CN110532083A CN201910834068.2A CN201910834068A CN110532083A CN 110532083 A CN110532083 A CN 110532083A CN 201910834068 A CN201910834068 A CN 201910834068A CN 110532083 A CN110532083 A CN 110532083A
- Authority
- CN
- China
- Prior art keywords
- task
- goal
- lock
- timed
- implementing result
- 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
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000009472 formulation Methods 0.000 claims abstract description 14
- 239000000203 mixture Substances 0.000 claims abstract description 14
- 230000009471 action Effects 0.000 claims description 10
- 238000012544 monitoring process Methods 0.000 claims description 6
- 238000003860 storage Methods 0.000 description 9
- 238000010586 diagram Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000004590 computer program Methods 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006399 behavior Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
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/485—Task life-cycle, e.g. stopping, restarting, resuming execution
-
- 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/46—Multiprogramming arrangements
- G06F9/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F9/524—Deadlock detection or avoidance
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 invention discloses a kind of timed task dispatching method and devices, wherein the timed task dispatching method includes: that periodically goal task is loaded into mission bus in the trigger request for receiving goal task；Whether the distributed lock in query task bus is in the lock state；When inquiring distributed lock and being in the lock state, then the task node for the task that sets objectives；And the task node performance objective task according to formulation.The present invention can carry out United Dispatching to timed task, easy to operate, can ensure that timed task independently executes, improve user experience.
Description
Technical field
The present invention relates to technical field of data processing more particularly to a kind of timed task dispatching methods and device.
Background technique
As business event chain is very long now, service logic is also complex, needs hundreds and thousands of kinds of timed tasks, more
Number timed task is not limited in individual system, needs to run in increasingly complex distributed system.If none is united
One scheduling and alarm, under cluster environment, it may appear that do not know which timed task executes failure or time-out, it can not first
Time knows, until end user's complaint and feedback comes just know, causes the experience effect of user poor.
In view of this, it is necessary to which current timed task dispatching technique is further improved in proposition.
Summary of the invention
To solve an above-mentioned at least technical problem, the main object of the present invention be to provide a kind of timed task dispatching method and
Device.
To achieve the above object, a technical solution adopted by the present invention are as follows: a kind of timed task dispatching method is provided, is wrapped
It includes:
In the trigger request for receiving goal task, periodically goal task is loaded into mission bus；
Whether the distributed lock in query task bus is in the lock state；
When inquiring distributed lock and being in the lock state, then the task node for the task that sets objectives；And
According to the task node performance objective task of formulation.
Wherein, after the task node performance objective task according to formulation, further includes:
Goal task implementing result is generated, and the implementing result of goal task is cached.
Wherein, the generation goal task implementing result, and after being cached to implementing result, further includes:
Obtain and monitor the goal task implementing result of caching；And
Distributed lock is unlocked according to goal task implementing result, to unlock other tasks.
Wherein, it is described goal task is unlocked according to goal task implementing result after, further includes:
Task action result is stored.
Wherein, whether other tasks that the inquiry is loaded into mission bus are in after the lock state of distributed lock,
Further include:
When inquiring distributed lock and being in unlocked state, then locked out distribution formula is locked, to lock to other tasks.
To achieve the above object, another technical solution used in the present invention are as follows: task scheduling apparatus when providing a kind of, packet
It includes:
It insmods, in the trigger request for receiving goal task, goal task is loaded into mission bus for timing；
Enquiry module, the lock state for whether being in distributed lock for inquiring other tasks being loaded into mission bus；
Module is formulated, the task node when inquiring distributed lock and being in the lock state, for the task of setting objectives；With
And
Execution module, for the task node performance objective task according to formulation.
Wherein, further includes:
Cache module is cached for generating goal task implementing result, and to the implementing result of goal task.
Wherein, further includes:
Module is monitored, for obtaining and monitoring the goal task implementing result of caching；And
Distributed lock is unlocked according to goal task implementing result, to unlock other tasks.
Wherein, further includes:
Memory module, for being stored to task action result.
Wherein, further includes:
Module is locked, when inquiring distributed lock and be in unlocked state, for locked out distribution formula lock, to other
Business is locked.
Goal task mainly using in the trigger request for receiving goal task, is periodically loaded by technical solution of the present invention
In mission bus；Then whether the distributed lock in query task bus is in the lock state；It is inquiring at distributed lock again
When lock state, then the task node for the task that sets objectives；And finally according to the task node performance objective task of formulation.
The present invention can carry out United Dispatching to timed task as a result, easy to operate, can ensure that timed task independently executes, improve
User experience.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
The structure shown according to these attached drawings obtains other attached drawings.
Fig. 1 is the flow chart of one embodiment of the invention timed task dispatching method；
Fig. 2 is the block diagram of one embodiment of the invention timed task dispatching device；
Fig. 3 is the block diagram of one embodiment of the invention electronic device.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiment is only a part of the embodiments of the present invention, instead of all the embodiments.Base
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts it is all its
His embodiment, shall fall within the protection scope of the present invention.
It is to be appreciated that the description of " first ", " second " involved in the present invention etc. is used for description purposes only, and should not be understood as
Its relative importance of indication or suggestion or the quantity for implicitly indicating indicated technical characteristic.Define as a result, " first ",
The feature of " second " can explicitly or implicitly include at least one of the features.In addition, the technical side between each embodiment
Case can be combined with each other, but must be based on can be realized by those of ordinary skill in the art, when the combination of technical solution
Conflicting or cannot achieve when occur will be understood that the combination of this technical solution is not present, also not the present invention claims guarantor
Within the scope of shield.
Fig. 1 is please referred to, Fig. 1 is the flow chart of one embodiment of the invention timed task dispatching method.In the embodiment of the present invention
In, the timed task dispatching method, comprising:
Step S10, in the trigger request for receiving goal task, periodically goal task is loaded into mission bus；
Step S20, whether the distributed lock in query task bus is in the lock state；
Step S30, when inquiring distributed lock and being in the lock state, then the task node for the task that sets objectives；And
Step S40, according to the task node performance objective task of formulation.
In business event chain, service logic is complex, and many a timed tasks is needed to complete chain task.This
When, it needs to carry out timed task unified scheduling.Multiple timed tasks can store in database, using database to more
A timed task is managed collectively.It is fixed when according to the trigger request for receiving goal task when being scheduled to goal task
When will goal task be loaded into mission bus in.Then whether the distributed lock in query task bus is in the lock state, if
Distributed lock is in the lock state, then it represents that other tasks are in and are not carried out state, at this point it is possible to the task for the task that sets objectives
Node, specifically, need the condition dispatched by easy configuration, even if will not cron expression formula can light configuration task tune
Degree condition.Finally according to the task node performance objective task of formulation.It so, it is possible to carry out timed task United Dispatching, behaviour
Make simply, to ensure that timed task independently executes, improves user experience.
In a specific embodiment, after the task node performance objective task according to formulation, further includes:
Goal task implementing result is generated, and the implementing result of goal task is cached.
In the present embodiment, above-mentioned task action result, including the row time, time-consuming, whether the number such as time-out, implementing result
According to after being cached to the implementing result of goal task.The implementing result of above-mentioned task can be shown by scheduling interface
Show, is checked with facilitating.
In a specific embodiment, the generation goal task implementing result, and after being cached to implementing result, also
Include:
Obtain and monitor the goal task implementing result of caching；And
Distributed lock is unlocked according to goal task implementing result, to unlock other tasks.
In the present embodiment, by the monitoring of the goal task implementing result to caching, when goal task is when running succeeded,
Distributed lock is then unlocked according to goal task implementing result, to unlock other tasks；In addition, executing failure when goal task
When, continue the implementing result for monitoring goal task.
Specifically, it is described goal task is unlocked according to goal task implementing result after, further includes:
Task action result is stored.
In the present embodiment, the log of goal task can also be generated according to the result of monitoring, and implementing result can be held
The write-in database changed long.
Further, it is described inquiry be loaded into mission bus in other tasks whether be in distributed lock lock state it
Afterwards, further includes:
When inquiring distributed lock and being in unlocked state, then locked out distribution formula is locked, to lock to other tasks.
The independence and uniqueness that goal task executes can be ensured by distributed lock, to facilitate the management to goal task.
Referring to figure 2., Fig. 2 is the block diagram of one embodiment of the invention timed task dispatching device.Reality of the invention
It applies in example, the timed task dispatching device, the timed task dispatching device includes:
It insmods 10, in the trigger request for receiving goal task, goal task is loaded into mission bus for timing
In；
Enquiry module 20, the locking shape for whether being in distributed lock for inquiring other tasks being loaded into mission bus
State；
Module 30 is formulated, the task node when inquiring distributed lock and being in the lock state, for the task of setting objectives；
And
Execution module 40, for the task node performance objective task according to formulation.
In the present embodiment, by insmoding 10, when being scheduled to goal task, according to the touching for receiving goal task
When hair request, periodically goal task is loaded into mission bus.Then the distribution according to enquiry module 20, in query task bus
Whether formula lock is in the lock state, if distributed lock is in the lock state, then it represents that and other tasks are in and are not carried out state, this
When, it can be according to formulation module 30, the task node for the task that sets objectives, specifically, the item for needing to dispatch by easy configuration
Part, though will not cron expression formula can easily configuration task schedulable condition.Finally according to execution module 40, according to formulation
Task node performance objective task.It so, it is possible to carry out timed task United Dispatching, it is easy to operate, it can ensure that timing is appointed
Business independently executes, and improves user experience.
In a specific embodiment, further includes:
Cache module is cached for generating goal task implementing result, and to the implementing result of goal task.
In a specific embodiment, further includes:
Module is monitored, for obtaining and monitoring the goal task implementing result of caching；And
Distributed lock is unlocked according to goal task implementing result, to unlock other tasks.
In a specific embodiment, further includes:
Memory module, for being stored to task action result.
In a specific embodiment, further includes:
Module is locked, when inquiring distributed lock and be in unlocked state, for locked out distribution formula lock, to other
Business is locked.
Referring to Fig. 3, Fig. 3 is the block diagram of one embodiment of the invention electronic device.The electronic device can be used for reality
Timed task dispatching method in existing previous embodiment.As shown in figure 3, the electronic device specifically includes that
It memory 301, processor 302, bus 303 and is stored on memory 301 and can run on processor 302
Computer program, memory 301 and processor 302 are connected by bus 303.It is real when processor 302 executes the computer program
Drink identification method in existing previous embodiment.Wherein, the quantity of processor can be one or more.
Memory 301 can be high random access memory body (RAM, Random Access Memory) memory,
It can be non-labile memory (non-volatile memory), such as magnetic disk storage.Memory 301 can for storing
Program code is executed, processor 302 is coupled with memory 301.
Further, the embodiment of the present application also provides a kind of computer readable storage medium, the computer-readable storages
Medium can be in the electronic device being set in the various embodiments described above, which can be earlier figures 3
Memory in illustrated embodiment.
It is stored with computer program on the computer readable storage medium, which realizes aforementioned reality when being executed by processor
Apply the drink identification method in example.Further, the computer can storage medium can also be USB flash disk, mobile hard disk, read-only storage
The various media that can store program code such as device (ROM, Read-Only Memory), RAM, magnetic or disk.
In several embodiments provided herein, it should be understood that disclosed device and method can pass through it
Its mode is realized.For example, the apparatus embodiments described above are merely exemplary, for example, the division of module, only
A kind of logical function partition, there may be another division manner in actual implementation, for example, multiple module or components can combine or
Person is desirably integrated into another system, or some features can be ignored or not executed.Another point, shown or discussed is mutual
Between coupling, direct-coupling or communication connection can be through some interfaces, the INDIRECT COUPLING or communication link of device or module
It connects, can be electrical property, mechanical or other forms.
Module may or may not be physically separated as illustrated by the separation member, show as module
Component may or may not be physical module, it can and it is in one place, or may be distributed over multiple networks
In module.Some or all of the modules therein can be selected to achieve the purpose of the solution of this embodiment according to the actual needs.
It, can also be in addition, can integrate in a processing module in each functional module in each embodiment of the application
It is that modules physically exist alone, can also be integrated in two or more modules in a module.Above-mentioned integrated mould
Block both can take the form of hardware realization, can also be realized in the form of software function module.
If integrated module is realized and when sold or used as an independent product in the form of software function module, can
To be stored in a computer readable storage medium.Based on this understanding, the technical solution of the application substantially or
Say that all or part of the part that contributes to existing technology or the technical solution can embody in the form of software products
Out, which is stored in a readable storage medium storing program for executing, including some instructions are used so that a computer
Equipment (can be personal computer, server or the network equipment etc.) execute each embodiment method of the application whole or
Part steps.And readable storage medium storing program for executing above-mentioned includes: that USB flash disk, mobile hard disk, ROM, RAM, magnetic or disk etc. are various can be with
Store the medium of program code.
It should be noted that for the various method embodiments described above, describing for simplicity, therefore, it is stated as a series of
Combination of actions, but those skilled in the art should understand that, the application is not limited by the described action sequence because
According to the application, certain steps can use other sequences or carry out simultaneously.Secondly, those skilled in the art should also know
It knows, the embodiments described in the specification are all preferred embodiments, and related actions and modules might not all be this Shen
It please be necessary.
In the above-described embodiments, it all emphasizes particularly on different fields to the description of each embodiment, there is no the portion being described in detail in some embodiment
Point, it may refer to the associated description of other embodiments.
The above description is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all at this
Under the inventive concept of invention, using equivalent structure transformation made by description of the invention and accompanying drawing content, or directly/use indirectly
It is included in other related technical areas in scope of patent protection of the invention.
Claims (10)
1. a kind of timed task dispatching method, which is characterized in that the timed task dispatching method includes:
In the trigger request for receiving goal task, periodically goal task is loaded into mission bus；
Whether the distributed lock in query task bus is in the lock state；
When inquiring distributed lock and being in the lock state, then the task node for the task that sets objectives；And
According to the task node performance objective task of formulation.
2. timed task dispatching method as described in claim 1, which is characterized in that described to be executed according to the task node of formulation
After goal task, further includes:
Goal task implementing result is generated, and the implementing result of goal task is cached.
3. timed task dispatching method as claimed in claim 2, which is characterized in that the generation goal task implementing result,
And after being cached to implementing result, further includes:
Obtain and monitor the goal task implementing result of caching；And
Distributed lock is unlocked according to goal task implementing result, to unlock other tasks.
4. timed task dispatching method as claimed in claim 3, which is characterized in that described according to goal task implementing result pair
After goal task is unlocked, further includes:
Task action result is stored.
5. timed task dispatching method as described in claim 1, which is characterized in that the inquiry is loaded into its in mission bus
Whether he task is in after the lock state of distributed lock, further includes:
When inquiring distributed lock and being in unlocked state, then locked out distribution formula is locked, to lock to other tasks.
6. task scheduling apparatus when a kind of, which is characterized in that the timed task dispatching device includes:
It insmods, in the trigger request for receiving goal task, goal task is loaded into mission bus for timing；
Enquiry module, the lock state for whether being in distributed lock for inquiring other tasks being loaded into mission bus；
Module is formulated, the task node when inquiring distributed lock and being in the lock state, for the task of setting objectives；And
Execution module, for the task node performance objective task according to formulation.
7. timed task dispatching device as claimed in claim 6, which is characterized in that further include:
Cache module is cached for generating goal task implementing result, and to the implementing result of goal task.
8. timed task dispatching device as claimed in claim 7, which is characterized in that further include:
Module is monitored, for obtaining and monitoring the goal task implementing result of caching；And
Distributed lock is unlocked according to goal task implementing result, to unlock other tasks.
9. timed task dispatching device as claimed in claim 8, which is characterized in that further include:
Memory module, for being stored to task action result.
10. timed task dispatching device as claimed in claim 9, which is characterized in that further include:
Lock module, when inquiring distributed lock and be in unlocked state, for locked out distribution formula lock, with to other tasks into
Row locks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910834068.2A CN110532083A (en) | 2019-09-04 | 2019-09-04 | Timed task dispatching method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910834068.2A CN110532083A (en) | 2019-09-04 | 2019-09-04 | Timed task dispatching method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110532083A true CN110532083A (en) | 2019-12-03 |
Family
ID=68667036
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910834068.2A Pending CN110532083A (en) | 2019-09-04 | 2019-09-04 | Timed task dispatching method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110532083A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111158880A (en) * | 2019-12-31 | 2020-05-15 | 易票联支付有限公司 | Distributed timed task scheduling method, system, device and storage medium |
| CN112860394A (en) * | 2021-01-21 | 2021-05-28 | 平安科技（深圳）有限公司 | Timing task scheduling execution method and device, electronic equipment and storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150143381A1 (en) * | 2013-11-20 | 2015-05-21 | International Business Machines Corporation | Computing session workload scheduling and management of parent-child tasks |
| US20160335135A1 (en) * | 2015-05-14 | 2016-11-17 | Tmaxsoft. Co., Ltd. | Method for minimizing lock contention among threads when tasks are distributed in multithreaded system and appratus using the same |
| US20180011744A1 (en) * | 2016-07-06 | 2018-01-11 | International Business Machines Corporation | Determining when to release a lock from a first task holding the lock to grant to a second task waiting for the lock |
| CN107688500A (en) * | 2017-07-26 | 2018-02-13 | 阿里巴巴集团控股有限公司 | A kind of distributed task scheduling processing method, device, system and equipment |
| CN108710537A (en) * | 2018-04-09 | 2018-10-26 | 平安科技（深圳）有限公司 | A kind of task processing method, storage medium and server |
| CN109218227A (en) * | 2018-08-02 | 2019-01-15 | 武汉绿色网络信息服务有限责任公司 | A kind of processing method of network data packets and device |
| CN109445917A (en) * | 2018-10-16 | 2019-03-08 | Oppo广东移动通信有限公司 | Application processing method and device, electronic equipment, computer readable storage medium |
| CN109558234A (en) * | 2018-11-30 | 2019-04-02 | 中国联合网络通信集团有限公司 | A kind of timed task dispatching method and device |
| CN109814998A (en) * | 2019-01-22 | 2019-05-28 | 中国联合网络通信集团有限公司 | Method and device for multi-process task scheduling |
| CN109918187A (en) * | 2019-03-12 | 2019-06-21 | 北京同城必应科技有限公司 | Task scheduling method, apparatus, device and storage medium |
-
2019
- 2019-09-04 CN CN201910834068.2A patent/CN110532083A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150143381A1 (en) * | 2013-11-20 | 2015-05-21 | International Business Machines Corporation | Computing session workload scheduling and management of parent-child tasks |
| US20160335135A1 (en) * | 2015-05-14 | 2016-11-17 | Tmaxsoft. Co., Ltd. | Method for minimizing lock contention among threads when tasks are distributed in multithreaded system and appratus using the same |
| US20180011744A1 (en) * | 2016-07-06 | 2018-01-11 | International Business Machines Corporation | Determining when to release a lock from a first task holding the lock to grant to a second task waiting for the lock |
| CN107688500A (en) * | 2017-07-26 | 2018-02-13 | 阿里巴巴集团控股有限公司 | A kind of distributed task scheduling processing method, device, system and equipment |
| CN108710537A (en) * | 2018-04-09 | 2018-10-26 | 平安科技（深圳）有限公司 | A kind of task processing method, storage medium and server |
| CN109218227A (en) * | 2018-08-02 | 2019-01-15 | 武汉绿色网络信息服务有限责任公司 | A kind of processing method of network data packets and device |
| CN109445917A (en) * | 2018-10-16 | 2019-03-08 | Oppo广东移动通信有限公司 | Application processing method and device, electronic equipment, computer readable storage medium |
| CN109558234A (en) * | 2018-11-30 | 2019-04-02 | 中国联合网络通信集团有限公司 | A kind of timed task dispatching method and device |
| CN109814998A (en) * | 2019-01-22 | 2019-05-28 | 中国联合网络通信集团有限公司 | Method and device for multi-process task scheduling |
| CN109918187A (en) * | 2019-03-12 | 2019-06-21 | 北京同城必应科技有限公司 | Task scheduling method, apparatus, device and storage medium |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111158880A (en) * | 2019-12-31 | 2020-05-15 | 易票联支付有限公司 | Distributed timed task scheduling method, system, device and storage medium |
| CN111158880B (en) * | 2019-12-31 | 2024-04-09 | 易票联支付有限公司 | Distributed timing task scheduling method, system, device and storage medium |
| CN112860394A (en) * | 2021-01-21 | 2021-05-28 | 平安科技（深圳）有限公司 | Timing task scheduling execution method and device, electronic equipment and storage medium |
| CN112860394B (en) * | 2021-01-21 | 2024-11-22 | 平安科技（深圳）有限公司 | Scheduled task scheduling execution method, device, electronic device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9348641B2 (en) | System and method for performing a transaction in a massively parallel processing database | |
| EP3058690B1 (en) | System and method for creating a distributed transaction manager supporting repeatable read isolation level in a mpp database | |
| CN109710615A (en) | Access management method, system, electronic equipment and the storage medium of database | |
| Liu et al. | Efficient distributed query processing in large RFID-enabled supply chains | |
| CN108062367A (en) | The method for uploading and its terminal of a kind of data list | |
| CN111026602A (en) | Health inspection scheduling management method and device of cloud platform and electronic equipment | |
| CN112631633B (en) | Function module upgrading method and device based on double-core intelligent ammeter | |
| CN109491857A (en) | A kind of data monitoring method, system and the terminal device of rule-based engine | |
| CN111045893B (en) | Method, device and system for executing monitoring task, storage medium and electronic device | |
| CN109684082A (en) | The data cleaning method and system of rule-based algorithm | |
| US20060095435A1 (en) | Configuring and deploying portable application containers for improved utilization of server capacity | |
| CN111737021A (en) | Parallel task processing method and device, electronic equipment and storage medium | |
| CN103365946A (en) | Database performance analysis | |
| CN110532083A (en) | Timed task dispatching method and device | |
| CN110334119A (en) | A kind of data correlation processing method, device, equipment and medium | |
| CN113204420B (en) | Distributed cache-based job scheduling method and device | |
| US8136012B2 (en) | Method and system for updating topology changes of a computer network | |
| US9544214B2 (en) | System and method for optimized event monitoring in a management environment | |
| US8161079B2 (en) | Acquisition and expansion of storage area network interoperation relationships | |
| CN112860780B (en) | Data export method and device and terminal equipment | |
| Belhassena et al. | On modeling data for IoT agroecology applications by means of a UML profile | |
| CN118427201A (en) | Method and device for executing update statement, electronic equipment and computer storage medium | |
| CN112100208B (en) | Method and device for forwarding operation request | |
| CN110650063A (en) | Centralized bank third-party software simulation system and method | |
| Wei et al. | Probabilistically-Atomic 2-Atomicity: Enabling almost strong consistency in distributed storage systems |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191203 |
|
| RJ01 | Rejection of invention patent application after publication |