CN110532114A - Timing task management system and distribution method based on message queue - Google Patents
Timing task management system and distribution method based on message queue Download PDFInfo
- Publication number
- CN110532114A CN110532114A CN201910830502.XA CN201910830502A CN110532114A CN 110532114 A CN110532114 A CN 110532114A CN 201910830502 A CN201910830502 A CN 201910830502A CN 110532114 A CN110532114 A CN 110532114A
- Authority
- CN
- China
- Prior art keywords
- node
- timed task
- task
- message queue
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer And Data Communications (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of timing task management system and distribution method based on message queue, belong to timed task distribution field, technical problems to be solved are that the management and distribution of timed task how are realized based on message queue, and system includes actuator, message queue, node and database.Distribution method includes: to judge that each node marks each death nodes for death nodes or surviving node in node table, and count the quantity of all surviving nodes by node timer access node table；Timed task corresponding with death nodes is marked and is erased, the timed task corresponding with death nodes becomes dereliction timed task；The quantity of quantity and surviving node based on timed task, timed task is redistributed for surviving node, when redistributing timed task, each surviving node is corresponding should to distribute timed task quantity are as follows: should distribute timed task quantity=all timed tasks quantity/all surviving nodes quantity.
Description
Technical field
The present invention relates to timed tasks to distribute field, specifically a kind of timing task management system based on message queue
System and distribution method.
Background technique
Timed task is essential thing in many internet projects, and traditional timing task management is by journey
Play what thread was realized inside sequence, this way to manage compares consuming resource, and while activating business is comparatively laborious, and its not original
It is raw to support distribution, it could be used in distributed system reluctantly by comparing complicated design.
The timing task management platform of present industry open source guarantees its scalability, asynchronous using complicated design
Property, peak clipping ability, idempotence etc., and these characteristics can be realized completely by message queue.Message queue has been
The technology of industry maturation, has numerous open source technologies can be used, and its performance is stablized, and availability is very strong with scalability,
Present internet project, which is substantially all, has one or more Message Queuing systems, therefore by being multiplexed these message queues,
It realizes timed task platform, both reduces complexity, increase stability, and can satisfy business demand.
Based on above-mentioned analysis, the management and distribution that timed task how is realized based on message queue are the skills for needing to solve
Art problem.
Summary of the invention
Technical assignment of the invention is against the above deficiency, to provide a kind of timing task management system based on message queue
And distribution method, come solve the problems, such as how based on message queue realize timed task management and distribution.
In a first aspect, the present invention provides a kind of timing task management system based on message queue, comprising:
Actuator, the actuator is the process being created in corresponding program, for registering, modifying, delete and execute
Timed task；
Message queue, the message queue is multiple altogether, and each message queue corresponds to a kind of actuator, for appointing timing
Business is sent to corresponding actuator；
Node, the node is a component, for distributing timed task to message queue；
Database, the interior creation of the database have task list and node table, and task list is saved for storing timing task information
Point table is used for memory node information.
More preferably, further include that front end shows interface, for obtaining timing task information and nodal information from database, and open up
Show and monitor timing task information and nodal information, and for being inserted into timed task to database.
Preferably, timing task information includes but is not limited to title, executes period, actuator group mark, task definition；
The timing task information persistent storage is in the mission bit stream table of database.
Preferably, nodal information includes node ID and node time stamp, the node time stamp is visited for identifying node
Ask the time of database.
Second aspect, the present invention provide a kind of timed task distribution method based on message queue, are applied to such as first party
The described in any item timed task systems based on message queue in face, the distribution method include:
By node timer access node table, judge that each node is death nodes or surviving node in node table, marks
Remember each death nodes, and counts the quantity of all surviving nodes；
Timed task corresponding with death nodes is marked and is erased, the timed task corresponding with death nodes becomes
For dereliction timed task；
The quantity of quantity and surviving node based on timed task redistributes timed task for surviving node, again
When distributing timed task, each surviving node is corresponding should to distribute timed task quantity are as follows:
Timed task quantity=all timed tasks quantity/all surviving nodes quantity should be distributed.
Preferably, the node of accessed node table is accessed node, quantity and surviving node based on timed task
Quantity redistributes timed task for surviving node, comprising:
If the corresponding timed task quantity that should distribute of accessed node is less than its timed task quantity possessed, by institute
It states dereliction timed task to distribute to the accessed node, until the timed task quantity that the accessed node possesses should divide equal to it
With timed task quantity；
If the corresponding timed task quantity that should distribute of accessed node calculates each greater than timed task quantity has been possessed
Possess the interval time of the execution time and current time of timed task, interval time has possessed timed task greater than threshold value
As timed task to be erased, according to interval time sequence from large to small, successively treats timed task of erasing and be marked and smear
Dereliction timed task is removed and becomes, until the timed task quantity that the accessed node is currently owned by, which is equal to, should distribute timed task
Quantity, alternatively, until the timed task that needs to be erased becomes dereliction timed task.
Preferably, updating the corresponding node time stamp of the accessed node when passing through node visit node table.
Preferably, judging that each node is death nodes or surviving node in node table by the following method:
The corresponding node time stamp of each node in query node table, if between node time stamp and current time
It is greater than threshold value every the time, determines the node for death nodes, if if node time stabs the interval between current time
Time is less than or equal to threshold value, determines the node for surviving node.
Preferably, in the informational table of nodes all nodes time synchronization.
Preferably, generation nodal information simultaneously will when each Node registry accesses the timed task system in node table
Nodal information is stored in the node table positioned at database, and nodal information includes node ID and timestamp.
A kind of timing task management system and distribution method based on message queue of the invention has the advantage that
1, node, database composition timed task platform eliminate timed task platform and hold using message queue technology
The coupling of row device simultaneously reduces internal complexity, and utilizes message queue technology, ensure that asynchronism, peak clipping to a certain extent
Ability, idempotence, resilient expansion；
2, timed task distribution method can guarantee in acentric situation, automatically by timed task when node increases and decreases
Publication is redistributed.
Detailed description of the invention
It to describe the technical solutions in the embodiments of the present invention more clearly, below will be to required in being described in embodiment
The attached drawing used is briefly introduced, it should be apparent that, drawings in the following description are only some embodiments of the invention, for
For those skilled in the art, without creative efforts, it can also be obtained according to these attached drawings
His attached drawing.
The following further describes the present invention with reference to the drawings.
Attached drawing 1 is the structural block diagram of timing task management system of the embodiment 1 based on message queue；
Attached drawing 2 is the flow diagram of timed task distribution method of the embodiment 2 based on message queue.
Specific embodiment
The present invention will be further explained below with reference to the attached drawings and specific examples, so that those skilled in the art can be with
It more fully understands the present invention and can be practiced, but illustrated embodiment is not as a limitation of the invention, the case where not conflicting
Under, the technical characteristic in the embodiment of the present invention and embodiment can be combined with each other.
It is to be appreciated that in the description of the embodiment of the present invention, the vocabulary such as " first ", " second " are only used for distinguishing and retouch
The purpose stated, is not understood to indicate or imply relative importance, can not be interpreted as indication or suggestion sequence.In the present invention
" multiple " in embodiment, refer to two or more.
Belong to "and/or" in the embodiment of the present invention, only a kind of incidence relation for describing affiliated partner, expression can be with
There are three kinds of relationships, for example, A and/or B, can indicate: individualism A, individualism B exist simultaneously these three feelings of A and B
Condition.In addition, it is a kind of "or" relationship that character "/", which typicallys represent forward-backward correlation object, herein.
The embodiment of the present invention provides a kind of timing task management system and distribution method based on message queue, for solving
The technical issues of how management and distribution of timed task being realized based on message queue.
Embodiment 1:
Timing task management system based on message queue of the invention, including actuator, message queue, node and data
Library.
Actuator is a variety of altogether in the system, every kind of actuator at least one, actuator be created in corresponding program into
Journey, for registering, modifying, delete and executing timed task.
Message queue is multiple altogether, and each message queue corresponds to a kind of actuator, for timed task to be sent to correspondence
Actuator, and message queue support selectivity random granting timed task or sequence provide timed task.
Node is multiple altogether, and node is the component designed by decentralization, and configuring timing tasks distribution is calculated in node
Method is realized by the algorithm and distributes timed task to message queue.
The principle of allocation algorithm are as follows: node accesses data base querying at regular intervals and needs to distribute to what oneself to be issued
Timed task, and in the corresponding triggered time, different messages team is sent according to actuator mark by the timed task being not carried out
In column, the last time that the timed task is updated after sending successfully executes timestamp.It can guarantee the reception and registration of message by message queue.
Creation has task list and node table in database, and task list is for storing timing task information, and node table is for depositing
Store up nodal information.
Wherein timing task information includes but is not limited to title, executes period, actuator group mark, task definition, timing
Mission bit stream persistent storage is in the mission bit stream table of database.Title is the unique identification of timed task, to timed task
The operations such as modify, delete are operated by title.
Nodal information includes node ID and node time stamp, and the node time stamp is for identifying node visit database
Time.
The system can realize the registration, modification, deletion of timed task, and have actuator execution.The timing of different cycles
Task distribution in different task table, is divided into a day task, all tasks and moon task in database.
Actuator monitors corresponding message queue, after timed task is issued to message queue, any execution in the system
Device will receive and go to the timed task.Actuator executes failure, can send failed message to message queue, disappear when one
Breath transmission does not receive after a certain period of time successfully or the timed task is set failure by failure news, message queue.It loses
The timed task lost can be retransmitted, and retransmitting is more than that certain number can enter failure queue undetermined, and alert.
The system further includes that front end shows that interface, front end show interface accessible database and be good for timed task, node
Health situation is monitored, meanwhile, show that interface can be inserted into timed task to database by front end.
Embodiment 2:
Timed task distribution method based on message queue of the invention is applied to be based on message as embodiment 1 is disclosed
The timed task system of queue.The distribution method includes the following steps:
S100, by node timer access node table, judge in node table that each node is still survived section for death nodes
Point marks each death nodes, and counts the quantity of all surviving nodes；
S200, timed task corresponding with death nodes is marked and is erased, the timing corresponding with death nodes
Task becomes dereliction timed task；
The quantity of S300, the quantity based on timed task and surviving node redistribute timed task for surviving node,
When redistributing timed task, each surviving node is corresponding should to distribute timed task quantity are as follows:
Timed task quantity=all timed tasks quantity/all surviving nodes quantity should be distributed.
When timed task quantity should be distributed by above-mentioned formula calculating, certain numerical value generally will increase as redundancy.
Wherein, the node of accessed node table be accessed node, the quantity of quantity and surviving node based on timed task,
Timed task, including following situation are redistributed for surviving node:
If the corresponding timed task quantity that should distribute of accessed node is less than its timed task quantity possessed, by institute
It states dereliction timed task to distribute to the accessed node, until the timed task quantity that the accessed node possesses should divide equal to it
With timed task quantity；
If the corresponding timed task quantity that should distribute of accessed node calculates each greater than timed task quantity has been possessed
Possess the interval time of the execution time and current time of timed task, interval time has possessed timed task greater than threshold value
As timed task to be erased, according to interval time sequence from large to small, successively treats timed task of erasing and be marked and smear
Dereliction timed task is removed and becomes, until the timed task quantity that the accessed node is currently owned by, which is equal to, should distribute timed task
Quantity, alternatively, until the timed task that needs to be erased becomes dereliction timed task.
When by node visit node table, the corresponding node time stamp of the accessed node is updated.
Judge that each node is death nodes or surviving node in node table by the following method: every in query node table
The corresponding node time stamp of a node determines institute if the interval time between node time stamp and current time is greater than threshold value
Stating node is death nodes, if sentenced if the interval time between node time stamp and current time is less than or equal to threshold value
The fixed node is surviving node.
The time synchronization of all nodes in informational table of nodes.
When each Node registry accesses the timed task system in node table, generates nodal information and deposit nodal information
It is stored in the node table positioned at database, nodal information includes node ID and timestamp.
All of above operation is idempotent operation, and database does not need any lock table handling.
The embodiment is only to absolutely prove preferred embodiment that is of the invention and being lifted, and protection scope of the present invention is not
It is limited to this.Those skilled in the art's made equivalent substitute or transformation on the basis of the present invention, in guarantor of the invention
Within the scope of shield.Protection scope of the present invention is subject to claims.
Claims (10)
1. the timing task management system based on message queue, characterized by comprising:
Actuator, the actuator is the process being created in corresponding program, for registering, modifying, delete and executing timing
Task；
Message queue, the message queue is multiple altogether, and each message queue corresponds to a kind of actuator, for passing timed task
It send to corresponding actuator；
Node, the node is a component, for distributing timed task to message queue；
Database, the interior creation of the database have task list and node table, and task list is for storing timing task information, node table
For memory node information.
2. the timing task management system according to claim 1 based on message queue, it is characterised in that further include front end
It shows interface, for obtaining timing task information and nodal information from database, and shows and monitor timing task information and section
Point information, and for being inserted into timed task to database.
3. the timing task management system according to claim 1 or 2 based on message queue, it is characterised in that timed task
Information includes but is not limited to title, executes period, actuator group mark, task definition；
The timing task information persistent storage is in the mission bit stream table of database.
4. the timing task management system according to claim 1 or 2 based on message queue, it is characterised in that nodal information
It is stabbed including node ID and node time, the node time stabs the time for identifying node visit database.
5. the timed task distribution method based on message queue, it is characterised in that be applied to as described in claim any one of 1-4
The timed task system based on message queue, the distribution method includes:
By node timer access node table, judge that each node is death nodes or surviving node in node table, label is every
A death nodes, and count the quantity of all surviving nodes；
Timed task corresponding with death nodes is marked and is erased, the timed task corresponding with death nodes becomes nothing
Main timed task；
The quantity of quantity and surviving node based on timed task is redistributed timed task for surviving node, is redistributed
When timed task, each surviving node is corresponding should to distribute timed task quantity are as follows:
Timed task quantity=all timed tasks quantity/all surviving nodes quantity should be distributed.
6. the timed task distribution method according to claim 5 based on message queue, it is characterised in that accessed node table
Node be accessed node, the quantity of quantity and surviving node based on timed task, for surviving node redistribute timing
Task, comprising:
If the corresponding timed task quantity that should distribute of accessed node is less than its timed task quantity possessed, by the nothing
Main timed task is distributed to the accessed node, until the timed task quantity that the accessed node possesses should distribute calmly equal to it
When task quantity；
If the corresponding timed task quantity that should distribute of accessed node calculates and has each possessed greater than timed task quantity has been possessed
The interval time of the execution time and current time of timed task, interval time have possessed timed task conduct greater than threshold value
Timed task to be erased according to interval time sequence from large to small, is successively treated timed task of erasing and is marked and erase simultaneously
Become dereliction timed task, until the timed task quantity that the accessed node is currently owned by is equal to the number that should distribute timed task
Amount, alternatively, until the timed task that needs to be erased becomes dereliction timed task.
7. the timed task distribution method according to claim 5 or 6 based on message queue, it is characterised in that pass through node
When accessed node table, the corresponding node time stamp of the accessed node is updated.
8. the timed task distribution method according to claim 5 or 6 based on message queue, it is characterised in that by as follows
Method judges that each node is death nodes or surviving node in node table:
The corresponding node time stamp of each node in query node table, if when interval between node time stamp and current time
Between be greater than threshold value, determine the node for death nodes, if if node time stamp current time between interval time
Less than or equal to threshold value, determine the node for surviving node.
9. the timed task distribution method according to claim 5 or 6 based on message queue, it is characterised in that the node
The time synchronization of all nodes in information table.
10. the timed task distribution method according to claim 5 or 6 based on message queue, it is characterised in that node table
In each Node registry when accessing the timed task system, generate nodal information and simultaneously nodal information be stored in positioned at database
Node table, nodal information includes node ID and 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 true CN110532114A (en) | 2019-12-03 |
| CN110532114B 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) |
Cited By (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 (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150058858A1 (en) * | 2013-08-21 | 2015-02-26 | Hasso-Platt ner-Institut fur Softwaresystemtechnik GmbH | Dynamic task prioritization for in-memory databases |
| CN106126332A (en) * | 2016-06-27 | 2016-11-16 | 北京京东尚科信息技术有限公司 | Distributed timing task scheduling system and method |
| US20170061364A1 (en) * | 2015-08-28 | 2017-03-02 | Exacttarget, Inc. | Database systems and related queue management methods |
| CN107329820A (en) * | 2016-04-28 | 2017-11-07 | 杭州海康威视数字技术股份有限公司 | A kind of task processing method and device for group system |
| CN107391188A (en) * | 2017-07-17 | 2017-11-24 | 聚好看科技股份有限公司 | A kind of method and apparatus for controlling timed task |
| 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 |
| CN108762931A (en) * | 2018-05-31 | 2018-11-06 | 康键信息技术（深圳）有限公司 | Method for scheduling task, server based on distributed scheduling system and storage medium |
| CN108762952A (en) * | 2018-05-24 | 2018-11-06 | 吉旗（成都）科技有限公司 | A kind of distribution asynchronous data push scheme |
| CN109634728A (en) * | 2018-11-16 | 2019-04-16 | 深圳市云智融科技有限公司 | Job scheduling method, device, terminal device and readable storage medium storing program for executing |
| CN109861887A (en) * | 2019-02-27 | 2019-06-07 | 山东浪潮云信息技术有限公司 | A kind of OpenTsdb service indication polymerization based on Zookeeper |
| CN110247810A (en) * | 2019-07-09 | 2019-09-17 | 浪潮云信息技术有限公司 | A kind of system and method for collection vessel service monitoring data |
-
2019
- 2019-09-04 CN CN201910830502.XA patent/CN110532114B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150058858A1 (en) * | 2013-08-21 | 2015-02-26 | Hasso-Platt ner-Institut fur Softwaresystemtechnik GmbH | Dynamic task prioritization for in-memory databases |
| US20170061364A1 (en) * | 2015-08-28 | 2017-03-02 | Exacttarget, Inc. | Database systems and related queue management methods |
| CN107329820A (en) * | 2016-04-28 | 2017-11-07 | 杭州海康威视数字技术股份有限公司 | A kind of task processing method and device for group system |
| CN106126332A (en) * | 2016-06-27 | 2016-11-16 | 北京京东尚科信息技术有限公司 | Distributed timing task scheduling system and method |
| 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 |
| CN107391188A (en) * | 2017-07-17 | 2017-11-24 | 聚好看科技股份有限公司 | A kind of method and apparatus for controlling timed task |
| CN108762952A (en) * | 2018-05-24 | 2018-11-06 | 吉旗（成都）科技有限公司 | A kind of distribution asynchronous data push scheme |
| CN108762931A (en) * | 2018-05-31 | 2018-11-06 | 康键信息技术（深圳）有限公司 | Method for scheduling task, server based on distributed scheduling system and storage medium |
| CN109634728A (en) * | 2018-11-16 | 2019-04-16 | 深圳市云智融科技有限公司 | Job scheduling method, device, terminal device and readable storage medium storing program for executing |
| CN109861887A (en) * | 2019-02-27 | 2019-06-07 | 山东浪潮云信息技术有限公司 | A kind of OpenTsdb service indication polymerization based on Zookeeper |
| CN110247810A (en) * | 2019-07-09 | 2019-09-17 | 浪潮云信息技术有限公司 | A kind of system and method for collection vessel service monitoring data |
Non-Patent Citations (3)
| Title |
|---|
| LEI LI等: "Resource Allocation and Task Offloading", 《IEEE ACCESS》 * |
| 冯凌颖等: "一种异构主从模式数据同步园区停车系统的设计与实现", 《计算机应用与软件》 * |
| 马思峻等: "Android应用性能数据采集探针研究", 《计算机应用与软件》 * |
Cited By (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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110532114B (en) | 2022-06-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ulusoy | Processing real-time transactions in a replicated database system | |
| US7805482B2 (en) | Method of correlating events in data packet streams | |
| CN103294675B (en) | Data-updating method and device in a kind of distributed memory system | |
| CN103559319B (en) | The cache synchronization method and equipment of distributed cluster file system | |
| WO2001093017A3 (en) | Method, system and program products for controlling system traffic of a clustered computing environment | |
| US20090157762A1 (en) | Dynamic Data Reorganization to Accommodate Growth Across Replicated Databases | |
| CN110532114A (en) | Timing task management system and distribution method based on message queue | |
| CN103782295A (en) | Query explain plan in a distributed data management system | |
| CN105528371B (en) | A kind of method, apparatus and system executing writing task | |
| Chen et al. | Analyzing dynamic voting using petri nets | |
| CN105553732B (en) | A kind of distributed network analogy method and system | |
| Shanker et al. | SWIFT—A new real time commit protocol | |
| CN103905512B (en) | A kind of data processing method and equipment | |
| Gupta et al. | More optimism about real-time distributed commit processing | |
| CN113254460A (en) | Data processing method, system, electronic device and computer program product | |
| US6799172B2 (en) | Method and system for removal of resource manager affinity during restart in a transaction processing system | |
| Son et al. | An adaptive policy for improved timeliness in secure database systems | |
| CN113595737B (en) | Agile control system based on block chain | |
| Armendáriz-Inigo et al. | k-Bound GSI: A flexible database replication protocol | |
| CN106776076A (en) | A kind of method and system for realizing MongoDB transaction managements | |
| KR101411563B1 (en) | Distributed processing system based on resource locality and distributed processing method thereof | |
| Shanker et al. | Dependency sensitive shadow SWIFT | |
| Grov et al. | Scalable and fully consistent transactions in the cloud through hierarchical validation | |
| Lindström | Performance of distributed optimistic concurrency control in real-time databases | |
| Perl | Efficient storage mechanisms for Internet of Things solutions in ESB |
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 |