CN111782415B - Arbitration method, arbitrator, readable storage medium and mimicry defense system - Google Patents
Arbitration method, arbitrator, readable storage medium and mimicry defense system Download PDFInfo
- Publication number
- CN111782415B CN111782415B CN202010500721.4A CN202010500721A CN111782415B CN 111782415 B CN111782415 B CN 111782415B CN 202010500721 A CN202010500721 A CN 202010500721A CN 111782415 B CN111782415 B CN 111782415B
- Authority
- CN
- China
- Prior art keywords
- message queue
- data
- arbitration
- output data
- heterogeneous
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/548—Queue
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides an arbitration method, an arbitrator, a readable storage medium and a mimicry defense system, wherein the arbitration method comprises the following steps: presetting three message queues for receiving output data of corresponding heterogeneous executors, and continuously and sectionally receiving the output data of the three heterogeneous executors and sequentially storing the output data into the tail part when judging; comparing the data received by the second message queue with the head data of the first message queue immediately, performing forward arbitration, and if the comparison is consistent, immediately forwarding a forward arbitration result; if the comparison of the first message queue and the second message queue is consistent, immediately comparing each piece of data received by the third message queue with the head data of the second message queue, and performing backward arbitration; if the comparison of the first message queue and the second message queue is inconsistent, head data of the first message queue, the second message queue and the third message queue are compared, and after normal arbitration, a normal arbitration result is forwarded.
Description
Technical Field
The invention relates to the field of mimicry defense, in particular to an arbitration method, an arbitrator, a readable storage medium and a mimicry defense system.
Background
Classical mimicry constructs are shown in FIG. 1, the right bracket of which consists of a resolver and an output agent, the resolver receives the complete output information of all heterogeneous executives and preprocesses, then resolves, and after resolution, outputs the resolved result through the output agent. The typical arbitration policy of an arbiter is to compare the output information of all heterogeneous executives. When the heterogeneous executable output information capacity is particularly large, the memory is consumed if the arbiter receives all the information again; in particular, when heterogeneous executives export large capacity files, the arbiter consumes at least twice the size of the file capacity to complete the arbitration.
In order to solve the above problems, an ideal technical solution is always sought.
Disclosure of Invention
It is an object of the present invention to address the deficiencies of the prior art and to provide a arbitration method, an arbitrator, a readable storage medium and a mimicry defense system.
To achieve the above object, a first aspect of the present invention provides a arbitration method comprising the steps of: three message queues for receiving output data of corresponding heterogeneous executors are preset, when arbitration is carried out, the first message queue continuously and in fragments receives the output data of the first heterogeneous executor and sequentially stores the output data into the tail part, the second message queue continuously and in fragments receives the output data of the second heterogeneous executor and sequentially stores the output data into the tail part, and the third message queue continuously and in fragments receives the output data of the third heterogeneous executor and sequentially stores the output data into the tail part;
comparing each piece of data received by the second message queue with the head data of the first message queue immediately, performing forward arbitration, if the comparison is consistent, immediately forwarding a forward arbitration result, and deleting the head data of the first message queue; if the comparison is inconsistent, the second message queue continues to receive the output data of the second heterogeneous executable;
if the comparison of the first message queue and the second message queue is consistent, immediately comparing each piece of data received by the third message queue with the head data of the second message queue, performing backward arbitration to verify whether the data of the third execution body is consistent, and deleting the head data of the second message queue and the head data of the third message queue after the backward arbitration is finished;
if the comparison of the first message queue and the second message queue is inconsistent, comparing the head data of the first message queue, the second message queue and the third message queue, forwarding a normal arbitration result after normal arbitration, and deleting the head data of the first message queue, the second message queue and the third message queue.
Based on the above, when making an arbitration, the starting timing duration is T n A timer T of seconds; resetting the timer T if the third message queue has data when the timing arrives; and (5) circularly detecting until the third message queue has no data, and ending the arbitration.
Based on the above, the decision strategy adopted by the forward decision, the backward decision and the normal decision is a majority decision strategy or a consistency decision strategy.
The second aspect of the present invention provides a resolver comprising a message queue unit, a forward resolver unit, a backward resolver unit, and a normal resolver unit;
the message queue unit comprises three message queues for receiving output data of corresponding heterogeneous executors, wherein the first message queue is used for continuously and sectionally receiving the output data of the first heterogeneous executor and sequentially storing the output data into the tail of the queue, the second message queue is used for continuously and sectionally receiving the output data of the second heterogeneous executor and sequentially storing the output data into the tail of the queue, and the third message queue is used for continuously and sectionally receiving the output data of the third heterogeneous executor and sequentially storing the output data into the tail of the queue;
the forward arbitration unit is used for immediately comparing each piece of data received by the second message queue with the head data of the first message queue to realize forward arbitration, and if the comparison is consistent, generating a forward arbitration result and immediately forwarding the forward arbitration result, and enabling the first message queue to delete the head data; if the comparison is inconsistent, enabling the second message queue to continuously receive the output data of the second heterogeneous executable;
the backward judging unit is used for immediately comparing each piece of data received by the third message queue with the head data of the second message queue when the first message queue and the second message queue are compared and consistent, so as to verify whether the data of the third executive body are consistent or not, and deleting the head data of the second message queue and the third message queue after the comparison is finished;
and the normal arbitration unit is used for comparing the head data of the first message queue, the second message queue and the third message queue when the comparison of the first message queue and the second message queue is inconsistent, forwarding a normal arbitration result after normal arbitration, and deleting the head data of the first message queue, the second message queue and the third message queue.
A third aspect of the invention provides a computer readable storage medium having stored thereon computer instructions which when executed by a processor implement the steps of the arbitration method.
In a fourth aspect, the present invention provides a mimicry defense system, including an input agent, an output agent, three heterogeneous executors, a negative feedback controller, and a resolver, wherein the resolver is used by the resolver.
Compared with the prior art, the invention has outstanding substantive characteristics and remarkable progress, in particular:
1) The invention adopts a message queue slice receiving mode to ensure the output data receiving synchronization of three heterogeneous executors;
2) According to the invention, through a slicing and judging strategy, the memory consumption is reduced, the comparison of all output data of the cache heterogeneous executor is avoided, and the high-capacity output information judgment of the heterogeneous executor is completed on the premise of consuming smaller memory;
3) The invention utilizes the forward arbitration strategy, namely that the output information of two executors is consistent and output, thereby accelerating the arbitration speed, improving the response time of the mimicry construction equipment to external service and enhancing the availability and practicability of the mimicry construction equipment; and the backward arbitration policy is utilized to ensure arbitration integrity, so that the data of the third execution body can be verified.
Drawings
Figure 1 is a diagram of a classical mimicry defense architecture.
FIG. 2 is a diagram of the arbitration process of the present invention.
Detailed Description
Example 1
The embodiment provides a arbitration method, as shown in fig. 2, which includes the following steps:
three message queues for receiving output data of corresponding heterogeneous executors are preset, when arbitration is carried out, the first message queue continuously and in fragments receives the output data of the first heterogeneous executor and sequentially stores the output data into the tail part, the second message queue continuously and in fragments receives the output data of the second heterogeneous executor and sequentially stores the output data into the tail part, and the third message queue continuously and in fragments receives the output data of the third heterogeneous executor and sequentially stores the output data into the tail part;
and receiving output data of three heterogeneous executors, storing the data by using three message queues, storing the data into one piece of fixed byte number each time, storing the data into a first message queue, a second message queue and a third message queue according to the arrival order of the first piece of data, sequentially storing the subsequent data into the tail of the corresponding queue, and allowing the last piece of data to be smaller than the fixed byte number when the last byte is encountered.
The second message queue immediately compares each piece of data received with the head data of the first message queue, performs forward arbitration without waiting for the data of the third message queue, and immediately forwards the forward arbitration result and deletes the head data of the first message queue if the comparison is consistent, so that the tail insertion and the head deletion of the first message queue are simultaneously executed, and the memory consumption of the first message queue is reduced; if the comparison is inconsistent, the second message queue continues to receive the output data of the second heterogeneous execution.
If the comparison of the first message queue and the second message queue is consistent, immediately comparing each piece of data received by the third message queue with the head data of the second message queue, performing backward arbitration to verify whether the data of the third execution body is consistent, deleting the head data of the second message queue and the head data of the third message queue after the backward arbitration is finished, realizing that the tail insertion and the head deletion of the second message queue and the third message queue are simultaneously executed, and reducing the memory consumption of the second message queue and the third message queue.
If the comparison of the first message queue and the second message queue is inconsistent, head data of the first message queue, the second message queue and the third message queue are compared, a normal judging result is forwarded after normal judging is carried out, and head data of the first message queue, the second message queue and the third message queue are deleted, so that tail insertion and head deletion of the first message queue, the second message queue and the third message queue are simultaneously executed, and memory consumption of the first message queue, the second message queue and the third message queue is reduced.
In particular, when making an arbitration, the starting timing duration is T n A timer T of seconds; resetting the timer T if the third message queue has data when the timing arrives; and (5) circularly detecting until the third message queue has no data, and ending the arbitration.
Further, the decision strategy adopted by the forward decision making, the backward decision making and the normal decision making is a majority decision strategy or a consistency decision strategy.
Example 2
The embodiment provides a resolver, which comprises a message queue unit, a forward resolver unit, a backward resolver unit and a normal resolver unit;
the message queue unit comprises three message queues for receiving output data of corresponding heterogeneous executors, wherein the first message queue is used for continuously and sectionally receiving the output data of the first heterogeneous executor and sequentially storing the output data into the tail of the queue, the second message queue is used for continuously and sectionally receiving the output data of the second heterogeneous executor and sequentially storing the output data into the tail of the queue, and the third message queue is used for continuously and sectionally receiving the output data of the third heterogeneous executor and sequentially storing the output data into the tail of the queue;
the message queue unit receives output data of three heterogeneous execution bodies, stores data by using three message queues, stores the data into one piece of fixed byte number each time, stores the data into the first message queue, the second message queue and the third message queue according to the arrival order of the first piece of data, sequentially stores the subsequent data into the tail of the corresponding queue, and allows the last piece of data to be smaller than the fixed byte number when the last byte is encountered.
The forward arbitration unit is used for immediately comparing each piece of data received by the second message queue with the head data of the first message queue, and does not need to wait for the data of the third message queue so as to realize forward arbitration, if the comparison is consistent, generating a forward arbitration result and immediately forwarding the forward arbitration result, and enabling the first message queue to delete the head data so as to realize the simultaneous execution of tail insertion and head deletion of the first message queue, thereby reducing the memory consumption of the first message queue; if the comparison is inconsistent, enabling the second message queue to continuously receive the output data of the second heterogeneous executable;
the backward judging unit is used for immediately comparing each piece of data received by the third message queue with the head data of the second message queue when the first message queue and the second message queue are compared and consistent, so as to verify whether the data of the third executive body are consistent or not, and deleting the head data of the second message queue and the third message queue after the comparison is finished, thereby realizing the simultaneous execution of tail insertion and head deletion of the second message queue and the third message queue and reducing the memory consumption of the second message queue and the third message queue;
the normal arbitration unit is used for comparing head data of the first message queue, the second message queue and the third message queue when the comparison of the first message queue and the second message queue is inconsistent, forwarding a normal arbitration result after normal arbitration, deleting the head data of the first message queue, the second message queue and the third message queue, realizing that tail insertion and head deletion of the first message queue, the second message queue and the third message queue are simultaneously executed, and reducing memory consumption of the first message queue, the second message queue and the third message queue.
In particular, the arbiter further comprises a timer duration T n A timing unit of seconds; starting a timer T when the first message queue starts to receive output data of the first heterogeneous executable; when timing toWhen the time arrives, if the third message queue has data, resetting the timer T; and (5) circularly detecting until the third message queue has no data, and ending the arbitration.
Further, the decision strategies adopted by the forward decision unit, the backward decision unit and the normal decision unit are majority decision strategies or consistency decision strategies.
Example 3
The embodiment provides a mimicry defense system, which comprises an input agent, an output agent, three heterogeneous executors, a negative feedback controller and a resolver, wherein the resolver is adopted by the resolver.
The mimicry defense system of the embodiment is suitable for mimicry defense against application data flow, when the output data flow of the heterogeneous execution body is particularly large, the arbitrator utilizes a slicing arbitration policy to arbitrate and output simultaneously, so that the memory consumption is reduced, the situation that all output data of the cached heterogeneous execution body are compared again is avoided, and the high-capacity output information arbitration of the heterogeneous execution body is completed on the premise of consuming smaller memory.
Example 4
The present embodiment provides a computer readable storage medium having stored thereon computer instructions which when executed by a processor perform the steps of the arbitration method.
Those of ordinary skill in the art will appreciate that the various illustrative elements and method steps described in connection with the embodiments disclosed herein can be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The functional units in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated modules described above, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the present application may implement all or part of the flow of the method of the above embodiment, or may be implemented by instructing related hardware by a computer program, where the computer program may be stored in a computer readable storage medium, and the computer program may implement the steps of each method embodiment described above when executed by a processor. The computer program comprises computer program code, and the computer program code can be in a source code form, an object code form, an executable file or some intermediate form and the like.
The foregoing is merely illustrative of the present invention, and the present invention is not limited thereto, and any person skilled in the art will readily recognize that variations or substitutions are within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (8)
1. A method of arbitration, the method comprising the steps of:
three message queues for receiving output data of corresponding heterogeneous executors are preset, when arbitration is carried out, the first message queue continuously and in fragments receives the output data of the first heterogeneous executor and sequentially stores the output data into the tail part, the second message queue continuously and in fragments receives the output data of the second heterogeneous executor and sequentially stores the output data into the tail part, and the third message queue continuously and in fragments receives the output data of the third heterogeneous executor and sequentially stores the output data into the tail part;
comparing each piece of data received by the second message queue with the head data of the first message queue immediately, performing forward arbitration, if the comparison is consistent, immediately forwarding a forward arbitration result, and deleting the head data of the first message queue; if the comparison is inconsistent, the second message queue continues to receive the output data of the second heterogeneous executable;
if the data received by the second message queue is consistent with the head data of the first message queue, immediately comparing each piece of data received by the third message queue with the head data of the second message queue, performing backward arbitration to verify whether the data of the third execution body is consistent, and deleting the head data of the second message queue and the head data of the third message queue after the backward arbitration is finished;
if the data received by the second message queue is inconsistent with the head data of the first message queue, the second message queue and the third message queue are compared, the normal arbitration result is forwarded after normal arbitration is carried out, and the head data of the first message queue, the second message queue and the third message queue are deleted.
2. The arbitration method of claim 1, wherein: when making a decision, the starting timing duration is T n A timer T of seconds; resetting the timer T if the third message queue has data when the timing arrives; and (5) circularly detecting until the third message queue has no data, and ending the arbitration.
3. The arbitration method of claim 1, wherein: the decision strategy adopted by the forward decision making, the backward decision making and the normal decision making is a majority decision strategy or a consistency decision strategy.
4. A resolver, comprising a message queue unit, a forward resolver unit, a backward resolver unit and a normal resolver unit;
the message queue unit comprises three message queues for receiving output data of corresponding heterogeneous executors, wherein the first message queue is used for continuously and sectionally receiving the output data of the first heterogeneous executor and sequentially storing the output data into the tail of the queue, the second message queue is used for continuously and sectionally receiving the output data of the second heterogeneous executor and sequentially storing the output data into the tail of the queue, and the third message queue is used for continuously and sectionally receiving the output data of the third heterogeneous executor and sequentially storing the output data into the tail of the queue;
the forward arbitration unit is used for immediately comparing each piece of data received by the second message queue with the head data of the first message queue to realize forward arbitration, and if the comparison is consistent, generating a forward arbitration result and immediately forwarding the forward arbitration result, and enabling the first message queue to delete the head data; if the comparison is inconsistent, enabling the second message queue to continuously receive the output data of the second heterogeneous executable;
the backward judging unit is used for immediately comparing each piece of data received by the third message queue with the head data of the second message queue when the data received by the second message queue is consistent with the head data of the first message queue in comparison, so as to verify whether the data of the third execution body is consistent or not, and enabling the second message queue and the third message queue to delete the head data after the comparison is finished;
and the normal arbitration unit is used for comparing the head data of the first message queue, the second message queue and the third message queue when the head data of the second message queue is inconsistent with the head data of the first message queue, forwarding a normal arbitration result after normal arbitration, and deleting the head data of the first message queue, the second message queue and the third message queue.
5. The resolver according to claim 4, wherein: the resolver also includes a timing duration T n A timing unit of seconds; starting a timer T when the first message queue starts to receive output data of the first heterogeneous executable; resetting the timer T if the third message queue has data when the timing arrives; and (5) circularly detecting until the third message queue has no data, and ending the arbitration.
6. The resolver according to claim 4, wherein: the decision strategies adopted by the forward decision unit, the backward decision unit and the normal decision unit are majority decision strategies or consistency decision strategies.
7. A computer-readable storage medium having stored thereon computer instructions, characterized by: the computer instructions, when executed by a processor, implement the steps of the arbitration method of any of claims 1-3.
8. A mimicry defense system comprises an input agent, an output agent, three heterogeneous executors, a negative feedback controller and an arbitrator, and is characterized in that: the resolver employs the resolver of any one of claims 4-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010500721.4A CN111782415B (en) | 2020-06-04 | 2020-06-04 | Arbitration method, arbitrator, readable storage medium and mimicry defense system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010500721.4A CN111782415B (en) | 2020-06-04 | 2020-06-04 | Arbitration method, arbitrator, readable storage medium and mimicry defense system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111782415A CN111782415A (en) | 2020-10-16 |
| CN111782415B true CN111782415B (en) | 2023-08-04 |
Family
ID=72753945
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010500721.4A Active CN111782415B (en) | 2020-06-04 | 2020-06-04 | Arbitration method, arbitrator, readable storage medium and mimicry defense system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111782415B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114531269B (en) * | 2021-12-31 | 2023-11-14 | 网络通信与安全紫金山实验室 | Tbox judging method and device |
| CN114676414A (en) * | 2022-03-21 | 2022-06-28 | 河南信大网御科技有限公司 | Mimicry arbitration system based on policy authentication |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109413024A (en) * | 2018-08-27 | 2019-03-01 | 华东计算技术研究所（中国电子科技集团公司第三十二研究所） | Reverse data verification method and system for multi-mode judgment result of heterogeneous functional equivalent |
| CN109450900A (en) * | 2018-11-09 | 2019-03-08 | 天津市滨海新区信息技术创新中心 | Mimicry decision method, apparatus and system |
| CN110535843A (en) * | 2019-08-20 | 2019-12-03 | 之江实验室 | A kind of device and method that mimicry ruling parameter message is synchronous |
| CN110581852A (en) * | 2019-09-11 | 2019-12-17 | 河南信大网御科技有限公司 | Efficient mimicry defense system and method |
| CN110781012A (en) * | 2019-10-22 | 2020-02-11 | 河南信大网御科技有限公司 | Mimicry resolver based on unified message queue and resolution method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9465555B2 (en) * | 2013-08-12 | 2016-10-11 | Seagate Technology Llc | Method and apparatus for efficient processing of disparate data storage commands |
-
2020
- 2020-06-04 CN CN202010500721.4A patent/CN111782415B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109413024A (en) * | 2018-08-27 | 2019-03-01 | 华东计算技术研究所（中国电子科技集团公司第三十二研究所） | Reverse data verification method and system for multi-mode judgment result of heterogeneous functional equivalent |
| CN109450900A (en) * | 2018-11-09 | 2019-03-08 | 天津市滨海新区信息技术创新中心 | Mimicry decision method, apparatus and system |
| CN110535843A (en) * | 2019-08-20 | 2019-12-03 | 之江实验室 | A kind of device and method that mimicry ruling parameter message is synchronous |
| CN110581852A (en) * | 2019-09-11 | 2019-12-17 | 河南信大网御科技有限公司 | Efficient mimicry defense system and method |
| CN110781012A (en) * | 2019-10-22 | 2020-02-11 | 河南信大网御科技有限公司 | Mimicry resolver based on unified message queue and resolution method |
Non-Patent Citations (1)
| Title |
|---|
| 拟态网络操作系统调度与裁决机制研究及实现;王禛鹏;《中国优秀硕士学位论文全文数据库 信息科技辑》;20190115;I139-44 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111782415A (en) | 2020-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111782415B (en) | Arbitration method, arbitrator, readable storage medium and mimicry defense system | |
| CN107450971B (en) | Task processing method and device | |
| US11385796B2 (en) | Method, device, and program product for reducing delay in I/O processing due to mirroring of cache data | |
| US9348775B2 (en) | Out-of-order execution of bus transactions | |
| CN111221662B (en) | Task scheduling method, system and device | |
| CN106354566B (en) | A kind of method and server of command process | |
| CN113326020B (en) | Cache device, cache, system, data processing method, device and medium | |
| CN102279855A (en) | Device and method for treating transactions with database | |
| CN112508577A (en) | Block generation and verification method and device, electronic equipment and readable storage medium | |
| CN112612855B (en) | High-availability database log receiving queue, synchronization method and device | |
| US11392426B2 (en) | Multitask parallel processing method and apparatus, computer device and storage medium | |
| US8990466B2 (en) | Arbiter for asynchronous state machines | |
| JP4839489B2 (en) | Descriptor control method, direct memory transfer device, and program | |
| US10423546B2 (en) | Configurable ordering controller for coupling transactions | |
| CN117194413A (en) | Delay message processing method, delay message processing device, computer equipment and storage medium | |
| CN116719883A (en) | Data synchronization method, device, server and storage medium | |
| US11435809B2 (en) | Method and apparatus to improve energy efficiency of parallel tasks | |
| CN115277880A (en) | Network message analysis method and device | |
| CN114911638A (en) | Order information processing method, device, electronic device and storage medium | |
| CN115277881A (en) | Network message parsing method and device | |
| US20120266009A1 (en) | Information processing apparatus or information processing method | |
| CN119182732B (en) | Message forwarding methods, network cards, gateways, media and products | |
| CN118012799B (en) | Request processing method, request processing device, electronic equipment and storage medium | |
| CN109344091A (en) | A buffer array regularization method, device, terminal and readable medium | |
| JP3882791B2 (en) | Node blocker for computer system and transaction control method thereof |
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 |