CN115048207B - Task execution method, device and medium based on fixed time interval - Google Patents
Task execution method, device and medium based on fixed time interval Download PDFInfo
- Publication number
- CN115048207B CN115048207B CN202210983690.1A CN202210983690A CN115048207B CN 115048207 B CN115048207 B CN 115048207B CN 202210983690 A CN202210983690 A CN 202210983690A CN 115048207 B CN115048207 B CN 115048207B
- Authority
- CN
- China
- Prior art keywords
- time
- task
- task node
- redis
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
-
- 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
-
- 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/5061—Partitioning or combining of resources
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Synchronisation In Digital Transmission Systems (AREA)
- Electric Clocks (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a task execution method, equipment and medium based on a fixed time interval, belongs to the technical field of task deployment, and is used for solving the technical problem that the existing distributed deployment task is difficult to synchronize a stable fixed time interval to all task nodes so that only one task node executes a task at the same time. The method comprises the following steps: starting a plurality of task node servers based on a preset starting time interval; performing first task execution judgment on a plurality of task node servers; after the judgment is finished, determining the first timing starting time according to a preset task execution period; performing task locking through a plurality of task node servers, and executing the current task through the task node servers which are successfully locked; calculating the second time timing starting time according to the first time timing starting time and a preset task execution period; and after the second time of timing starting time is reached, performing task lock grabbing again to circulate.
Description
Technical Field
The present application relates to the field of task deployment, and in particular, to a method, a device, and a medium for task execution based on a fixed time interval.
Background
The most typical method for the existing task distributed deployment is database lock, redis lock and the like, but when the task is distributed, it is difficult to ensure that all nodes can execute the task at the same time interval, so that in the whole service, because the starting time of each node is different, the execution time points of the interval time are different, the task is difficult to be executed continuously and orderly, and the synchronization of the stable time interval to all nodes is not facilitated.
When the distributed tasks are deployed, multi-node processing is easily performed on the same task, and it is difficult to control that only one node executes the task at the same time, which causes resource waste and generates an erroneous execution result.
Disclosure of Invention
The embodiment of the application provides a task execution method, equipment and a medium based on a fixed time interval, which are used for solving the following technical problems: the existing distributed deployment task has difficulty in synchronizing a stable fixed time interval to all task nodes so that only one task node is executing the task at the same time.
The embodiment of the application adopts the following technical scheme:
in one aspect, an embodiment of the present application provides a task execution method based on a fixed time interval, where the method includes: starting a plurality of task node servers based on a preset starting time interval; performing first task execution judgment on the task node servers; after the judgment is finished, determining first timing starting time according to a preset task execution period; after the first time of timing starting time is reached, performing task locking by the plurality of task node servers, and executing the current task by the task node servers which are successfully locked; calculating the second time timing starting time according to the first time timing starting time and the preset task execution period; and after the second time of timing starting time is reached, performing task lock grabbing again, and executing the corresponding task through the task node server which succeeds in the task lock grabbing, so as to perform circulation.
According to the task execution method and device, the tasks are executed at fixed time intervals, so that all the task node servers can execute the tasks at one node at the same time, and can be synchronized to all the task node servers at stable time intervals, the problem that the execution time points of the time intervals are different due to different starting time of each node is solved, the task is continuously and orderly executed, the waste of resources is reduced, and the processing efficiency of the distributed deployment task is improved.
In a possible implementation manner, starting a plurality of task node servers based on a preset start time interval specifically includes: equally dividing the preset task execution period according to the preset starting time interval to obtain a plurality of equally divided time points; evenly distributing the task node servers to the equal time points; each equal time point corresponds to a plurality of task node servers; and sequentially starting the task node servers corresponding to each equally divided time point according to the time sequence of each equally divided time point.
According to the embodiment of the application, the time interval is divided in advance, then each time interval is refined and equally divided, the task node servers are evenly distributed to the equal division time points, the task node servers are started at each equal division time point to process the tasks, and the task processing is carried out orderly.
In a possible implementation manner, the determining of the first task execution of the task node servers specifically includes: inquiring whether next timing starting time is recorded in Redis corresponding to the current time node; if yes, determining that the task node servers do not execute the task for the first time; if not, determining that the task node servers execute the task for the first time.
In a possible implementation manner, after the determination is finished, determining a first timing start time according to a preset task execution period specifically includes: if the task node servers execute the task for the first time, selecting one of the task node servers of the current time node for locking, and writing node information of the locked task node server and first timing starting time into Redis; the locking means that the selected task node server is used as a node for currently executing a task and is written into the Redis, and expiration time is set; performing task execution operation through the locked task node server; and on the basis of the current time node, adding the preset task execution period to obtain the first time timing starting time.
In a feasible implementation manner, if the task node servers do not execute the task for the first time, the task node servers perform timing operation again according to a preset task execution period, and perform a lock snatching operation according to the current timing start time recorded in the Redis to obtain a lock snatching result; wherein the locking result comprises locking success and locking failure; the successful lock preemption means that no task node server which is executing the task is recorded in the Redis, and the failed lock preemption means that the task node server which is executing the task is recorded in the Redis.
In a possible implementation manner, if the lock robbing result is that the lock robbing is successful, recording the node information of the task node server with the successful lock robbing in the Redis; recording the first time timing starting time of the task node servers in the Redis; and if the lock robbing result is that the lock robbing fails, recording the first time timing starting time of the plurality of task node servers with the failed lock robbing in the Redis.
According to the embodiment of the application, the node information of the task node server which succeeds in locking is recorded in the Redis, so that only one task node server executes the task change at the same time point, and the phenomenon that a plurality of task node servers process one task at the same time to cause resource waste and result errors is avoided.
In a possible implementation manner, calculating a second time timing starting time according to the first time timing starting time and the preset task execution cycle specifically includes: judging whether the current time reaches the first time timing starting time recorded in Redis; if yes, starting a plurality of task node servers corresponding to the first timing starting time, and performing task lock grabbing operation to obtain a lock grabbing result; wherein the locking result comprises locking success and locking failure; recording the node information of the task node server successfully subjected to the lock grabbing in the Redis; on the basis of the first time timing starting time, adding the preset task execution period to obtain a second time timing starting time, and recording the second time timing starting time of the task node server which is successfully subjected to the lock grabbing in the Redis; and re-timing the task node servers with failed lock snatching according to the preset task execution period, and recording the second timing starting time of the task node servers in the Redis.
In a feasible implementation manner, after the second time of the timed start time is reached, performing task lock grabbing again, and executing a corresponding task through a task node server which succeeds in the task lock grabbing, so as to perform a cycle, specifically including: if the second time timing starting time is reached, starting a plurality of task node servers corresponding to the second time timing starting time, and performing task lock snatching operation under the second time timing starting time to obtain a lock snatching result under the second time timing starting time; calculating the third time timing starting time of the plurality of task node servers according to the locking result and the preset task execution period, recording the third time timing starting time in Redis, and recording the node information of the task node servers with successful locking in Redis, so as to carry out circulation.
In a second aspect, an embodiment of the present application further provides a task execution device based on a fixed time interval, where the device includes: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method for performing tasks based on fixed time intervals as described in any one of the above embodiments.
In a third aspect, an embodiment of the present application further provides a non-volatile computer storage medium, where the storage medium is a non-volatile computer-readable storage medium, where the non-volatile computer-readable storage medium stores at least one program, each program includes instructions, and when the instructions are executed by a terminal, the instructions cause the terminal to execute a fixed-time-interval-based task execution method according to any one of the foregoing embodiments.
The embodiment of the application provides a task execution method, equipment and medium based on a fixed time interval, and the fixed time interval is preset to enable all task node servers to execute tasks by only one node at the same time and synchronize to all nodes at a stable time interval, so that the problem of different execution time points of the interval time caused by different starting time of each node is solved, the task is continuously and orderly executed, the waste of resources is reduced, and the processing efficiency of distributed deployment tasks is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the description below are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art without creative efforts. In the drawings:
fig. 1 is a flowchart of a distributed fixed-time interval task method provided in an embodiment of the present application;
FIG. 2 is a schematic diagram of time interval halving according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a distributed task device with a fixed time interval according to an embodiment of the present application.
Detailed Description
In order to make those skilled in the art better understand the technical solutions in the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making any inventive step based on the embodiments of the present disclosure, shall fall within the scope of protection of the present disclosure.
The embodiment of the application provides a task execution method based on a fixed time interval, and as shown in fig. 1, the task execution method based on the fixed time interval specifically includes steps 101 to 105:
step 101, starting a plurality of task node servers based on a preset time interval.
Specifically, the preset task execution period is equally divided according to a preset starting time interval, and a plurality of equally divided time points are obtained. Evenly distributing a plurality of task node servers to a plurality of equally-divided time points; and each equally divided time point corresponds to a plurality of task node servers. And sequentially starting a plurality of task node servers corresponding to each equally divided time point according to the time sequence of each equally divided time point.
In an embodiment, fig. 2 is a schematic time interval equal division diagram provided in the embodiment of the present application, as shown in fig. 2, starting at 10.
And 102, judging the first task execution of the task node servers.
Specifically, whether next timing start time is recorded in Redis corresponding to the current time node is queried. And if so, determining that the task node servers do not execute the task for the first time. If not, determining that the task node servers execute the task for the first time.
In an embodiment, after a task node server is started, it is determined whether a newly started task node server records the next time timing start time in Redis, that is, whether a plurality of task node servers execute a task for the first time, as shown in fig. 2, the first start is performed between 10.
And 103, after the judgment is finished, determining the first timing starting time according to the preset task execution period.
Specifically, if the task node servers execute the task for the first time, one of the task node servers at the current time node is selected for locking, and the node information of the locked task node server and the first time timing start time are written into the Redis. The locking means that the selected task node server is used as a node for currently executing the task, and is written into Redis, and the expiration time is set. And performing task execution operation through the locked task node server. And on the basis of the current time node, adding a preset task execution cycle to obtain the first time timing starting time.
In one embodiment, as shown in fig. 2, when several task node servers execute a task for the first time, at 10 of interval 1. Wherein, the next starting time is the time of the current locking operation plus the preset task execution period (10 minutes), and starting is performed again at 10.
And if the task node servers do not execute the task for the first time, carrying out timing operation on the task node servers again according to a preset task execution period, and carrying out locking grabbing operation according to the current timing starting time recorded in Redis to obtain a locking grabbing result. And the lock robbing result comprises the success of the lock robbing and the failure of the lock robbing. The successful lock preemption means that the task node server which is executing the task is not recorded in the Redis, and the failure of lock preemption means that the task node server which is executing the task is recorded in the Redis.
In one embodiment, when the task node server does not execute the task for the first time and the current starting time of the task node server has elapsed, the task node server starts and performs lock snatching according to the next starting time in Redis, and a lock snatching result is obtained. As shown in fig. 2, if there is a plurality of task node servers in the interval 1 that do not execute the task for the first time, the node servers do not perform the lock grabbing operation in the current interval with the task node server that executes the task for the first time, the node servers continue to perform the timing operation, and when the time point corresponding to the interval 2 is reached, the node servers are started again, and then the lock grabbing operation is performed.
If the lock robbing result is that the lock robbing is successful, recording the node information of the task node server with the successful lock robbing in Redis; and recording the first time timing starting time of the task node servers in Redis. And if the lock robbing result is that the lock robbing fails, recording the first time timing starting time of the task node servers with the failed lock robbing in Redis.
In one embodiment, when a lock robbing operation is performed, two results of success and failure are obtained, a plurality of task node servers at a certain time can perform the lock robbing operation simultaneously, when one task node server succeeds in lock robbing, the node information of the task node server is recorded in the associated Redis, and the next starting time of the task node server, namely the first time starting time, is recorded in the Redis, and the rest of the task node servers failing in lock robbing only record the next starting time, namely the first time starting time, in the Redis.
In one embodiment, as shown in fig. 2, at 10, a lock preemption operation of multiple servers is performed, and when a task node server succeeds in lock preemption, the node information of the task node server at 10.
And step 104, after the first time starting time is reached, performing task locking by the plurality of task node servers, and executing the current task by the task node server which is successfully locked.
In one embodiment, as shown in fig. 2, after the first time timing start time is reached, performing lock acquisition judgment, locking operation, recording in Redis, task execution, next start timing, and the like on a plurality of task node servers in each equal time interval 2, that is, 10.
And 105, calculating the second time timing starting time according to the first time timing starting time and a preset task execution period. And after the second time of timing starting time is reached, performing task lock grabbing again, and executing the corresponding task through the task node server which succeeds in the task lock grabbing so as to perform circulation.
Specifically, whether the current time reaches the first time of timing start time recorded in Redis is judged; if yes, starting a plurality of task node servers corresponding to the first time timing starting time, and performing task lock grabbing operation to obtain a lock grabbing result. And the lock robbing result comprises the success of the lock robbing and the failure of the lock robbing. And recording the node information of the task node server successfully subjected to the lock grabbing in Redis. And on the basis of the first time of timing starting time, adding a preset task execution cycle to obtain second time of timing starting time, and recording the second time of timing starting time of the task node server which is successfully subjected to the locking robbery in Redis. And re-timing a plurality of task node servers which fail to rob the lock according to a preset task execution period, and recording the second timing starting time of the plurality of task node servers in Redis.
Further, if the second time of the timed starting time is reached, starting a plurality of task node servers corresponding to the second time of the timed starting time, and performing task lock grabbing operation at the second time of the timed starting time to obtain a lock grabbing result at the second time of the timed starting time. Calculating the third timing starting time of the plurality of task node servers according to the result of the lock grabbing and the preset task execution period, recording the third timing starting time in Redis, and recording the node information of the task node servers with successful lock grabbing in Redis, so as to carry out circulation.
In an embodiment, as shown in fig. 2, after the first time of the timing start time in the interval 2 is completed, a series of operations such as lock acquisition and Redis recording are performed according to a preset task execution period (10 minutes), and then the second time of the timing start time in the interval 3 is obtained, and then after the corresponding series of operations such as lock acquisition and Redis recording are completed in the interval 3, the third time of the timing start time in the interval 4 is obtained, and the process continues to cycle until the task node server is shut down according to actual conditions.
In addition, an embodiment of the present application further provides a task execution device based on a fixed time interval, and as shown in fig. 3, the distributed task execution device 300 with a fixed time interval specifically includes:
at least one processor 301, and a memory 302 communicatively coupled to the at least one processor 301; wherein the memory 302 stores instructions executable by the at least one processor 301 to enable the at least one processor 301 to:
starting a plurality of task node servers based on a preset starting time interval; performing first task execution judgment on a plurality of task node servers; after the judgment is finished, determining the first timing starting time according to a preset task execution period; after the first time of starting time is reached, the task is locked through a plurality of task node servers, and the current task is executed through the task node servers which are successfully locked; calculating the second time timing starting time according to the first time timing starting time and a preset task execution period; and after the second time of timing starting time is reached, performing task lock grabbing again, and executing the corresponding task through the task node server which succeeds in the task lock grabbing so as to perform circulation.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Disks (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
The embodiment of the application provides a task execution method, equipment and medium based on a fixed time interval, only one node of all task node servers executes a task at the same time by presetting the fixed time interval, and the task node servers can synchronize to all nodes at a stable time interval, so that the problem of different execution time points of the interval time caused by different starting time of each node is solved, coherent and ordered execution of the tasks is realized, the waste of resources is reduced, and the processing efficiency of distributed deployment tasks is improved.
The embodiments in the present application are described in a progressive manner, and the same and similar parts among the embodiments can be referred to each other, and each embodiment focuses on differences from other embodiments. In particular, as for the device and non-volatile computer storage medium embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and reference may be made to the partial description of the method embodiments for relevant points.
The foregoing description of specific embodiments of the present application has been presented. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art to which the embodiments of the present application pertain. Any modification, equivalent replacement, improvement or the like made within the spirit and principle of the embodiments of the present application shall be included in the scope of the claims of the present application.
Claims (6)
1. A method for performing tasks based on fixed time intervals, the method comprising:
starting a plurality of task node servers based on a preset starting time interval;
the first task execution judgment is carried out on the task node servers, and the method specifically comprises the following steps:
inquiring whether the next timing starting time is recorded in Redis corresponding to the current time node;
if yes, determining that the task node servers do not execute the task for the first time;
if not, determining that the task node servers execute the task for the first time;
after the judgment is finished, determining the first timing starting time according to a preset task execution cycle, specifically comprising:
if the task node servers execute the task for the first time, selecting one of the task node servers of the current time node for locking, and writing the node information of the locked task node server and the first time timing starting time into Redis; the locking means that the selected task node server is used as a node for currently executing a task and is written into the Redis, and expiration time is set;
performing task execution operation through the locked task node server;
adding the preset task execution period to the current time node to obtain the first time timing starting time;
if the task node servers do not execute the task for the first time, the task node servers are subjected to timing operation again according to a preset task execution period, and locking grabbing operation is performed according to the current timing starting time recorded in the Redis to obtain a locking grabbing result; wherein the locking result comprises locking success and locking failure;
the locking success means that a task node server which is executing a task is not recorded in the Redis, and the locking failure means that the task node server which is executing the task is recorded in the Redis;
if the lock robbing result is that the lock robbing is successful, recording the node information of the task node server with the successful lock robbing in the Redis; recording the first time timing starting time of the task node servers in the Redis;
if the lock robbing result is that the lock robbing fails, recording the first time timing starting time of a plurality of task node servers with the failed lock robbing in the Redis;
after the first time starting time is reached, performing task locking by the plurality of task node servers, and executing the current task by the task node server which is successfully locked;
calculating the second time timing starting time according to the first time timing starting time and the preset task execution period; and after the second time of timing starting time is reached, performing task lock grabbing again, and executing the corresponding task through the task node server which succeeds in the task lock grabbing, so as to perform circulation.
2. The task execution method based on the fixed time interval as claimed in claim 1, wherein starting the plurality of task node servers based on a preset starting time interval specifically comprises:
equally dividing the preset task execution period according to the preset starting time interval to obtain a plurality of equally divided time points;
evenly distributing the task node servers to the equal division time points; each equal time point corresponds to a plurality of task node servers;
and sequentially starting the plurality of task node servers corresponding to each equally divided time point according to the time sequence of each equally divided time point.
3. The method according to claim 1, wherein the step of calculating the second time starting timing time according to the first time starting timing time and the preset task execution period specifically comprises:
judging whether the current time reaches the first time timing starting time recorded in Redis;
if yes, starting a plurality of task node servers corresponding to the first timing starting time, and performing task lock grabbing operation to obtain a lock grabbing result; wherein the locking result comprises locking success and locking failure;
recording the node information of the task node server successfully subjected to the lock grabbing in the Redis;
on the basis of the first time timing starting time, adding the preset task execution period to obtain a second time timing starting time, and recording the second time timing starting time of the task node server which is successfully subjected to the lock grabbing in the Redis;
and re-timing the task node servers with failed lock snatching according to the preset task execution period, and recording the second timing starting time of the task node servers in the Redis.
4. The method for executing tasks based on the fixed time interval according to claim 1, wherein after the second time of the timed start time is reached, the task is locked again, and the corresponding task is executed by the task node server that successfully performs the lock acquisition, so as to perform a cycle, specifically comprising:
if the second time of the timed starting time is reached, starting a plurality of task node servers corresponding to the second time of the timed starting time, and performing task lock grabbing operation under the second time of the timed starting time to obtain a lock grabbing result under the second time of the timed starting time;
calculating the third time timing starting time of the plurality of task node servers according to the locking result and the preset task execution period, recording the third time timing starting time in Redis, and recording the node information of the task node servers with successful locking in Redis, so as to carry out circulation.
5. A task execution device based on a fixed time interval, the device comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a fixed time interval based task execution method according to any one of claims 1-4.
6. A non-transitory computer storage medium, wherein the storage medium is a non-transitory computer readable storage medium, and the non-transitory computer readable storage medium stores at least one program, each program comprising instructions, which when executed by a terminal, cause the terminal to perform a fixed-time-interval-based task execution method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210983690.1A CN115048207B (en) | 2022-08-17 | 2022-08-17 | Task execution method, device and medium based on fixed time interval |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210983690.1A CN115048207B (en) | 2022-08-17 | 2022-08-17 | Task execution method, device and medium based on fixed time interval |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115048207A CN115048207A (en) | 2022-09-13 |
| CN115048207B true CN115048207B (en) | 2022-12-16 |
Family
ID=83166705
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210983690.1A Active CN115048207B (en) | 2022-08-17 | 2022-08-17 | Task execution method, device and medium based on fixed time interval |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115048207B (en) |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4396988B2 (en) * | 2006-03-03 | 2010-01-13 | 三菱電機インフォメーションシステムズ株式会社 | Database system |
| US9152523B2 (en) * | 2010-09-15 | 2015-10-06 | Qualcomm Incorporated | Batching and forking resource requests in a portable computing device |
| CN108182108A (en) * | 2017-12-19 | 2018-06-19 | 山东浪潮商用系统有限公司 | A kind of timed task cluster and its execution method |
| CN111562971A (en) * | 2020-04-09 | 2020-08-21 | 北京明略软件系统有限公司 | Scheduling method and system of distributed timer |
| CN112463318B (en) * | 2020-11-17 | 2024-05-17 | 深圳市优必选科技股份有限公司 | Timing task processing method, device and system |
| CN112698961A (en) * | 2020-12-31 | 2021-04-23 | 银盛支付服务股份有限公司 | Using method of redis distributed lock in kafka distributed program |
| CN113064740A (en) * | 2021-04-02 | 2021-07-02 | 北京京东拓先科技有限公司 | Message processing method and device |
| CN113127082A (en) * | 2021-04-23 | 2021-07-16 | 中国工商银行股份有限公司 | Data processing method, server, service node, system and storage medium |
-
2022
- 2022-08-17 CN CN202210983690.1A patent/CN115048207B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN115048207A (en) | 2022-09-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107391628B (en) | Data synchronization method and device | |
| CN106899654B (en) | Sequence value generation method, device and system | |
| CN107515874B (en) | Method and equipment for synchronizing incremental data in distributed non-relational database | |
| CN112383610B (en) | Synchronous processing method and system for block chain state data | |
| CN112487083B (en) | Data verification method and device | |
| CN106339387A (en) | Data synchronization method and device of server newly added to database cluster | |
| CN115048207B (en) | Task execution method, device and medium based on fixed time interval | |
| CN111309548A (en) | Timeout monitoring method and device and computer readable storage medium | |
| CN104636218B (en) | Data reconstruction method and device | |
| CN110825758B (en) | Transaction processing method and device | |
| CN111756803A (en) | Server-side pushing method, equipment and medium based on block chain technology | |
| CN109032536B (en) | Data storage method, device, system and equipment based on distributed cluster system | |
| AU2021330430B2 (en) | Full backup method and apparatus for distributed database system, and computer-readable storage medium | |
| CN110119389B (en) | Writing operation method of virtual machine block equipment, snapshot creation method and device | |
| CN116414914A (en) | Data synchronization method and device, processor and electronic equipment | |
| CN110990378A (en) | Block chain-based data consistency comparison method, device and medium | |
| CN112817717B (en) | Scheduling method and device for timing tasks | |
| CN116578642A (en) | Data synchronization method and device, storage medium and electronic equipment | |
| CN111949675A (en) | Distributed strong-consistency assembly | |
| CN117251510A (en) | Data synchronization method and device | |
| CN114584572B (en) | Data synchronization method, device, equipment and medium in distributed object storage | |
| CN115686943A (en) | Data backup method and device based on block chain | |
| CN117149728B (en) | Online synchronization method and system for multi-node data of upper computer of trusted distributed control system | |
| CN115834601A (en) | Multi-center-based data synchronization method, device, equipment and medium | |
| CN115168444A (en) | Block chain based state data reconstruction method and device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |