CN103744724A - Timed task clustering method and device thereof - Google Patents
Timed task clustering method and device thereof Download PDFInfo
- Publication number
- CN103744724A CN103744724A CN201410055769.3A CN201410055769A CN103744724A CN 103744724 A CN103744724 A CN 103744724A CN 201410055769 A CN201410055769 A CN 201410055769A CN 103744724 A CN103744724 A CN 103744724A
- Authority
- CN
- China
- Prior art keywords
- timed task
- node
- cluster
- timed
- lock
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a timed task clustering method and a timed task clustering device. The method comprises the following steps: distributing nodes in a cluster at server nodes with odd number which is at least three, distributing timed task instances on the timed task nodes, obtaining timed task executing right from the cluster according to planned time point by each timed task instance, executing the timed tasks by the timed task instances with a write-in right, giving up executing the timed tasks by the timed task instances without the write-in right, till the next planned time point, and then circularly executing and obtaining the timed task executing right. After the adoption of the technical scheme, the method and the device can solve a single-point problem of the timed processing technology, and implement high availability of the timed cluster.
Description
Technical field
The invention belongs to field of computer technology, be specifically related to a kind of timed task cluster method and device thereof.
Background technology
Under linux environment, conventionally adopt Crontab technology to carry out timed task.But this technical scheme exists single-point problem,, on a certain linux server, if crontab process operation irregularity or linux server itself are delayed, machine damages, and can cause goal task regularly not carry out by expection; If use a plurality of linux server disposition crontab tasks, exist again same task to be repeated the problem of carrying out.
Spring quartz is one, JAVA field and the similar Timing Processing technology of crontab, has execution mechanism and the defect identical with crontab.Cannot solve single-point problem, not reach high available.
The single-point problem running into for simple Clusterings such as crontab, it is available that Quartz Clustering has realized the height of timed task, with a plurality of timed task examples, by striving lock mechanism, determines that certain time point carries out timed task by one of them timed task example.Because the common usage data of existing quartz Clustering storehouse is as lock medium, group scheme is very heavy, and it is available because the height of timing cluster is available, to depend on the height of database, and reality has strengthened regularly cluster and realized high available difficulty.
Summary of the invention
The invention provides a kind of timed task cluster method and device thereof, it can solve the single-point problem of timed task scheme in prior art, thereby the height of realization timing cluster is available.
For achieving the above object, the invention provides a kind of timed task cluster method, this timed task cluster method comprises:
By the node distributed deployment in cluster on the odd number server node of at least three;
By the distributed deployment of timed task example on each timed task node;
Each timed task example according to schedule time point obtains timed task enforcement of rights in cluster, acquisition writes the timed task example of power will carry out timed task, the timed task example that does not obtain the power that writes abandons carrying out timed task, until next planned time point, recycle is carried out and is obtained timed task enforcement of rights.
Further, also comprise:
Each timed task example applies for writing identical routing information according to identical path naming rule in cluster.
Further, described path naming rule comprises:
According to timed task bag name, class name, current time stamp, generate node path.
Further, also comprise:
Each timed task is carried out while regularly calculating, employing distributed lock mechanism, according to identical path naming rule, in cluster, apply for creating an interim node, and obtain the sequence number of all establishment nodes under described interim node, according to the sequence number of described interim node, judge whether to obtain to lock successfully and calculate to determine whether to carry out regularly.
Further, judge whether to obtain and lock successfully to determine whether that carrying out timing ga(u)ge calculator body comprises:
Whether the sequence number that judges described interim node is minimum, if so, obtains lock, continues to carry out regularly and calculates, and calculates the interim node of complete deletion; If not, obtain and lock unsuccessfully, delete interim node, cancel this and regularly calculate.
When further, each timed task node starts, the retention time is synchronous.
Further, also comprise:
According to bag name and class name to timed task, distinguish, to realize different timed tasks, share cluster.
For achieving the above object, the invention provides a kind of device of realizing timed task cluster, this device comprises:
Node configuration unit, for by the node distributed deployment in cluster at more than 3 odd numbers server node;
Timed task example setting unit, for by the distributed deployment of timed task example at each timed task node;
Timed task performance element, for each timed task example according to schedule time point in cluster, obtain timed task enforcement of rights, acquisition writes the timed task example of power will carry out timed task, the timed task example that does not obtain the power that writes abandons carrying out timed task, until next planned time point, recycle is carried out and is obtained timed task enforcement of rights.
Further, also comprise:
Each timed task is carried out while regularly calculating, employing distributed lock mechanism, according to identical path naming rule, in cluster, apply for creating an interim node, and obtain the sequence number of all establishment nodes under described interim node, according to the sequence number of described interim node, judge whether to obtain to lock successfully and calculate to determine whether to carry out regularly.
Further, judge whether to obtain and lock successfully to determine whether that carrying out timing ga(u)ge calculator body comprises:
Whether the sequence number that judges described interim node is minimum, if so, obtains lock, continues to carry out regularly and calculates, and calculates the interim node of complete deletion; If not, obtain and lock unsuccessfully, delete interim node, cancel this and regularly calculate.
Timed task cluster method provided by the invention and device thereof, dispose by timed task multiple spot, solves the single-point problem of timed task scheme in prior art.In the present invention, a plurality of timed task examples move simultaneously, at some expeced time, only have a timed task example to execute the task; Even if one of them example, because chance failure cannot be moved, still has other examples to guarantee that timed task is carried out; Adopt zookeeper distributed lock mechanism, have at the same time in the situation of a plurality of timed task examples, guarantee to only have an example to obtain and carry out authority.It has avoided the lock side case that adopts database heavy like this, makes timed task cluster more simple and convenient on disposing and safeguarding.
Accompanying drawing explanation
The schematic flow sheet of the timed task cluster method that Fig. 1 provides for the embodiment of the present invention one;
The structural representation of the device of realizing timed task cluster that Fig. 2 provides for the embodiment of the present invention two;
Fig. 3 is the application schematic diagram of the device of realizing timed task cluster in embodiment bis-.
Embodiment
For making those skilled in the art understand better technical scheme of the present invention, below in conjunction with the drawings and specific embodiments, the present invention is described in further detail.
The schematic flow sheet of the timed task cluster method that Fig. 1 provides for the embodiment of the present invention one, as shown in Figure 1, this timed task cluster method comprises:
Step S1, by the node distributed deployment in cluster on the odd number server node of at least three.
Particularly, the distributed deployment of Zookeeper node, on an odd number server node, is disposed manyly, and reliability is just higher, disposes odd number, and Zookeeper cluster is with the more than half whole cluster machines of delaying that just can allow of the machine number of delaying, and odd number cluster is better.
Step S2, by the distributed deployment of timed task example on each timed task node.
Step S3, each timed task example according to schedule time point obtain timed task enforcement of rights in cluster, acquisition writes the timed task example of power will carry out timed task, the timed task example that does not obtain the power that writes abandons carrying out timed task, until next planned time point, recycle is carried out and is obtained timed task enforcement of rights.
Particularly, each timed task is for forever staying process, to planned time point, each timed task example program writes identical routing information according to identical path naming rule to the application of Zookeeper cluster, and the timed task example that obtains the power that writes will be carried out timed task; The timing example that does not obtain the power that writes abandons carrying out timed task, waits until next planned time point, and each timed task repeats aforesaid operations again.
Preferably, example applies for writing identical routing information according to identical path naming rule in cluster.Path naming rule comprises: according to timed task bag name, class name, current time stamp, generate node path.For example: " cn.knet.timing.TcpTask ", to carry out regularly and calculate 20: 30 on the 5th August in 2010 according to plan, generation pass should be "/cn/knet/timing/tcptask/201008052030 ".
Each timed task is carried out while regularly calculating, employing distributed lock mechanism, according to identical path naming rule, in cluster, apply for creating an interim node, and obtain the sequence number of all establishment nodes under interim node, according to the sequence number of interim node, judge whether to obtain to lock successfully and calculate to determine whether to carry out regularly.
Further, judge whether to obtain and lock successfully to determine whether that carrying out timing ga(u)ge calculator body comprises:
Whether the sequence number that judges interim node is minimum, if so, obtains lock, continues to carry out regularly and calculates, and calculates the interim node of complete deletion; If not, obtain and lock unsuccessfully, delete interim node, cancel this and regularly calculate.
In the present embodiment, when each timed task node starts, the retention time is synchronous.According to bag name and class name to timed task, distinguish, to realize different timed tasks, share cluster.Each timed task is carried out while regularly calculating, first according to identical path naming rule, to zookeeper application, create an interim node, and obtain the sequence number of all establishment nodes under this node, if the node ID of oneself is minimum, be considered as obtaining lock, continue to carry out regularly and calculate, calculate the interim node of complete deletion; If own node ID is not minimum, be considered as obtaining and lock unsuccessfully, delete interim node, cancel this and regularly calculate.
In the timed task cluster method that the present embodiment provides, a plurality of timed task examples move simultaneously, at some expeced time, only have a timed task example to execute the task; Even if one of them example, because chance failure cannot be moved, still has other examples to guarantee that timed task is carried out; Adopt zookeeper distributed lock mechanism, have at the same time in the situation of a plurality of timed task examples, guarantee to only have an example to obtain and carry out authority.It has avoided the lock side case that adopts database heavy like this, makes timed task cluster more simple and convenient on disposing and safeguarding.
The structural representation of the device of realizing timed task cluster that Fig. 2 provides for the embodiment of the present invention two, as shown in Figure 2, this device of realizing timed task cluster comprises: Node configuration unit 21, timed task example setting unit 22 and timed task performance element 23, wherein, Node configuration unit 21 for by the node distributed deployment in cluster at more than 3 odd numbers server node; Timed task example setting unit 22 for by the distributed deployment of timed task example at each timed task node; Timed task performance element 23 for each timed task example according to schedule time point in cluster, obtain timed task enforcement of rights, acquisition writes the timed task example of power will carry out timed task, the timed task example that does not obtain the power that writes abandons carrying out timed task, until next planned time point, recycle is carried out and is obtained timed task enforcement of rights.
Preferably, each timed task is carried out while regularly calculating, employing distributed lock mechanism, according to identical path naming rule, in cluster, apply for creating an interim node, and obtain the sequence number of all establishment nodes under described interim node, according to the sequence number of described interim node, judge whether to obtain and lock successfully to determine whether to carry out timing calculating.
Further, judge whether to obtain and lock successfully to determine whether that carrying out timing ga(u)ge calculator body comprises:
Whether the sequence number that judges described interim node is minimum, if so, obtains lock, continues to carry out regularly and calculates, and calculates the interim node of complete deletion; If not, obtain and lock unsuccessfully, delete interim node, cancel this and regularly calculate.
In the timed task Extension arrangement that the present embodiment provides, a plurality of timed task examples move simultaneously, at some expeced time, only have a timed task example to execute the task; Even if one of them example, because chance failure cannot be moved, still has other examples to guarantee that timed task is carried out; Adopt Zookeeper distributed lock mechanism, have at the same time in the situation of a plurality of timed task examples, guarantee to only have an example to obtain and carry out authority.It has avoided the lock side case that adopts database heavy like this, makes timed task cluster more simple and convenient on disposing and safeguarding.
Fig. 3 is the application schematic diagram of the device of realizing timed task cluster in embodiment bis-, and as shown in Figure 3, this group system comprises: Zookeeper cluster, timed task example 1 and timed task example 2.
Particularly, by the node distributed deployment in Zookeeper cluster on the odd number server node of at least three; By the distributed deployment of timed task example on each timed task node; Each timed task example according to schedule time point obtains timed task enforcement of rights in cluster, acquisition writes the timed task example of power will carry out timed task, the timed task example that does not obtain the power that writes abandons carrying out timed task, until next planned time point, recycle is carried out and is obtained timed task enforcement of rights.
The present invention adopts distributed lock mechanism, and when each timed task node starts, the retention time is synchronous.According to bag name and class name to timed task, distinguish, to realize different timed tasks, share cluster.Each timed task is carried out while regularly calculating, employing distributed lock mechanism, according to identical path naming rule, in cluster, apply for creating an interim node, and obtain the sequence number of all establishment nodes under described interim node, according to the sequence number of described interim node, judge whether to obtain to lock successfully and calculate to determine whether to carry out regularly.
Particularly, each timed task is carried out while regularly calculating, first according to identical path naming rule, to zookeeper application, create an interim node, and obtain the sequence number of all establishment nodes under this node, if the node ID of oneself is minimum, be considered as obtaining lock, continue to carry out regularly and calculate, calculate the interim node of complete deletion; If own node ID is not minimum, be considered as obtaining and lock unsuccessfully, delete interim node, cancel this and regularly calculate.
In the present invention.The height of timed task is available to be guaranteed by multiple instances deployment; The available high available characteristic being carried by Zookeeper itself of height of distributed lock guarantees.Timed task bag name and class name are distinguished, can be realized different timed tasks and share cluster.Only need to build a set of zookeeper running environment, for all timed tasks of enterprises, share.
In the timed task group system that the present embodiment provides, a plurality of timed task examples move simultaneously, at some expeced time, only have a timed task example to execute the task; Even if one of them example, because chance failure cannot be moved, still has other examples to guarantee that timed task is carried out; Adopt zookeeper distributed lock mechanism, have at the same time in the situation of a plurality of timed task examples, guarantee to only have an example to obtain and carry out authority.It has avoided the lock side case that adopts database heavy like this, makes timed task cluster more simple and convenient on disposing and safeguarding.
Be understandable that, above embodiment is only used to principle of the present invention is described and the illustrative embodiments that adopts, yet the present invention is not limited thereto.For those skilled in the art, without departing from the spirit and substance in the present invention, can make various modification and improvement, these modification and improvement are also considered as protection scope of the present invention.
Claims (10)
1. a timed task cluster method, is characterized in that, comprising:
By the node distributed deployment in cluster on the odd number server node of at least three;
By the distributed deployment of timed task example on each timed task node;
Each timed task example according to schedule time point obtains timed task enforcement of rights in cluster, acquisition writes the timed task example of power will carry out timed task, the timed task example that does not obtain the power that writes abandons carrying out timed task, until next planned time point, recycle is carried out and is obtained timed task enforcement of rights.
2. timed task cluster method according to claim 1, is characterized in that, also comprises:
Each timed task example applies for writing identical routing information according to identical path naming rule in cluster.
3. timed task cluster method according to claim 2, is characterized in that, described path naming rule comprises:
According to timed task bag name, class name, current time stamp, generate node path.
4. timed task cluster method according to claim 3, is characterized in that, also comprises:
Each timed task is carried out while regularly calculating, employing distributed lock mechanism, according to identical path naming rule, in cluster, apply for creating an interim node, and obtain the sequence number of all establishment nodes under described interim node, according to the sequence number of described interim node, judge whether to obtain to lock successfully and calculate to determine whether to carry out regularly.
5. timed task cluster method according to claim 4, is characterized in that, judges whether to obtain to lock successfully to determine whether that carrying out timing ga(u)ge calculator body comprises:
Whether the sequence number that judges described interim node is minimum, if so, obtains lock, continues to carry out regularly and calculates, and calculates the interim node of complete deletion; If not, obtain and lock unsuccessfully, delete interim node, cancel this and regularly calculate.
6. timed task cluster method according to claim 5, is characterized in that, when each timed task node starts, the retention time is synchronous.
7. timed task cluster method according to claim 6, is characterized in that, also comprises:
According to bag name and class name to timed task, distinguish, to realize different timed tasks, share cluster.
8. a device of realizing timed task cluster, is characterized in that, comprising:
Node configuration unit, for by the node distributed deployment in cluster at more than 3 odd numbers server node;
Timed task example setting unit, for by the distributed deployment of timed task example at each timed task node;
Timed task performance element, for each timed task example according to schedule time point in cluster, obtain timed task enforcement of rights, acquisition writes the timed task example of power will carry out timed task, the timed task example that does not obtain the power that writes abandons carrying out timed task, until next planned time point, recycle is carried out and is obtained timed task enforcement of rights.
9. the device of realizing timed task cluster according to claim 8, is characterized in that, also comprises:
Each timed task is carried out while regularly calculating, employing distributed lock mechanism, according to identical path naming rule, in cluster, apply for creating an interim node, and obtain the sequence number of all establishment nodes under described interim node, according to the sequence number of described interim node, judge whether to obtain to lock successfully and calculate to determine whether to carry out regularly.
10. the device of realizing timed task cluster according to claim 9, is characterized in that, judges whether to obtain to lock successfully to determine whether that carrying out timing ga(u)ge calculator body comprises:
Whether the sequence number that judges described interim node is minimum, if so, obtains lock, continues to carry out regularly and calculates, and calculates the interim node of complete deletion; If not, obtain and lock unsuccessfully, delete interim node, cancel this and regularly calculate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410055769.3A CN103744724A (en) | 2014-02-19 | 2014-02-19 | Timed task clustering method and device thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410055769.3A CN103744724A (en) | 2014-02-19 | 2014-02-19 | Timed task clustering method and device thereof |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103744724A true CN103744724A (en) | 2014-04-23 |
Family
ID=50501744
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410055769.3A Pending CN103744724A (en) | 2014-02-19 | 2014-02-19 | Timed task clustering method and device thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103744724A (en) |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105530298A (en) * | 2015-12-14 | 2016-04-27 | 微梦创科网络科技（中国）有限公司 | Deployment and operation method, device and system of Crontab singleton program |
| CN106155816A (en) * | 2015-04-22 | 2016-11-23 | Tcl集团股份有限公司 | The mutual exclusion processing method and processing device of task |
| CN106712981A (en) * | 2015-07-23 | 2017-05-24 | 阿里巴巴集团控股有限公司 | Method and device for informing node change |
| CN107092521A (en) * | 2016-12-30 | 2017-08-25 | 北京小度信息科技有限公司 | A kind of distributed task dispatching method, apparatus and system |
| CN107168813A (en) * | 2017-04-28 | 2017-09-15 | 平安科技（深圳）有限公司 | Task processing method and system |
| CN107301178A (en) * | 2016-04-14 | 2017-10-27 | 阿里巴巴集团控股有限公司 | Data query processing method, apparatus and system |
| CN107621975A (en) * | 2017-09-11 | 2018-01-23 | 中邮科通信技术股份有限公司 | Timer logic implementation method based on JAVA TIMER high availability |
| CN107688500A (en) * | 2017-07-26 | 2018-02-13 | 阿里巴巴集团控股有限公司 | A kind of distributed task scheduling processing method, device, system and equipment |
| CN107894919A (en) * | 2017-11-30 | 2018-04-10 | 中国平安财产保险股份有限公司 | Timed task triggering method, device, equipment and readable storage medium storing program for executing |
| CN107918556A (en) * | 2016-10-11 | 2018-04-17 | 北京京东尚科信息技术有限公司 | A kind of timed task performs method and apparatus in the parallel of multiple servers |
| CN108182108A (en) * | 2017-12-19 | 2018-06-19 | 山东浪潮商用系统有限公司 | A kind of timed task cluster and its execution method |
| CN108710537A (en) * | 2018-04-09 | 2018-10-26 | 平安科技（深圳）有限公司 | A kind of task processing method, storage medium and server |
| CN108710541A (en) * | 2018-05-22 | 2018-10-26 | 泰康保险集团股份有限公司 | A kind of execution method and device of timed task |
| CN108733459A (en) * | 2017-04-13 | 2018-11-02 | 腾讯科技（深圳）有限公司 | A kind of method of distributed timing, server and system |
| CN110046144A (en) * | 2019-03-25 | 2019-07-23 | 阿里巴巴集团控股有限公司 | Access the method, device and equipment of database |
| CN110134503A (en) * | 2019-04-28 | 2019-08-16 | 中国银行股份有限公司 | Timed task processing method, device and storage medium under a kind of cluster environment |
| CN110266779A (en) * | 2019-06-10 | 2019-09-20 | 南威软件股份有限公司 | A kind of principal and subordinate local timed task processing method and system based on zookeeper |
| CN110704185A (en) * | 2019-09-20 | 2020-01-17 | 深圳市递四方信息科技有限公司 | Cluster system and method for scheduling fragment timing tasks of cluster system |
| CN110704172A (en) * | 2019-09-20 | 2020-01-17 | 深圳市递四方信息科技有限公司 | Cluster system timing task scheduling method and cluster system |
| WO2020024405A1 (en) * | 2018-08-03 | 2020-02-06 | 平安科技（深圳）有限公司 | Test method, device, server and storage medium based on distributed coordination |
| CN110888739A (en) * | 2019-11-22 | 2020-03-17 | 南京甄视智能科技有限公司 | Distributed processing method and device for delayed tasks |
| CN111240749A (en) * | 2018-11-28 | 2020-06-05 | 中国移动通信集团浙江有限公司 | Suspension control method and device for instance in cluster system |
| CN112817712A (en) * | 2021-01-26 | 2021-05-18 | 广州欢网科技有限责任公司 | Distributed scheduling method and device and advertisement system |
| CN114661742A (en) * | 2022-03-28 | 2022-06-24 | 浪潮卓数大数据产业发展有限公司 | Zookeeper-based distributed lock acquisition method and system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101140528A (en) * | 2007-08-31 | 2008-03-12 | 中兴通讯股份有限公司 | Method, device and system for realizing timing tasks load equilibria in cluster |
| CN103197969A (en) * | 2013-03-27 | 2013-07-10 | 百度在线网络技术（北京）有限公司 | Distributed timed task control device and method |
-
2014
- 2014-02-19 CN CN201410055769.3A patent/CN103744724A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101140528A (en) * | 2007-08-31 | 2008-03-12 | 中兴通讯股份有限公司 | Method, device and system for realizing timing tasks load equilibria in cluster |
| CN103197969A (en) * | 2013-03-27 | 2013-07-10 | 百度在线网络技术（北京）有限公司 | Distributed timed task control device and method |
Non-Patent Citations (3)
| Title |
|---|
| CHUCK CAVANESS: "《Quartz Job Scheduling Framework：Building Open Source Enterprise Application》", 30 June 2006, PEARSON EDUCATION * |
| PATRICK HUNT等: "Zookeeper:Wait-free Coordination for Internet-scale Systems", 《PROCEEDINGS OF THE 2010 USENIX CONFERENCE ON USENIX ANNUAL TECHNICAL CONFERENCE》 * |
| QING: "zookeeper实战：SingleWorker代码样例", 《HTTP://SHIFT-ALT-CTRL.ITEYE.COM/BLOG/1861308》 * |
Cited By (36)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106155816A (en) * | 2015-04-22 | 2016-11-23 | Tcl集团股份有限公司 | The mutual exclusion processing method and processing device of task |
| CN106155816B (en) * | 2015-04-22 | 2019-08-02 | Tcl集团股份有限公司 | The mutual exclusion processing method and processing device of task |
| CN106712981A (en) * | 2015-07-23 | 2017-05-24 | 阿里巴巴集团控股有限公司 | Method and device for informing node change |
| CN106712981B (en) * | 2015-07-23 | 2020-03-06 | 阿里巴巴集团控股有限公司 | Node change notification method and device |
| CN105530298A (en) * | 2015-12-14 | 2016-04-27 | 微梦创科网络科技（中国）有限公司 | Deployment and operation method, device and system of Crontab singleton program |
| CN107301178B (en) * | 2016-04-14 | 2021-07-02 | 创新先进技术有限公司 | Data query processing method, device and system |
| CN107301178A (en) * | 2016-04-14 | 2017-10-27 | 阿里巴巴集团控股有限公司 | Data query processing method, apparatus and system |
| CN107918556A (en) * | 2016-10-11 | 2018-04-17 | 北京京东尚科信息技术有限公司 | A kind of timed task performs method and apparatus in the parallel of multiple servers |
| CN107092521A (en) * | 2016-12-30 | 2017-08-25 | 北京小度信息科技有限公司 | A kind of distributed task dispatching method, apparatus and system |
| CN107092521B (en) * | 2016-12-30 | 2020-11-10 | 北京星选科技有限公司 | Distributed task scheduling method, device and system |
| CN108733459A (en) * | 2017-04-13 | 2018-11-02 | 腾讯科技（深圳）有限公司 | A kind of method of distributed timing, server and system |
| CN107168813A (en) * | 2017-04-28 | 2017-09-15 | 平安科技（深圳）有限公司 | Task processing method and system |
| WO2018196154A1 (en) * | 2017-04-28 | 2018-11-01 | 平安科技（深圳）有限公司 | Task processing method, system, terminal, and computer readable storage medium |
| CN107688500A (en) * | 2017-07-26 | 2018-02-13 | 阿里巴巴集团控股有限公司 | A kind of distributed task scheduling processing method, device, system and equipment |
| CN107688500B (en) * | 2017-07-26 | 2021-12-24 | 创新先进技术有限公司 | Distributed task processing method, device, system and equipment |
| CN107621975A (en) * | 2017-09-11 | 2018-01-23 | 中邮科通信技术股份有限公司 | Timer logic implementation method based on JAVA TIMER high availability |
| CN107894919A (en) * | 2017-11-30 | 2018-04-10 | 中国平安财产保险股份有限公司 | Timed task triggering method, device, equipment and readable storage medium storing program for executing |
| CN108182108A (en) * | 2017-12-19 | 2018-06-19 | 山东浪潮商用系统有限公司 | A kind of timed task cluster and its execution method |
| CN108710537A (en) * | 2018-04-09 | 2018-10-26 | 平安科技（深圳）有限公司 | A kind of task processing method, storage medium and server |
| CN108710541A (en) * | 2018-05-22 | 2018-10-26 | 泰康保险集团股份有限公司 | A kind of execution method and device of timed task |
| CN108710541B (en) * | 2018-05-22 | 2022-02-01 | 泰康保险集团股份有限公司 | Timed task execution method and device |
| WO2020024405A1 (en) * | 2018-08-03 | 2020-02-06 | 平安科技（深圳）有限公司 | Test method, device, server and storage medium based on distributed coordination |
| CN111240749B (en) * | 2018-11-28 | 2023-07-21 | 中国移动通信集团浙江有限公司 | Suspending control method, device, equipment and storage medium of instance in cluster system |
| CN111240749A (en) * | 2018-11-28 | 2020-06-05 | 中国移动通信集团浙江有限公司 | Suspension control method and device for instance in cluster system |
| CN110046144A (en) * | 2019-03-25 | 2019-07-23 | 阿里巴巴集团控股有限公司 | Access the method, device and equipment of database |
| CN110134503A (en) * | 2019-04-28 | 2019-08-16 | 中国银行股份有限公司 | Timed task processing method, device and storage medium under a kind of cluster environment |
| CN110134503B (en) * | 2019-04-28 | 2021-06-18 | 中国银行股份有限公司 | Timed task processing method and device in cluster environment and storage medium |
| CN110266779A (en) * | 2019-06-10 | 2019-09-20 | 南威软件股份有限公司 | A kind of principal and subordinate local timed task processing method and system based on zookeeper |
| CN110704172A (en) * | 2019-09-20 | 2020-01-17 | 深圳市递四方信息科技有限公司 | Cluster system timing task scheduling method and cluster system |
| CN110704185A (en) * | 2019-09-20 | 2020-01-17 | 深圳市递四方信息科技有限公司 | Cluster system and method for scheduling fragment timing tasks of cluster system |
| CN110704172B (en) * | 2019-09-20 | 2024-03-12 | 深圳市递四方信息科技有限公司 | Cluster system timing task scheduling method and cluster system |
| CN110704185B (en) * | 2019-09-20 | 2024-03-22 | 深圳市递四方信息科技有限公司 | Cluster system fragmentation timing task scheduling method and cluster system |
| CN110888739B (en) * | 2019-11-22 | 2020-10-20 | 南京甄视智能科技有限公司 | Distributed processing method and device for delayed tasks |
| CN110888739A (en) * | 2019-11-22 | 2020-03-17 | 南京甄视智能科技有限公司 | Distributed processing method and device for delayed tasks |
| CN112817712A (en) * | 2021-01-26 | 2021-05-18 | 广州欢网科技有限责任公司 | Distributed scheduling method and device and advertisement system |
| CN114661742A (en) * | 2022-03-28 | 2022-06-24 | 浪潮卓数大数据产业发展有限公司 | Zookeeper-based distributed lock acquisition method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103744724A (en) | Timed task clustering method and device thereof | |
| US11360688B2 (en) | Cascading snapshot creation in a native replication 3-site configuration | |
| US9965215B1 (en) | Disk synchronizing | |
| CN103473277B (en) | The Snapshot Method and device of file system | |
| CN105871603B (en) | A kind of the real time streaming data processing fail recovery and method of data grids based on memory | |
| CN103744906A (en) | System, method and device for data synchronization | |
| Riesen et al. | Alleviating scalability issues of checkpointing protocols | |
| CN104461747A (en) | Distributed type task scheduling system | |
| CN104699541A (en) | Method, device, data transmission assembly and system for synchronizing data | |
| CN104468174A (en) | Method and device for cluster servers to execute task | |
| CN104298541A (en) | Data distribution algorithm and data distribution device for cloud storage system | |
| CN105518641A (en) | Method, device, and system for peer-to-peer data replication and method, device, and system for master node switching | |
| CN105354108A (en) | Data backup method and node | |
| CN105721582A (en) | Multi-node file backup system | |
| Xia et al. | Performance and availability modeling of ITSystems with data backup and restore | |
| CN112099800B (en) | Code data processing method, device and server | |
| CN104866378A (en) | System and method for coordinating execution tasks | |
| CN103152390A (en) | Method and device and nodes and system for node configuration of distributed storage system | |
| CN103618762A (en) | System and method for enterprise service bus state pretreatment based on AOP | |
| CN102946411A (en) | Network synchronization system | |
| CN103294799B (en) | A kind of data parallel batch imports the method and system of read-only inquiry system | |
| CN104486373A (en) | Lock resource migration method, nodes and distributed system | |
| CN104503868B (en) | Method of data synchronization, device and system | |
| CN109165210A (en) | A kind of method and device of cluster Hbase Data Migration | |
| CN107656796A (en) | A kind of virtual machine cold moving method, system and equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140423 |