CN110532114B - Timed task management system and distribution method based on message queue - Google Patents
Timed task management system and distribution method based on message queue Download PDFInfo
- Publication number
- CN110532114B CN110532114B CN201910830502.XA CN201910830502A CN110532114B CN 110532114 B CN110532114 B CN 110532114B CN 201910830502 A CN201910830502 A CN 201910830502A CN 110532114 B CN110532114 B CN 110532114B
- Authority
- CN
- China
- Prior art keywords
- node
- timing
- tasks
- task
- timed
- 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
- 238000000034 method Methods 0.000 title claims abstract description 33
- 230000004083 survival effect Effects 0.000 claims abstract description 8
- 230000008569 process Effects 0.000 claims description 3
- 238000012544 monitoring process Methods 0.000 claims description 2
- 230000001360 synchronised effect Effects 0.000 claims description 2
- 230000010365 information processing Effects 0.000 claims 2
- 238000005516 engineering process Methods 0.000 description 4
- 238000013461 design Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000002085 persistent effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000003442 weekly effect Effects 0.000 description 1
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/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
Abstract
The invention discloses a timing task management system and a distribution method based on a message queue, belonging to the field of timing task distribution and aiming at solving the technical problem of how to realize the management and distribution of timing tasks based on the message queue. The distribution method comprises the following steps: the method comprises the steps that a node table is accessed at regular time through nodes, whether each node in the node table is a dead node or a survival node is judged, each dead node is marked, and the number of all survival nodes is counted; marking and erasing the timing tasks corresponding to the dead nodes, wherein the timing tasks corresponding to the dead nodes become the masterless timing tasks; based on the number of the timing tasks and the number of the surviving nodes, the timing tasks are redistributed to the surviving nodes, and when the timing tasks are redistributed, the number of the timing tasks to be distributed corresponding to each surviving node is as follows: the number of timing tasks to be allocated is equal to the number of all timing tasks/the number of all surviving nodes.
Description
Technical Field
The invention relates to the field of timing task allocation, in particular to a timing task management system and an allocation method based on a message queue.
Background
The timing task is an indispensable thing in many internet projects, the traditional timing task management is realized by starting a thread in a program, the management mode consumes resources, and is tedious when the business is expanded, and the timing task management is not originally supported for distribution and can be used in a distributed system only by a complex design.
The existing timing task management platform of the open source in the industry adopts a complex design to ensure the expandability, asynchronism, peak clipping capability, idempotency and the like of the platform, and the characteristics can be completely realized through a message queue. The message queues are mature technologies in the industry, a plurality of open source technologies can be used, the performance is stable, the availability and the expandability are very strong, and the current internet projects basically have one or more message queue systems, so that a timing task platform is realized by multiplexing the message queues, the complexity is reduced, the stability is improved, and the service requirements can be met.
Based on the above analysis, how to manage and allocate the timing task based on the message queue is a technical problem to be solved.
Disclosure of Invention
The technical task of the invention is to provide a timing task management system and a distribution method based on a message queue to solve the problem of how to realize the management and distribution of the timing task based on the message queue.
In a first aspect, the present invention provides a timed task management system based on a message queue, including:
the executor is a process created in a corresponding program and is used for registering, modifying, deleting and executing a timing task;
the message queues are multiple in number, each message queue corresponds to one actuator and is used for transmitting the timing task to the corresponding actuator;
a node, which is a component, for allocating timed tasks to message queues;
the system comprises a database, wherein a task table and a node table are created in the database, the task table is used for storing timing task information, and the node table is used for storing node information.
Preferably, the system further comprises a front-end display interface, which is used for acquiring the timing task information and the node information from the database, displaying and monitoring the timing task information and the node information, and inserting the timing task into the database.
Preferably, the timing task information includes, but is not limited to, a name, an execution period, an execution group identifier, and task content;
and the timing task information is persistently stored in a task information table of a database.
Preferably, the node information includes a node ID and a node timestamp, and the node timestamp is used for identifying the time when the node accesses the database.
In a second aspect, the present invention provides a message queue-based timed task allocation method, which is applied to the message queue-based timed task system according to any one of the first aspect, and the allocation method includes:
the method comprises the steps that a node table is accessed at regular time through nodes, whether each node in the node table is a dead node or a survival node is judged, each dead node is marked, and the number of all survival nodes is counted;
marking and erasing the timing tasks corresponding to the dead nodes, wherein the timing tasks corresponding to the dead nodes become the masterless timing tasks;
based on the number of the timed tasks and the number of the surviving nodes, the timed tasks are redistributed to the surviving nodes, and when the timed tasks are redistributed, the number of the timed tasks to be distributed corresponding to each surviving node is as follows:
the number of timing tasks to be allocated is equal to the number of all timing tasks/the number of all surviving nodes.
Preferably, the step of reallocating the timing tasks to the surviving nodes based on the number of the timing tasks and the number of the surviving nodes by taking the node of the accessing node table as the accessing node comprises the following steps:
if the number of the timing tasks which are to be distributed and correspond to the access node is smaller than the number of the timing tasks which the access node already has, distributing the non-master timing tasks to the access node until the number of the timing tasks which the access node has is equal to the number of the timing tasks which the access node should distribute;
if the number of the timing tasks to be distributed corresponding to the access node is larger than the number of the owned timing tasks, calculating the interval time between the execution time of each owned timing task and the current time, taking the owned timing tasks with the interval time larger than a threshold value as the timing tasks to be erased, sequentially erasing marks on the timing tasks to be erased according to the sequence of the interval time from large to small, and changing the timing tasks to be erased into the timing tasks without the master timing tasks until the number of the timing tasks currently owned by the access node is equal to the number of the timing tasks to be distributed, or until all the timing tasks to be erased are changed into the timing tasks without the master timing tasks.
Preferably, when the node table is accessed through the node, the node timestamp corresponding to the access node is updated.
Preferably, each node in the node table is judged to be a dead node or a alive node by the following method:
and inquiring a node timestamp corresponding to each node in the node table, if the interval time between the node timestamp and the current time is greater than a threshold value, judging the node to be a dead node, and if the interval time between the node timestamp and the current time is less than or equal to the threshold value, judging the node to be a live node.
Preferably, the time of all nodes in the node information table is synchronized.
Preferably, when each node in the node table registers to access the timed task system, node information is generated and stored in the node table located in the database, and the node information includes a node ID and a timestamp.
The timing task management system and the distribution method based on the message queue have the following advantages that:
1. the nodes and the database form a timing task platform, the coupling between the timing task platform and the actuator is eliminated and the internal complexity is reduced by using a message queue technology, and the asynchronism, the peak clipping capability, the idempotency and the elastic expansibility are ensured to a certain extent by using the message queue technology;
2. the timing task allocation method can ensure that the issuing of the timing task is automatically reallocated when the nodes are increased or decreased under the condition of no center.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained based on these drawings without creative efforts.
The invention is further described below with reference to the accompanying drawings.
FIG. 1 is a block diagram of a message queue-based timed task management system according to embodiment 1;
fig. 2 is a flow chart of the method for distributing timed tasks based on message queues according to embodiment 2.
Detailed Description
The present invention is further described in the following with reference to the drawings and the specific embodiments so that those skilled in the art can better understand the present invention and can implement the present invention, but the embodiments are not to be construed as limiting the present invention, and the embodiments and the technical features of the embodiments can be combined with each other without conflict.
It is to be understood that the terms first, second, and the like in the description of the embodiments of the invention are used for distinguishing between the descriptions and not necessarily for describing a sequential or chronological order. The "plurality" in the embodiment of the present invention means two or more.
The term "and/or" in the embodiment of the present invention is only an association relationship describing an associated object, and indicates that three relationships may exist, for example, a and/or B may indicate: a exists alone, B exists alone, and A and B exist at the same time. In addition, the character "/" herein generally indicates that the former and latter associated objects are in an "or" relationship.
The embodiment of the invention provides a timed task management system and a timed task distribution method based on a message queue, which are used for solving the technical problem of how to realize the management and distribution of timed tasks based on the message queue.
Example 1:
the timing task management system based on the message queue comprises an executor, the message queue, a node and a database.
The system has a plurality of actuators, each actuator is at least one, and the actuators are processes created in corresponding programs and used for registering, modifying, deleting and executing timing tasks.
The message queues are multiple, each message queue corresponds to one executor and is used for transmitting the timing tasks to the corresponding executor, and the message queues support selective random issuing of the timing tasks or sequential issuing of the timing tasks.
The number of the nodes is multiple, the nodes are one component designed through decentralization, a timing task distribution algorithm is configured in the nodes, and the timing tasks are distributed to the message queues through the algorithm.
The principle of the allocation algorithm is: the node accesses the database at intervals to inquire timing tasks required to be distributed to the node to be issued, sends the timing tasks which are not executed to different message queues according to the actuator identifiers at corresponding trigger time, and updates the last execution timestamp of the timing task after the timing tasks are successfully sent. The communication of messages can be guaranteed through the message queue.
A task table and a node table are created in the database, the task table is used for storing timing task information, and the node table is used for storing node information.
The timing task information includes but is not limited to name, execution period, identification of the executive group and task content, and the timing task information is stored in the task information table of the database in a persistent manner. The name is the unique identification of the timing task, and the operations of modifying, deleting and the like of the timing task are all operated through the name.
The node information includes a node ID and a node timestamp identifying a time at which the node accessed the database.
The system can realize the registration, modification and deletion of the timing task, and is executed by an executor. The timing tasks in different periods are distributed in different task tables in the database and are divided into daily tasks, weekly tasks and monthly tasks.
The actuators in the system monitor the corresponding message queues, and after the timing task is issued to the message queues, any actuator receives and executes the timing task. When the execution of the executor fails, a failure message is sent to the message queue, and when a message is not sent for a certain time and a successful or failed message is not received, the message queue sets the timing task as failure. The failed timing task can be retransmitted, and if the retransmission exceeds a certain number of times, the task can enter a pending failure queue and alarm.
The system also comprises a front-end display interface, wherein the front-end display interface can access the database and monitor the timing tasks and the node health conditions, and meanwhile, the timing tasks can be inserted into the database through the front-end display interface.
Example 2:
the timed task allocation method based on the message queue is applied to the timed task system based on the message queue as disclosed in the embodiment 1. The distribution method comprises the following steps:
s100, regularly accessing a node table through nodes, judging whether each node in the node table is a dead node or a alive node, marking each dead node, and counting the number of all the alive nodes;
s200, marking and erasing the timing tasks corresponding to the dead nodes, wherein the timing tasks corresponding to the dead nodes become masterless timing tasks;
s300, based on the number of the timed tasks and the number of the surviving nodes, the timed tasks are redistributed to the surviving nodes, and when the timed tasks are redistributed, the number of the timed tasks to be distributed corresponding to each surviving node is as follows:
the number of timing tasks to be allocated is equal to the number of all timing tasks/the number of all surviving nodes.
When the number of timing tasks to be allocated is calculated by the above formula, a certain value is generally added as redundancy.
Wherein, the node of the access node table is an access node, and the timing task is redistributed to the surviving node based on the number of the timing tasks and the number of the surviving nodes, and the method comprises the following conditions:
if the number of the timing tasks which are to be distributed and correspond to the access node is smaller than the number of the timing tasks which the access node already has, distributing the non-master timing tasks to the access node until the number of the timing tasks which the access node has is equal to the number of the timing tasks which are to be distributed and correspond to the access node;
if the number of the timing tasks to be distributed corresponding to the access node is larger than the number of the owned timing tasks, calculating the interval time between the execution time of each owned timing task and the current time, taking the owned timing tasks with the interval time larger than a threshold value as the timing tasks to be erased, sequentially erasing marks on the timing tasks to be erased according to the sequence of the interval time from large to small, and changing the timing tasks to be erased into the timing tasks without the master timing tasks until the number of the timing tasks currently owned by the access node is equal to the number of the timing tasks to be distributed, or until all the timing tasks to be erased are changed into the timing tasks without the master timing tasks.
And when the node table is accessed through the node, updating the node timestamp corresponding to the access node.
Judging whether each node in the node table is a dead node or a live node by the following method: and inquiring a node timestamp corresponding to each node in the node table, if the interval time between the node timestamp and the current time is greater than a threshold value, judging the node to be a dead node, and if the interval time between the node timestamp and the current time is less than or equal to the threshold value, judging the node to be a live node.
Time synchronization of all nodes in the node information table.
And when each node in the node table is registered and accessed into the timing task system, generating node information and storing the node information in the node table positioned in the database, wherein the node information comprises a node ID and a timestamp.
All the operations are idempotent operations, and the database does not need any table locking operation.
The embodiments are merely preferred embodiments to fully illustrate the present invention, and the scope of the present invention is not limited thereto. The equivalent substitution or change made by the technical personnel in the technical field on the basis of the invention is all within the protection scope of the invention. The protection scope of the invention is subject to the claims.
Claims (7)
1. The timed task management system based on the message queue is characterized by comprising the following steps:
the system comprises a plurality of actuators, at least one actuator of each type, and a timing task, wherein the actuators are processes created in corresponding programs and used for registering, modifying, deleting and executing the timing task;
the message queues are multiple in number, each message queue corresponds to one actuator and is used for transmitting the timing task to the corresponding actuator;
a node, which is a component, for allocating timed tasks to message queues;
the system comprises a database, a timing task information processing module and a timing task information processing module, wherein a task table and a node table are created in the database, the task table is used for storing timing task information, and the node table is used for storing node information; the timing task information comprises a name, an execution period, an executor group identifier and task content, the node information comprises a node ID and a node timestamp, and the node timestamp is used for identifying the time of the node accessing the database;
the method comprises the following steps that a plurality of nodes are provided, each node is a component designed through decentralization, a timing task allocation algorithm is configured in each node, the timing task is allocated to a message queue through the algorithm, and the principle of the allocation algorithm is as follows: the method comprises the steps that a node accesses a database at intervals, queries timing tasks which need to be distributed to the node and are issued to message queues through the node, sends unexecuted timing tasks to different message queues according to actuator identifiers at corresponding trigger time, and updates the last execution timestamp of the timing task after the timing tasks are successfully sent;
the executor monitors a corresponding message queue, when a timing task is sent to the message queue, any executor corresponding to the message queue receives and executes the timing task, the executor fails to execute and sends a failure message to the message queue, when a message is not received successfully or fails after being sent for a certain time, the message queue sets the timing task as failure, the failed timing task is retransmitted, the retransmission exceeds a certain number of times, the message queue enters a pending failure queue, and an alarm is given;
the timing task management system is used for performing timing task allocation through the following steps:
the method comprises the steps that a node table is accessed at regular time through nodes, whether each node in the node table is a dead node or a survival node is judged, each dead node is marked, and the number of all survival nodes is counted;
the method comprises the steps that a timing task corresponding to a dead node is marked and erased, and the timing task corresponding to the dead node becomes a non-master timing task;
based on the number of the timed tasks and the number of the surviving nodes, the timed tasks are redistributed to the surviving nodes, and when the timed tasks are redistributed, the number of the timed tasks to be distributed corresponding to each surviving node is as follows:
the number of timing tasks to be allocated is equal to the number of all timing tasks/the number of all surviving nodes.
2. The message queue-based timed task management system according to claim 1, further comprising a front-end presentation interface for obtaining timed task information and node information from the database, presenting and monitoring the timed task information and node information, and for inserting timed tasks into the database.
3. The message queue-based timed task management system according to claim 1 or 2, characterized in that said timed task information is persistently stored in a task information table of a database.
4. A message queue-based timed task allocation method, which is applied to the message queue-based timed task management system according to any one of claims 1 to 3, and comprises the following steps:
the method comprises the steps that a node table is accessed at regular time through nodes, whether each node in the node table is a dead node or a survival node is judged, each dead node is marked, and the number of all survival nodes is counted;
marking and erasing the timing tasks corresponding to the dead nodes, wherein the timing tasks corresponding to the dead nodes become the masterless timing tasks;
based on the number of the timed tasks and the number of the surviving nodes, the timed tasks are redistributed to the surviving nodes, and when the timed tasks are redistributed, the number of the timed tasks to be distributed corresponding to each surviving node is as follows:
the number of timing tasks to be allocated is equal to the number of all timing tasks/the number of all surviving nodes;
the nodes of the access node table are access nodes, and the timed tasks are redistributed to the surviving nodes based on the number of the timed tasks and the number of the surviving nodes, and the method comprises the following steps:
if the number of the timing tasks which are to be distributed and correspond to the access node is smaller than the number of the timing tasks which the access node already has, distributing the non-master timing tasks to the access node until the number of the timing tasks which the access node has is equal to the number of the timing tasks which the access node should distribute;
if the number of the timing tasks to be distributed corresponding to the access node is larger than the number of the owned timing tasks, calculating the interval time between the execution time of each owned timing task and the current time, taking the owned timing tasks with the interval time larger than a threshold value as the timing tasks to be erased, sequentially erasing marks on the timing tasks to be erased according to the sequence of the interval time from large to small, and changing the timing tasks to be erased into the master-less timing tasks until the number of the timing tasks currently owned by the access node is equal to the number of the timing tasks to be distributed, or until all the timing tasks to be erased are changed into the master-less timing tasks;
judging whether each node in the node table is a dead node or a live node by the following method:
and inquiring a node timestamp corresponding to each node in the node table, if the interval time between the node timestamp and the current time is greater than a threshold value, judging the node to be a dead node, and if the interval time between the node timestamp and the current time is less than or equal to the threshold value, judging the node to be a live node.
5. The message queue-based timed task allocation method according to claim 4, characterized in that when a node accesses a node table, the node timestamp corresponding to the access node is updated.
6. The message queue-based timed task distribution method according to claim 4, characterized in that the time of all nodes in the node information table is synchronized.
7. The message queue-based timed task allocation method according to claim 4, wherein when each node in the node table registers to access the timed task system, node information is generated and stored in the node table located in the database, and the node information includes a node ID and a timestamp.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910830502.XA CN110532114B (en) | 2019-09-04 | 2019-09-04 | Timed task management system and distribution method based on message queue |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910830502.XA CN110532114B (en) | 2019-09-04 | 2019-09-04 | Timed task management system and distribution method based on message queue |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110532114A CN110532114A (en) | 2019-12-03 |
| CN110532114B true CN110532114B (en) | 2022-06-14 |
Family
ID=68666655
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910830502.XA Active CN110532114B (en) | 2019-09-04 | 2019-09-04 | Timed task management system and distribution method based on message queue |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110532114B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114205322A (en) * | 2021-12-13 | 2022-03-18 | 中国平安财产保险股份有限公司 | Message sending method and device, electronic equipment and storage medium |
| CN115002193A (en) * | 2022-04-27 | 2022-09-02 | 骤雨湾(武汉)技术服务有限公司 | Multi-channel remote service selection method, equipment, storage medium and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107688489A (en) * | 2016-08-03 | 2018-02-13 | 北京京东尚科信息技术有限公司 | A kind of method and system of scheduler task |
| CN108089915A (en) * | 2016-11-22 | 2018-05-29 | 北京京东尚科信息技术有限公司 | The method and system of business controlization processing based on message queue |
| CN108762952A (en) * | 2018-05-24 | 2018-11-06 | 吉旗（成都）科技有限公司 | A kind of distribution asynchronous data push scheme |
| CN110247810A (en) * | 2019-07-09 | 2019-09-17 | 浪潮云信息技术有限公司 | A kind of system and method for collection vessel service monitoring data |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10089142B2 (en) * | 2013-08-21 | 2018-10-02 | Hasso-Plattner-Institut Fur Softwaresystemtechnik Gmbh | Dynamic task prioritization for in-memory databases |
| US10515326B2 (en) * | 2015-08-28 | 2019-12-24 | Exacttarget, Inc. | Database systems and related queue management methods |
| CN107329820B (en) * | 2016-04-28 | 2019-12-20 | 杭州海康威视数字技术股份有限公司 | Task processing method and device for cluster system |
| CN106126332A (en) * | 2016-06-27 | 2016-11-16 | 北京京东尚科信息技术有限公司 | Distributed timing task scheduling system and method |
| CN107391188A (en) * | 2017-07-17 | 2017-11-24 | 聚好看科技股份有限公司 | A kind of method and apparatus for controlling timed task |
| CN108762931A (en) * | 2018-05-31 | 2018-11-06 | 康键信息技术（深圳）有限公司 | Method for scheduling task, server based on distributed scheduling system and storage medium |
| CN109634728B (en) * | 2018-11-16 | 2021-02-23 | 深圳市云智融科技有限公司 | Job scheduling method and device, terminal equipment and readable storage medium |
| CN109861887B (en) * | 2019-02-27 | 2020-08-28 | 浪潮云信息技术股份公司 | Zookeeper-based OpenTsdb service index aggregation method |
-
2019
- 2019-09-04 CN CN201910830502.XA patent/CN110532114B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107688489A (en) * | 2016-08-03 | 2018-02-13 | 北京京东尚科信息技术有限公司 | A kind of method and system of scheduler task |
| CN108089915A (en) * | 2016-11-22 | 2018-05-29 | 北京京东尚科信息技术有限公司 | The method and system of business controlization processing based on message queue |
| CN108762952A (en) * | 2018-05-24 | 2018-11-06 | 吉旗（成都）科技有限公司 | A kind of distribution asynchronous data push scheme |
| CN110247810A (en) * | 2019-07-09 | 2019-09-17 | 浪潮云信息技术有限公司 | A kind of system and method for collection vessel service monitoring data |
Non-Patent Citations (2)
| Title |
|---|
| Resource Allocation and Task Offloading;LEI LI等;《IEEE ACCESS》;20190107;第7卷;第9912-9925页 * |
| 一种异构主从模式数据同步园区停车系统的设计与实现;冯凌颖等;《计算机应用与软件》;20160415;第33卷(第04期);第64-67、75页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110532114A (en) | 2019-12-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108132830B (en) | Task scheduling method, device and system | |
| KR100517242B1 (en) | System and method for monitoring software queuing applications | |
| CN108959292B (en) | Data uploading method, system and computer readable storage medium | |
| US7328213B2 (en) | Transaction processing method, transaction control apparatus and program thereof | |
| CN108304255A (en) | Distributed task dispatching method and device, electronic equipment and readable storage medium storing program for executing | |
| CN110532114B (en) | Timed task management system and distribution method based on message queue | |
| CN103034735B (en) | Big data distributed file export method | |
| US9454575B2 (en) | Processing a metric of a component of a software-defined network | |
| CN110532067A (en) | Event-handling method, device, equipment and storage medium | |
| CN113448712A (en) | Task scheduling execution method and device | |
| CN103793273A (en) | Distributed type queue scheduling method and device based on Redis | |
| JP2014191594A (en) | Decentralized processing system | |
| US8301750B2 (en) | Apparatus, system, and method for facilitating communication between an enterprise information system and a client | |
| CN106462459A (en) | Managing metadata for distributed processing system | |
| CN111752920A (en) | Method, system, and storage medium for managing metadata | |
| US20070038900A1 (en) | System with executing nodes for executing schedules | |
| CN112433830A (en) | ZooKeeper-based distributed task scheduling method, system and storage medium | |
| CN113761052A (en) | Database synchronization method and device | |
| CN115185787B (en) | Method and device for processing transaction log | |
| CN104750849B (en) | For safeguarding the method and system of the catalogue relation based on tree structure | |
| CN111459737B (en) | Problem positioning method, device, computer equipment and storage medium | |
| EP3627359B1 (en) | Transaction processing method, device and equipment | |
| CN113542433B (en) | DevOps-based product synchronization method and device | |
| CN116567007B (en) | Task segmentation-based micro-service water conservancy data sharing and exchanging method | |
| CN112449061B (en) | Outbound task allocation method and device, computer equipment and readable 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 | ||
| CB02 | Change of applicant information |
Address after: 250100 No. 1036 Tidal Road, Jinan High-tech Zone, Shandong Province, S01 Building, Tidal Science Park Applicant after: Inspur cloud Information Technology Co.,Ltd. Address before: 250100 No. 1036 Tidal Road, Jinan High-tech Zone, Shandong Province, S01 Building, Tidal Science Park Applicant before: Tidal Cloud Information Technology Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |