CN106844043A - The treating method and apparatus of cluster task - Google Patents
The treating method and apparatus of cluster task Download PDFInfo
- Publication number
- CN106844043A CN106844043A CN201611248046.0A CN201611248046A CN106844043A CN 106844043 A CN106844043 A CN 106844043A CN 201611248046 A CN201611248046 A CN 201611248046A CN 106844043 A CN106844043 A CN 106844043A
- Authority
- CN
- China
- Prior art keywords
- execution
- task
- timed task
- queue
- cycle
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5083—Techniques for rebalancing the load in a distributed system
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention provides a kind for the treatment of method and apparatus of cluster task, and the method includes：Timed task is separately positioned on different execution queues according to cycle classification, in each execution queue, the timed task performed within the execution cycle is marked, when execution queue poll next time, according to the mark of each timed task, the task that acquisition is also not carried out within the execution cycle is performed.By the way that all of timed task according to cycle category classification, to have been disassembled obstructed classification timed task queue pond, the queue pond repeating query time is substantially reduced, improve execution efficiency.
Description
Technical field
The present invention relates to field of computer technology, more particularly to a kind for the treatment of method and apparatus of cluster task.
Background technology
With the popularization of cloud service, more and more information need to carry out cloud computing.In order to lift the inquiry per second of cloud service
Rate (Query Per Second, QPS) performance is, it is necessary to by substantial amounts of interface asynchronous.And one of conventional technology of asynchronization is just
It is timed task.
And traditional timed task is substantially and is summarised in a special server, or service deployment is followed by difference
On certain machine of business.It is summarised in a server, although save management and monitoring task cost, but timed task can be caused
Increase, synchronization needs performing for task a lot, bring the load overhead of server, and each task to be closed if relying on
System, then can cause task blocking.And it is dispersed in service server, it may appear that task is stuck, the phenomenon such as process exception, it is impossible to ensure
Each task successful execution.
As timed task increases, synchronization needs performing for task a lot, brings the load overhead of server, and
Each task can then cause task blocking if dependence.Therefore how efficiently substantial amounts of timed task quickly to be performed
Referred to as problem demanding prompt solution.
The content of the invention
The present invention provides a kind for the treatment of method and apparatus of cluster task, same for solving to increase with timed task
Moment needs performing for task a lot, brings the load overhead of server, and each task then to cause if dependence
The problem of task blocking, realization efficiently quickly performs substantial amounts of timed task.
First aspect present invention provides a kind of processing method of cluster task, including：
Timed task is separately positioned on different execution queues according to cycle classification；
In each execution queue, the timed task performed within the execution cycle is marked；
When execution queue poll next time, according to the mark of each timed task, obtain within the execution cycle
Also being not carried out for task is performed.
Optionally, the execution cycle classification includes：
Execution per minute is performed once, performed once daily once, per hour, once per week or every month are performed
Once.
Optionally, it is described in each execution queue, the timed task performed within the execution cycle is entered into rower
Note, including：
By the timed task in the execution queue, carried out according to execution cycle, user's group, script command and execution weight
Perform；
Wherein, the right of execution is reused in the execution number of times for identifying the task；Each timing is appointed in the execution queue
The initial value of the execution weight of business is the total execution number of times in preset duration, often performs once the timed task, the execution
The corresponding weighted value that performs of task subtracts one.
Optionally, the mark according to each timed task, the task that acquisition is also not carried out within the execution cycle
Performed, including：
Obtain the corresponding execution weight of each timed task；
When the right of execution is great in zero when, then the timed task is performed, and by the execution weight of the timed task
Value subtracts one；
When the execution weight is equal to zero, it is determined that execution task executed within the execution cycle is completed.
Optionally, methods described also includes：
If being more than the execution cycle in the presence of the execution time for performing queue, lock is set；It is described to lock described for ensureing
Poll next time is carried out after all tasks carryings of execution queue are complete again to perform.
Second aspect present invention provides a kind of processing unit of cluster task, including：
First processing module, for timed task to be separately positioned on into different execution queues according to cycle classification；
Second processing module, in performing queue at each, the timed task that will have been performed within the execution cycle
It is marked；
3rd processing module, for when execution queue poll next time, according to the mark of each timed task, obtaining
Also being not carried out within the execution cycle for task is performed.
Optionally, the execution cycle classification includes：
Execution per minute is performed once, performed once daily once, per hour, once per week or every month are performed
Once.
Optionally, the Second processing module specifically for：
By the timed task in the execution queue, carried out according to execution cycle, user's group, script command and execution weight
Perform；
Wherein, the right of execution is reused in the execution number of times for identifying the task；Each timing is appointed in the execution queue
The initial value of the execution weight of business is the total execution number of times in preset duration, often performs once the timed task, the execution
The corresponding weighted value that performs of task subtracts one.
Optionally, the 3rd processing module specifically for：
Obtain the corresponding execution weight of each timed task；
When the right of execution is great in zero when, then the timed task is performed, and by the execution weight of the timed task
Value subtracts one；
When the execution weight is equal to zero, it is determined that execution task executed within the execution cycle is completed.
Optionally, described device also includes：
Fourth processing module, if for determining to be set in the presence of when performing the execution time of queue more than the execution cycle
Lock；It is described to lock for ensureing that carrying out poll next time again after all tasks carryings of the execution queue are complete performs.
Third aspect present invention provides a kind of equipment, including：For the processor and use that control executable instruction to perform
In the memory of storage processor-executable instruction；
The processor is used for：
Timed task is separately positioned on different execution queues according to cycle classification；
In each execution queue, the timed task performed within the execution cycle is marked；
When execution queue poll next time, according to the mark of each timed task, obtain within the execution cycle
Also being not carried out for task is performed.
Optionally, the execution cycle classification includes：
Execution per minute is performed once, performed once daily once, per hour, once per week or every month are performed
Once.
Optionally, the processor specifically for：
By the timed task in the execution queue, carried out according to execution cycle, user's group, script command and execution weight
Perform；
Wherein, the right of execution is reused in the execution number of times for identifying the task；Each timing is appointed in the execution queue
The initial value of the execution weight of business is the total execution number of times in preset duration, often performs once the timed task, the execution
The corresponding weighted value that performs of task subtracts one.
Optionally, the processor specifically for：
Obtain the corresponding execution weight of each timed task；
When the right of execution is great in zero when, then the timed task is performed, and by the execution weight of the timed task
Value subtracts one；
When the execution weight is equal to zero, it is determined that execution task executed within the execution cycle is completed.
Optionally, the processor is additionally operable to：
If being more than the execution cycle in the presence of the execution time for performing queue, lock is set；It is described to lock described for ensureing
Poll next time is carried out after all tasks carryings of execution queue are complete again to perform.
The treating method and apparatus of cluster task provided in an embodiment of the present invention, by by all of timed task according to week
Phase classification is separately positioned on different execution queues, in each execution queue, by determining for having been performed within the execution cycle
When task be marked, when execution queue poll next time, according to the mark of each timed task, obtain in the execution
Also being not carried out in cycle for task is performed, and has disassembled obstructed classification timed task queue pond, substantially reduces queue pond wheel
The time is followed, execution efficiency is improved.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
The accompanying drawing to be used needed for having technology description is briefly described, it should be apparent that, drawings in the following description are this hairs
Some bright embodiments, for those of ordinary skill in the art, without having to pay creative labor, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is the flow chart of the processing method embodiment one of cluster task provided in an embodiment of the present invention；
Fig. 2 is the flow chart of the processing method embodiment two of cluster task provided in an embodiment of the present invention；
Fig. 3 is the structural representation of the processing unit embodiment one of cluster task provided in an embodiment of the present invention；
Fig. 4 is the structural representation of the processing unit embodiment two of cluster task provided in an embodiment of the present invention；
Fig. 5 is the structural representation of equipment provided in an embodiment of the present invention.
Specific embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
A part of embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art
The all other embodiment obtained under the premise of creative work is not made, belongs to the scope of protection of the invention.
Fig. 1 is the flow chart of the processing method embodiment one of cluster task provided in an embodiment of the present invention, as shown in figure 1,
The executive agent of the program is the equipment that cluster server etc. carries out cluster task treatment, the tool of the processing method of the cluster task
Body realizes that step is：
Step S101, different execution queues are separately positioned on by timed task according to cycle classification.
In this step, get all of timed task, will all of timed task recorded according to treaty rule
Enter, the treaty rule of typing timed task includes：According to user's group operation typing, according to execution time typing, according to execution pin
This typing carries out typing according to the conditional code that agreement is returned after being finished.
After all of timed task to be performed is got, all of timed task is divided according to cycle classification
Group, is separately positioned in different execution queues, and the cycle classification that each performs the timed task in queue is identical.
In the program, performing cycle classification includes：It is per minute execution perform once, per hour once, daily perform once,
Once per week or every month perform once.
Step S102, in each execution queue, the timed task performed within the execution cycle is marked.
In this step, after classifying to timed task, task is carried out initially according to regular hour parameter
Change, be then polled execution according to different queues, in this process, within an execution cycle, will can perform
Timed task be marked so that when the timed task is polled to next time, can interpolate that the timed task whether by
Execution, it is not necessary to repeat.For example：Certain timed task is performed once per hour, then perform the cycle be one hour
When, if the timed task for the first time be performed completions, need increase mark, if in one hour second poll to this regularly
Task, then directly can directly skip the next timed task of the tasks carrying by the mark.If certain timed task is every
Minute perform once, then need within the execution cycle of hour to perform 60 times, then need to mark performed time
Number, subsequently to can interpolate that the execution number of times of the task, it is to avoid also need to poll again after having performed.
Step S103, when execution queue poll next time, according to the mark of each timed task, acquisition is held described
Also being not carried out in line period for task is performed.
In this step, it is by the mark of each timed task, then right within an execution cycle according to foregoing scheme
Directly skipping for execution is completed in execution queue, the also needing to perform again in queue of the task will have been performed and proceeded treatment,
Lifting execution efficiency.
The processing method of the cluster task that the present embodiment is provided, distinguishes by by all of timed task according to cycle classification
Different execution queues are arranged on, in each execution queue, the timed task that will have been performed within the execution cycle is carried out
Mark, when execution queue poll next time, according to the mark of each timed task, obtains within the execution cycle also not
The task of execution is performed, and has disassembled obstructed classification timed task queue pond, substantially reduces the queue pond repeating query time, lifting
Execution efficiency.
Fig. 2 is the flow chart of the processing method embodiment two of cluster task provided in an embodiment of the present invention, as shown in Fig. 2
In such scheme, step S102 one kind specifically carry into execution a plan for：By the timed task in the execution queue, according to execution
Cycle, user's group, script command and execution weight are performed, wherein, the right of execution is reused in and identifies holding for the task
Places number；The initial value of the execution weight of each timed task is the total execution number of times in preset duration in the execution queue,
The timed task is often performed once, the corresponding weighted value that performs of the execution task subtracts one.Accordingly, the reality of above-mentioned steps S103
Now process is：
Step S201：Obtain the corresponding execution weight of each timed task.
In this scenario, weight can be performed to the configuration of each timed task in advance, the initial value of the weight typically can be with
The execution number of times within the execution cycle is configured to, when each queue poll goes to the timed task, this is determined to be required to acquisition
When task execution weight, to determine follow-up operation.
Step S202：When the right of execution is great in zero when, then the timed task is performed, and by the timed task
Perform weighted value and subtract one.
Step S203：When it is described execution weight be equal to zero when, it is determined that the execution task within the execution cycle
Perform completion.
In this step, timed task is often performed once, then its execution weight subtracts one, in the method within the execution cycle
It is polled execution successively according to queue, and the size of its execution weight is determined when the timed task is polled to every time, holds
Row weight is equal to zero, then confirm that the task has been carried out completing, and need not be processed again within the execution cycle, right of execution
It is great then to confirm that the task also needs to be performed in zero, and the execution weight of the task is subtracted one after having performed, with such
Push away.
On the basis of above-mentioned two embodiment, the processing scheme of the cluster task is illustrated with an example below.
Timed task citing script：10/*0 0**root sh/opt/cron.Sh (are performed once) for ten minutes
1st, by all of timed task according to treaty rule carry out typing (treaty rule is such as run with what user's group,
When perform, what script performed, the conditional code of agreement is returned after being finished).
2nd, all timed tasks are classified, arrange (substantially all it is periodic task due to timing, therefore can basis
Cycle classification is respectively provided with different queues.By month, week, it is daily, granularity hourly, per minute is divided
Different queue is not initialised to it.This example optimizes mainly for minute rank most fine granularity, and other classifications are similarly.)
3rd, according to the time parameter for setting, in daily 0 point triggering, task initialization is carried out.By minute queue according to setting
Time, user's group, script command, perform script ms ranks take consume, and (value is periodic task meter to perform weight poll
Gained is calculated, illustrate script 60/10=6, then poll=6), finally perform time parameter and initialized.
4th, a hour script repeating query is carried out using timed task, wherein repeating query only reads poll values more than 0, recognizes equal to 0
For the timed task has been finished, execution need not be repeated in 1 day.Often perform once, just poll values are subtracted one, and
Modification is last to perform the time.If poll values are identical, principle is finally inserted into according to last execution, changes repeating query queue.Come
Ensure that repeating query queue only needs to successively be performed according to queue sequence.Additionally, time-consuming time-consuming more than timing repeating query for performing
, it is necessary to extra locking just starts the tasks carrying of next round after being finished ensureing previous task.For non-minute classification
Periodicity script, then just according to there is minute value size to insert queue from small to large.
5th, according to different subscription categories, synchronization can carry out repeating query respectively with asynchronous, so both reduce tradition all
Class has the overhead for all being brought in a queue pond repeating query, and can guarantee that again no longer needs repeating for task to be zeroed.
6th, each timing task carrying-out time and state are recorded, if the time of execution exceeds fluctuation range value, is reported
It is alert to remind, if performing abnormal state, retry is carried out automatically and is retried.
The program passes through largely to collect the repeating query that timed task execution at least needs bigger queue pond, and hash trafficwise is again
It is bad monitoring each task whether successful execution, and use this strategy, disassembled obstructed classification timed task queue pond, contract significantly
The short queue pond repeating query time, improve execution efficiency.
Fig. 3 is the structural representation of the processing unit embodiment one of cluster task provided in an embodiment of the present invention, such as Fig. 3 institutes
Show, the processing unit 10 of the cluster task that the present embodiment is provided includes：
First processing module 11, for timed task to be separately positioned on into different execution queues according to cycle classification；
Second processing module 12, in each execution queue, the timing that will have been performed within the execution cycle to be appointed
Business is marked；
3rd processing module 13, for when it is described execution queue next time poll when, according to the mark of each timed task, obtain
Also being not carried out within the execution cycle for task is taken to be performed.
Optionally, the execution cycle classification includes：
Execution per minute is performed once, performed once daily once, per hour, once per week or every month are performed
Once.
Optionally, the Second processing module 12 specifically for：
By the timed task in the execution queue, carried out according to execution cycle, user's group, script command and execution weight
Perform；
Wherein, the right of execution is reused in the execution number of times for identifying the task；Each timing is appointed in the execution queue
The initial value of the execution weight of business is the total execution number of times in preset duration, often performs once the timed task, the execution
The corresponding weighted value that performs of task subtracts one.
Optionally, the 3rd processing module 13 specifically for：
Obtain the corresponding execution weight of each timed task；
When the right of execution is great in zero when, then the timed task is performed, and by the execution weight of the timed task
Value subtracts one；
When the execution weight is equal to zero, it is determined that execution task executed within the execution cycle is completed.
The processing unit of the cluster task that the present embodiment is provided, implements for performing the method that foregoing any embodiment is provided
The technical scheme of example, its realization principle is similar with technique effect, will not be repeated here.
Fig. 4 is the structural representation of the processing unit embodiment two of cluster task provided in an embodiment of the present invention, such as Fig. 4 institutes
Show, the processing unit 10 of the cluster task also includes：
Fourth processing module 14, if for determining to be set in the presence of when performing the execution time of queue more than the execution cycle
Lock；It is described to lock for ensureing that carrying out poll next time again after all tasks carryings of the execution queue are complete performs.
The processing unit of the cluster task that the present embodiment is provided, implements for performing the method that foregoing any embodiment is provided
The technical scheme of example, its realization principle is similar with technique effect, will not be repeated here.
Fig. 5 is the structural representation of equipment provided in an embodiment of the present invention, as shown in figure 5, the present invention also provides a kind of use
In the equipment for the treatment of cluster task, the equipment includes：At for the processor for controlling executable instruction to perform and for storage
Manage the memory of device executable instruction；
The processor is used for：
Timed task is separately positioned on different execution queues according to cycle classification；
In each execution queue, the timed task performed within the execution cycle is marked；
When execution queue poll next time, according to the mark of each timed task, obtain within the execution cycle
Also being not carried out for task is performed.
Optionally, the execution cycle classification includes：
Execution per minute is performed once, performed once daily once, per hour, once per week or every month are performed
Once.
Optionally, the processor specifically for：
By the timed task in the execution queue, carried out according to execution cycle, user's group, script command and execution weight
Perform；
Wherein, the right of execution is reused in the execution number of times for identifying the task；Each timing is appointed in the execution queue
The initial value of the execution weight of business is the total execution number of times in preset duration, often performs once the timed task, the execution
The corresponding weighted value that performs of task subtracts one.
Optionally, the processor specifically for：
Obtain the corresponding execution weight of each timed task；
When the right of execution is great in zero when, then the timed task is performed, and by the execution weight of the timed task
Value subtracts one；
When the execution weight is equal to zero, it is determined that execution task executed within the execution cycle is completed.
Optionally, the processor is additionally operable to：
If being more than the execution cycle in the presence of the execution time for performing queue, lock is set；It is described to lock described for ensureing
Poll next time is carried out after all tasks carryings of execution queue are complete again to perform.
The equipment that the present embodiment is provided, the technical scheme for performing the embodiment of the method that foregoing any embodiment is provided,
Its realization principle is similar with technique effect, will not be repeated here.
In the embodiment of the said equipment, it should be appreciated that processor can be CPU (English：Central
Processing Unit, referred to as：CPU), can also be other general processors, digital signal processor (English：Digital
Signal Processor, referred to as：DSP), application specific integrated circuit (English：Application Specific Integrated
Circuit, referred to as：ASIC) etc..General processor can be microprocessor or the processor can also be any conventional place
Reason device etc..The step of method with reference to disclosed in the embodiment of the present invention, can be embodied directly in hardware processor and perform completion, or
Hardware and software module combination in person's processor performs completion.
One of ordinary skill in the art will appreciate that：Realizing all or part of step of above-mentioned each method embodiment can lead to
The related hardware of programmed instruction is crossed to complete.Foregoing program can be stored in a computer read/write memory medium.The journey
Sequence upon execution, performs the step of including above-mentioned each method embodiment；And foregoing storage medium includes：Read-only storage (English
Text：Read-only memory, abbreviation：ROM), RAM, flash memory, hard disk, solid state hard disc, tape (English：magnetic
Tape), floppy disk (English：Floppy disk), CD (English：Optical disc) and its any combination.
Finally it should be noted that：Various embodiments above is merely illustrative of the technical solution of the present invention, rather than its limitations；To the greatest extent
Pipe has been described in detail with reference to foregoing embodiments to the present invention, it will be understood by those within the art that：Its according to
The technical scheme described in foregoing embodiments can so be modified, or which part or all technical characteristic are entered
Row equivalent；And these modifications or replacement, the essence of appropriate technical solution is departed from various embodiments of the present invention technology
The scope of scheme.
Claims (10)
1. a kind of processing method of cluster task, it is characterised in that including：
Timed task is separately positioned on different execution queues according to cycle classification；
In each execution queue, the timed task performed within the execution cycle is marked；
When execution queue poll next time, according to the mark of each timed task, obtain within the execution cycle also not
The task of execution is performed.
2. method according to claim 1, it is characterised in that the execution cycle classification includes：
Execution per minute performs once, performs once daily, once per week or performs one every month once, per hour
It is secondary.
3. method according to claim 1 and 2, it is characterised in that described in each execution queue, will be in the cycle of execution
The timed task for inside having performed is marked, including：
By the timed task in the execution queue, held according to execution cycle, user's group, script command and execution weight
OK；
Wherein, the right of execution is reused in the execution number of times for identifying the task；Each timed task in the execution queue
It is the total execution number of times in preset duration to perform the initial value of weight, often performs once the timed task, the execution task
Corresponding execution weighted value subtracts one.
4. method according to claim 3, it is characterised in that the mark according to each timed task, obtains in institute
Also being not carried out in the execution cycle for task is stated to be performed, including：
Obtain the corresponding execution weight of each timed task；
When the right of execution is great in zero when, then the timed task is performed, and the execution weighted value of the timed task is subtracted
One；
When the execution weight is equal to zero, it is determined that execution task executed within the execution cycle is completed.
5. method according to claim 4, it is characterised in that methods described also includes：
If being more than the execution cycle in the presence of the execution time for performing queue, lock is set；It is described to lock for ensureing the execution
Poll next time is carried out after all tasks carryings of queue are complete again to perform.
6. a kind of processing unit of cluster task, it is characterised in that including：
First processing module, for timed task to be separately positioned on into different execution queues according to cycle classification；
Second processing module, in each execution queue, the timed task that will have been performed within the execution cycle to be carried out
Mark；
3rd processing module, for when execution queue poll next time, according to the mark of each timed task, obtaining in institute
Also being not carried out in the execution cycle for task is stated to be performed.
7. device according to claim 6, it is characterised in that the execution cycle classification includes：
Execution per minute performs once, performs once daily, once per week or performs one every month once, per hour
It is secondary.
8. the device according to claim 6 or 7, it is characterised in that the Second processing module specifically for：
By the timed task in the execution queue, held according to execution cycle, user's group, script command and execution weight
OK；
Wherein, the right of execution is reused in the execution number of times for identifying the task；Each timed task in the execution queue
It is the total execution number of times in preset duration to perform the initial value of weight, often performs once the timed task, the execution task
Corresponding execution weighted value subtracts one.
9. device according to claim 8, it is characterised in that the 3rd processing module specifically for：
Obtain the corresponding execution weight of each timed task；
When the right of execution is great in zero when, then the timed task is performed, and the execution weighted value of the timed task is subtracted
One；
When the execution weight is equal to zero, it is determined that execution task executed within the execution cycle is completed.
10. device according to claim 9, it is characterised in that described device also includes：
Fourth processing module, if for determining to set lock in the presence of when performing the execution time of queue more than the execution cycle；Institute
Lock is stated for ensureing that carrying out poll next time again after all tasks carryings of the execution queue are complete performs.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611248046.0A CN106844043A (en) | 2016-12-29 | 2016-12-29 | The treating method and apparatus of cluster task |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611248046.0A CN106844043A (en) | 2016-12-29 | 2016-12-29 | The treating method and apparatus of cluster task |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106844043A true CN106844043A (en) | 2017-06-13 |
Family
ID=59113153
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611248046.0A Pending CN106844043A (en) | 2016-12-29 | 2016-12-29 | The treating method and apparatus of cluster task |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106844043A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108509264A (en) * | 2018-03-30 | 2018-09-07 | 浙江口碑网络技术有限公司 | Overtime task dispatches system and method |
| CN108958915A (en) * | 2018-06-28 | 2018-12-07 | 中国建设银行股份有限公司 | Timed task executes method and device |
| CN111182011A (en) * | 2018-11-09 | 2020-05-19 | 中移（杭州）信息技术有限公司 | Service set distribution method and device |
| CN111290846A (en) * | 2020-02-26 | 2020-06-16 | 杭州涂鸦信息技术有限公司 | Distributed task scheduling method and system |
| CN112181640A (en) * | 2020-09-14 | 2021-01-05 | 北京幻想纵横网络技术有限公司 | Task processing method and device |
| CN112817808A (en) * | 2019-11-18 | 2021-05-18 | 赵伟 | Computer cluster maintenance task management method and system |
| CN113760522A (en) * | 2020-09-25 | 2021-12-07 | 北京沃东天骏信息技术有限公司 | Task processing method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1366416A (en) * | 2002-02-08 | 2002-08-28 | 华为技术有限公司 | Timer scheduling method |
| CN1870767A (en) * | 2005-12-14 | 2006-11-29 | 华为技术有限公司 | Method for managing timer task |
| CN102375772A (en) * | 2011-09-27 | 2012-03-14 | 云智慧（北京）科技有限公司 | Server monitoring method and device |
| CN102801559A (en) * | 2012-08-03 | 2012-11-28 | 南京富士通南大软件技术有限公司 | Intelligent local area network data collecting method |
| CN104936156A (en) * | 2015-06-25 | 2015-09-23 | 走遍世界（北京）信息技术有限公司 | Short message sending method and device |
-
2016
- 2016-12-29 CN CN201611248046.0A patent/CN106844043A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1366416A (en) * | 2002-02-08 | 2002-08-28 | 华为技术有限公司 | Timer scheduling method |
| CN1870767A (en) * | 2005-12-14 | 2006-11-29 | 华为技术有限公司 | Method for managing timer task |
| CN102375772A (en) * | 2011-09-27 | 2012-03-14 | 云智慧（北京）科技有限公司 | Server monitoring method and device |
| CN102801559A (en) * | 2012-08-03 | 2012-11-28 | 南京富士通南大软件技术有限公司 | Intelligent local area network data collecting method |
| CN104936156A (en) * | 2015-06-25 | 2015-09-23 | 走遍世界（北京）信息技术有限公司 | Short message sending method and device |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108509264A (en) * | 2018-03-30 | 2018-09-07 | 浙江口碑网络技术有限公司 | Overtime task dispatches system and method |
| CN108958915A (en) * | 2018-06-28 | 2018-12-07 | 中国建设银行股份有限公司 | Timed task executes method and device |
| CN111182011A (en) * | 2018-11-09 | 2020-05-19 | 中移（杭州）信息技术有限公司 | Service set distribution method and device |
| CN112817808A (en) * | 2019-11-18 | 2021-05-18 | 赵伟 | Computer cluster maintenance task management method and system |
| CN112817808B (en) * | 2019-11-18 | 2024-04-19 | 赵伟 | Computer cluster maintenance task management method and system |
| CN111290846A (en) * | 2020-02-26 | 2020-06-16 | 杭州涂鸦信息技术有限公司 | Distributed task scheduling method and system |
| CN111290846B (en) * | 2020-02-26 | 2023-08-18 | 杭州涂鸦信息技术有限公司 | Distributed task scheduling method and system |
| CN112181640A (en) * | 2020-09-14 | 2021-01-05 | 北京幻想纵横网络技术有限公司 | Task processing method and device |
| CN113760522A (en) * | 2020-09-25 | 2021-12-07 | 北京沃东天骏信息技术有限公司 | Task processing method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106844043A (en) | The treating method and apparatus of cluster task | |
| WO2019019381A1 (en) | Batch processing method and apparatus for insurance slip tasks, computer device and storage medium | |
| CN104731649A (en) | Multi-task processing method and multi-task processing device | |
| CN103677976B (en) | A kind of event-handling method and device based on time wheel timer | |
| CN109298951A (en) | The execution method and terminal device of Celery task | |
| US20150127920A1 (en) | Capacity forecasting based on capacity policies and transactions | |
| CN106776395B (en) | A kind of method for scheduling task and device of shared cluster | |
| US20210117291A1 (en) | Method, device and computer program product for job management | |
| CN108416580A (en) | Account checking method, account checking apparatus and electronic equipment | |
| CN105190546B (en) | Cost computing device, the method for cost accounting and computer readable recording medium storing program for performing | |
| CN108364230A (en) | A kind of account is withdrawn deposit method, apparatus, terminal device and storage medium | |
| US10311522B1 (en) | System and method for managing and editing accounting periods | |
| CN104536893B (en) | A kind of batch holds the processing method and processing device that reports an error | |
| CN113313463A (en) | Data analysis method and data analysis server applied to big data cloud office | |
| CN105446812A (en) | Multitask scheduling configuration method | |
| CN106779439A (en) | A kind of task distribution method and device | |
| CN103823711A (en) | Method and device for providing relative timing in Java virtual machine | |
| JP5557863B2 (en) | Plant equipment maintenance management system | |
| WO2019134084A1 (en) | Code execution method and apparatus, terminal device, and computer-readable storage medium | |
| CN109298925A (en) | A kind of start by set date method, system and the relevant apparatus of periodic duty | |
| CN108346045A (en) | A kind of account charging method, apparatus, terminal device and storage medium | |
| CN117236804B (en) | Financial enterprise performance identification method, equipment and medium | |
| CN107247621A (en) | The dispatching method and device of batch processing task | |
| CN107784483A (en) | Task execution control method and server | |
| CN109558238A (en) | Task executing method and device |
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: 20170613 |
|
| RJ01 | Rejection of invention patent application after publication |