CN114399309A - Block chain transaction redundancy scheduling method and system - Google Patents
Block chain transaction redundancy scheduling method and system Download PDFInfo
- Publication number
- CN114399309A CN114399309A CN202210292110.4A CN202210292110A CN114399309A CN 114399309 A CN114399309 A CN 114399309A CN 202210292110 A CN202210292110 A CN 202210292110A CN 114399309 A CN114399309 A CN 114399309A
- Authority
- CN
- China
- Prior art keywords
- scheduling
- transaction
- module
- node
- transactions
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/401—Transaction verification
-
- 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
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Accounting & Taxation (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Finance (AREA)
- Computer Security & Cryptography (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a block chain transaction redundancy scheduling method and a system, wherein the method comprises the following steps: receiving a batch of transactions by a redundant node in the organization, calculating a task management scheduling request, and finishing data reading; each redundant node adopts various different transaction scheduling strategies to pre-execute transactions and pack the transactions to form blocks according to the task management scheduling request, and returns execution result time; selecting an optimal scheduling strategy based on the shortest time judgment condition according to the execution result time; and in the consensus verification stage, the consensus verification node verifies the block by adopting the optimal scheduling strategy. The redundancy calculation power of the block chain distributed type calculation and separation architecture is fully utilized, the optimal scheduling strategy selection is realized, and the overall processing performance of the block chain transaction can be accelerated. Based on a distributed storage and computation separation architecture, storage and computation separation can be realized, and account book storage resources and computing resources of each node in a block chain network are completely decoupled. The selection of the scheduling strategy is more efficient, and the transaction scheduling execution efficiency of the optimal scheduling strategy is higher.
Description
Technical Field
The present invention relates to the field of blockchain technologies, and in particular, to a method and a system for scheduling redundancy in blockchain transactions.
Background
Based on a traditional node-computing integrated computing architecture, when transactions in block blocks are processed, a scheduling strategy executed by pre-judging or edge-judging is generally adopted to process the transactions in each block. The transaction scheduling policy selection based on prejudice usually employs a serial or parallel scheduling policy to process transactions within each block according to a batch of marked transactions, and fixedly according to the mark. The transaction scheduling policy executed while being judged is generally that, by configuring a certain transaction scheduling decision rule, in the process of transaction scheduling, transaction scheduling policy selection is performed on transactions in each block according to the decision result of the transaction scheduling decision rule, so as to perform transaction scheduling processing. In the two methods, redundant computing resources cannot be fully utilized to select the scheduling strategy, and the selection of the scheduling strategy and the execution efficiency of transaction scheduling are limited.
Patent application publication No. CN 113743951A discloses a method and a device for processing intelligent contract transactions of a block chain, based on the relevance of the transactions (namely, the transaction coupling degree), by presetting transaction execution mode judgment conditions and adaptively selecting a serial or parallel execution mode by nodes according to the preset judgment result to process the contract transactions, the contract transaction execution mode is adaptively and dynamically switched, and therefore the block packing and checking speed is improved. The scheme realizes the self-adaptive selection of the serial/parallel scheduling strategy of the transaction, and belongs to a scheduling strategy selection mode executed while judging. The selection of the optimal scheduling strategy in stages has a certain time delay, and the scheduling strategy selected based on the scheme has performance bottleneck and limitation in transaction scheduling
Therefore, how to provide a redundant scheduling method and system for blockchain transaction based on the selection of the existing blockchain transaction scheduling to fully and effectively utilize redundant computing resources and select an optimal scheduling strategy becomes a problem that needs to be solved by those skilled in the art.
Disclosure of Invention
In view of the above problems, the present invention provides a redundant scheduling method and system for blockchain transaction that can solve at least some of the above technical problems, and can fully and effectively utilize redundant computing resources, and utilize multiple node computing resources to synchronously and concurrently execute multiple different scheduling strategies to select an optimal scheduling strategy.
The embodiment of the invention provides a block chain transaction redundancy scheduling method, which comprises the following steps:
s1, receiving a batch of transactions by the redundant node in the organization, calculating a task management scheduling request, and finishing data reading;
s2, each redundant node pre-executes transactions by adopting various different transaction scheduling strategies according to the task management scheduling request, packs the transactions to form blocks, and returns execution result time;
s3, selecting an optimal scheduling strategy based on the shortest time judgment condition according to the execution result time;
and S4, in the stage of consensus verification, verifying the block by the consensus verification node by adopting the optimal scheduling strategy.
Further, in step S2, the plurality of different transaction scheduling policies include: transaction parallel scheduling and transaction execution result conflict detection, transaction serial scheduling and transaction execution result conflict detection.
Further, the transaction is scheduled in parallel as any one of the following: the method comprises the steps of executing a plurality of processes in parallel in each node, executing a plurality of nodes in parallel, and combining the plurality of processes and the plurality of nodes in each node to execute.
An embodiment of the present invention further provides a system for scheduling redundancy in blockchain transactions, which is applied to any one of the methods for scheduling redundancy in blockchain transactions, and includes: the system comprises a task management scheduling module, a computing resource module, a storage resource management scheduling module and a storage resource module;
the task management scheduling module receives a task management scheduling request and distributes the task management scheduling request to the computing resource module;
after receiving the task management scheduling request, the computing resource module reads data of the storage resource module in parallel through the storage resource management scheduling module;
and after the computing resource module finishes data reading, executing a computing task, and storing an execution result in the storage resource module in a fragmentation mode through the storage resource management scheduling module.
Further, the computing resource module includes a number of node servers that provide computing services in a stateless manner.
Furthermore, the storage resource module comprises a plurality of node servers and provides block chain ledger data fragmentation storage service.
Further, the computing resource module includes: the device comprises a task execution unit, a conflict detection calculation unit and a consensus calculation unit.
The technical scheme provided by the embodiment of the invention has the beneficial effects that at least:
the embodiment of the invention provides a block chain transaction redundancy scheduling method, which comprises the following steps: receiving a batch of transactions by a redundant node in the organization, calculating a task management scheduling request, and finishing data reading; each redundant node adopts various different transaction scheduling strategies to pre-execute transactions and pack the transactions to form blocks according to the task management scheduling request, and returns execution result time; selecting an optimal scheduling strategy based on the shortest time judgment condition according to the execution result time; and in the consensus verification stage, the consensus verification node verifies the block by adopting the optimal scheduling strategy. The redundant computing power of the block chain distributed type memory and separation architecture is fully utilized, and the optimal scheduling strategy selection is realized, so that the high-performance block chain transaction scheduling and processing are realized, and the overall processing performance of the block chain transaction can be accelerated. The selection of the scheduling strategy is more efficient, and the transaction scheduling execution efficiency of the optimal scheduling strategy is higher. The block chain transaction redundancy scheduling system provided by the embodiment of the invention can realize deposit and calculation separation, and adopts a distributed deposit and calculation separation architecture to completely decouple the account book storage resource and the calculation resource of each node in the block chain network.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
The technical solution of the present invention is further described in detail by the accompanying drawings and embodiments.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention. In the drawings:
fig. 1 is a flowchart of a method for scheduling redundancy of a blockchain transaction according to an embodiment of the present invention;
fig. 2 is a schematic flow chart of a block chain transaction redundancy scheduling method according to an embodiment of the present invention;
FIG. 3 is a block diagram of a block chain transaction redundancy scheduling system according to an embodiment of the present invention;
fig. 4 is a schematic diagram illustrating an architecture of a blockchain transaction redundancy scheduling system according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The embodiment of the invention provides a block chain transaction redundancy scheduling method, which is shown in figure 1 and comprises the following steps:
s1, receiving a batch of transactions by the redundant node in the organization, calculating a task management scheduling request, and finishing data reading;
s2, each redundant node pre-executes transactions by adopting various different transaction scheduling strategies according to the task management scheduling request, packs the transactions to form blocks, and returns execution result time;
s3, selecting an optimal scheduling strategy based on the shortest time judgment condition according to the execution result time;
and S4, in the stage of consensus verification, verifying the block by the consensus verification node by adopting the optimal scheduling strategy.
The block chain transaction redundancy scheduling method provided in this embodiment is based on a storage and computation separation distributed architecture, and when block transactions are processed, a plurality of different scheduling strategies are simultaneously applied to each block by using intra-node redundancy computation resources to perform transaction pre-execution, so that an optimal scheduling strategy is selected, and block verification is completed by using the optimal scheduling strategy. Compared with a pre-judgment scheduling strategy, the redundant scheduling scheme is more accurate in selection and more efficient in transaction scheduling executed while judging. The redundant computing power (a plurality of processes or a plurality of nodes in the nodes) of the block chain distributed type memory and separation architecture is fully utilized, and the optimal scheduling strategy selection is realized, so that the high-performance block chain transaction scheduling and processing are realized, and the overall processing performance of the block chain transaction can be accelerated.
The practical application scenario of the blockchain transaction processing in this embodiment may be a trade record in an Taobao transaction, a financial cross-bank cross-border transaction, or a bank internal transaction system. The transaction in this embodiment refers to transaction, i.e., a contract call of the blockchain, which is generated by the client of the blockchain.
First, each concept definition will be explained:
trading: one call to the blockchain intelligent contract contains all the information of calling the intelligent contract: intelligent contract names, calling function names, parameters, etc.
Transaction scheduling: and allocating computing resources for a batch of transactions to execute according to the scheduling strategy. The scheduling strategy of transaction scheduling determines the execution sequence of a batch of transactions and the processing mechanism of transaction parallel conflict.
Next, the method for scheduling redundancy of block chain transaction provided in this embodiment is specifically described:
referring to fig. 2, in this embodiment, when block transactions are processed, a plurality of different scheduling policies are concurrently and concurrently used for each block transaction (for example, transaction parallel/serial scheduling and conflict detection of transaction execution results, the concurrent execution may be performed by a plurality of processes in a node in parallel, or performed by a plurality of nodes in parallel, or performed by a combination of the foregoing two manners), and then an optimal scheduling policy is selected based on a shortest time use determination condition (that is, a scheduling policy that returns an execution result first is marked as an optimal policy), and then, in a consensus verification stage, a block is verified based on the selected optimal scheduling policy without attempting a plurality of scheduling policies (at this time, the scheduling policy that is used is already the optimal scheduling policy). The scheme fully utilizes the redundancy calculation power (a plurality of processes or a plurality of nodes in the nodes) of the block chain distributed type calculation and separation architecture to realize the selection of the optimal scheduling strategy, thereby realizing the high-performance block chain transaction scheduling and processing and accelerating the overall processing performance of the block chain transaction.
Based on the same inventive concept, an embodiment of the present invention further provides a system for scheduling redundancy for blockchain transactions, and since the system is applied to the method for scheduling redundancy for blockchain transactions and is a basic architecture (a storage and distribution architecture) of the method, the implementation of the system can refer to the implementation of the method, and repeated details are not repeated.
A blockchain transaction redundancy scheduling system, as shown in fig. 3 and 4, comprising: the system comprises a task management scheduling module, a computing resource module, a storage resource management scheduling module and a storage resource module;
the task management scheduling module receives a task management scheduling request and distributes the task management scheduling request to the computing resource module;
after receiving the task management scheduling request, the computing resource module reads data of the storage resource module in parallel through the storage resource management scheduling module;
and after the data reading is finished, the computing resource module executes the computing task and stores the execution result into the storage resource module in a fragmentation mode through the storage resource management scheduling module.
The blockchain transaction redundancy scheduling system provided in this embodiment is a novel blockchain storage and computation separation architecture, and completely decouples the ledger storage resources and the computation resources of each node in the blockchain network. The storage resources store data in a fragmentation storage mode; the computing resources provide computing services in a stateless manner, the storage resources and the computing resources jointly form a distributed storage and computation separation architecture, and the storage resources and the computing resources can be independently expanded, namely, the storage and computation are separated.
The following describes the block chain transaction redundancy scheduling system provided in this embodiment:
the task management scheduling module is responsible for receiving the computing task request and distributing task scheduling to the computing resource module. The computing resource module comprises a plurality of node servers and provides computing services in a stateless manner. The storage resource module comprises a plurality of node servers and provides block chain account book data fragmentation storage service. The storage resource management scheduling module is responsible for receiving data writing/reading service requests and scheduling and distributing storage tasks to fragmented storage resources to realize fragmented data storage and reading. The specific task execution flow comprises the following steps:
1) and the task management scheduling module receives the computing task request and distributes task scheduling to computing units of different node servers in the computing resource module to execute corresponding computing tasks. In an actual blockchain application, the computing units of different node servers in the computing resource may concurrently execute corresponding computing tasks, and the computing tasks may be task execution units, conflict detection computing units, consensus computing units, and the like. The task execution unit executes the contract logic to generate a read-write set, and then schedules the generated read-write set for further processing.
2) After receiving the task management scheduling request, the computing resource module first reads data of the storage resource through the storage resource management scheduling module, and the process can be executed in parallel (i.e. data stored in different fragments are read in parallel), and then the computing task is executed after the data reading is completed.
3) And after the computing resource module finishes the computing task, the execution result is stored into the storage resource module in a fragmentation mode through the storage resource management scheduling module.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system disclosed by the embodiment, as the system is applied to the method disclosed by the embodiment, the description is simple, and the relevant part can be referred to the method part for description.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (7)
1. A block chain transaction redundancy scheduling method is characterized by comprising the following steps:
s1, receiving a batch of transactions by the redundant node in the organization, calculating a task management scheduling request, and finishing data reading;
s2, each redundant node pre-executes transactions by adopting various different transaction scheduling strategies according to the task management scheduling request, packs the transactions to form blocks, and returns execution result time;
s3, selecting an optimal scheduling strategy based on the shortest time judgment condition according to the execution result time;
and S4, in the stage of consensus verification, verifying the block by the consensus verification node by adopting the optimal scheduling strategy.
2. The method as claimed in claim 1, wherein in step S2, the transaction scheduling policies include: transaction parallel scheduling and transaction execution result conflict detection, transaction serial scheduling and transaction execution result conflict detection.
3. The method as claimed in claim 2, wherein the transaction is scheduled in parallel as any one of the following: the method comprises the steps of executing a plurality of processes in parallel in each node, executing a plurality of nodes in parallel, and combining the plurality of processes and the plurality of nodes in each node to execute.
4. A system for scheduling redundancy of blockchain transactions, which is applied to the method for scheduling redundancy of blockchain transactions according to any one of claims 1 to 3, comprising: the system comprises a task management scheduling module, a computing resource module, a storage resource management scheduling module and a storage resource module;
the task management scheduling module receives a task management scheduling request and distributes the task management scheduling request to the computing resource module;
after receiving the task management scheduling request, the computing resource module reads data of the storage resource module in parallel through the storage resource management scheduling module;
and after the computing resource module finishes data reading, executing a computing task, and storing an execution result in the storage resource module in a fragmentation mode through the storage resource management scheduling module.
5. The system of claim 4, wherein said computing resource modules comprise node servers that provide computing services in a stateless manner.
6. The system of claim 4, wherein the storage resource module comprises a plurality of node servers providing blockchain ledger data fragmentation storage services.
7. The system of claim 5, wherein the computing resource module comprises: the device comprises a task execution unit, a conflict detection calculation unit and a consensus calculation unit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210292110.4A CN114399309B (en) | 2022-03-24 | 2022-03-24 | Block chain transaction redundancy scheduling method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210292110.4A CN114399309B (en) | 2022-03-24 | 2022-03-24 | Block chain transaction redundancy scheduling method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114399309A true CN114399309A (en) | 2022-04-26 |
| CN114399309B CN114399309B (en) | 2022-07-05 |
Family
ID=81235011
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210292110.4A Active CN114399309B (en) | 2022-03-24 | 2022-03-24 | Block chain transaction redundancy scheduling method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114399309B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116708446A (en) * | 2023-08-03 | 2023-09-05 | 山东省计算中心（国家超级计算济南中心） | Network performance comprehensive weight decision-based computing network scheduling service method and system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180158034A1 (en) * | 2016-12-07 | 2018-06-07 | International Business Machines Corporation | Dynamic reordering of blockchain transactions to optimize performance and scalability |
| CN109508337A (en) * | 2018-11-12 | 2019-03-22 | 杭州秘猿科技有限公司 | A kind of transaction is parallel to execute method, apparatus, electronic equipment and system |
| CN110659827A (en) * | 2019-09-23 | 2020-01-07 | 珠海格力电器股份有限公司 | Energy scheduling method, child node system, scheduling system, and storage medium |
| CN112150163A (en) * | 2020-11-26 | 2020-12-29 | 北京微芯区块链与边缘计算研究院 | Block chain contract transaction parallel execution method and device |
| CN113691632A (en) * | 2021-08-27 | 2021-11-23 | 广东卓启云链科技有限公司 | Dynamic scheduling method and system for block chain computing resources |
| CN113689296A (en) * | 2021-08-30 | 2021-11-23 | 北京泛融科技有限公司 | Contract scheduling method and device for asynchronous trusted computing and electronic equipment |
| CN113743951A (en) * | 2021-11-04 | 2021-12-03 | 北京微芯感知科技有限公司 | Intelligent contract transaction processing method and device for block chain |
-
2022
- 2022-03-24 CN CN202210292110.4A patent/CN114399309B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180158034A1 (en) * | 2016-12-07 | 2018-06-07 | International Business Machines Corporation | Dynamic reordering of blockchain transactions to optimize performance and scalability |
| CN109508337A (en) * | 2018-11-12 | 2019-03-22 | 杭州秘猿科技有限公司 | A kind of transaction is parallel to execute method, apparatus, electronic equipment and system |
| CN110659827A (en) * | 2019-09-23 | 2020-01-07 | 珠海格力电器股份有限公司 | Energy scheduling method, child node system, scheduling system, and storage medium |
| CN112150163A (en) * | 2020-11-26 | 2020-12-29 | 北京微芯区块链与边缘计算研究院 | Block chain contract transaction parallel execution method and device |
| CN113691632A (en) * | 2021-08-27 | 2021-11-23 | 广东卓启云链科技有限公司 | Dynamic scheduling method and system for block chain computing resources |
| CN113689296A (en) * | 2021-08-30 | 2021-11-23 | 北京泛融科技有限公司 | Contract scheduling method and device for asynchronous trusted computing and electronic equipment |
| CN113743951A (en) * | 2021-11-04 | 2021-12-03 | 北京微芯感知科技有限公司 | Intelligent contract transaction processing method and device for block chain |
Non-Patent Citations (4)
| Title |
|---|
| 于兴平等: "分布式系统数据时序更新方法", 《软件工程》 * |
| 于兴平等: "分布式系统数据时序更新方法", 《软件工程》, no. 05, 5 May 2016 (2016-05-05) * |
| 李辉忠等: "FISCO BCOS技术应用实践", 《信息通信技术与政策》 * |
| 李辉忠等: "FISCO BCOS技术应用实践", 《信息通信技术与政策》, no. 01, 15 January 2020 (2020-01-15) * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116708446A (en) * | 2023-08-03 | 2023-09-05 | 山东省计算中心（国家超级计算济南中心） | Network performance comprehensive weight decision-based computing network scheduling service method and system |
| CN116708446B (en) * | 2023-08-03 | 2023-11-21 | 山东省计算中心（国家超级计算济南中心） | Network performance comprehensive weight decision-based computing network scheduling service method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114399309B (en) | 2022-07-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108062672B (en) | Flow scheduling method based on block chain intelligent contract | |
| CN102831120B (en) | A kind of data processing method and system | |
| CN103605576B (en) | Multithreading-based MapReduce execution system | |
| RU2465634C2 (en) | Real-time instruction processing system | |
| CN111460504B (en) | Service processing method, device, node equipment and storage medium | |
| CN112598525B (en) | Intelligent contract clustering parallel block chain implementation method and device | |
| CN104065636B (en) | Data processing method and system | |
| US20230275771A1 (en) | Pre-execution of block chain transaction in parallel during block consensus | |
| CN113419823A (en) | Alliance chain system suitable for high-concurrency affairs and design method thereof | |
| CN114399309B (en) | Block chain transaction redundancy scheduling method and system | |
| US7111289B2 (en) | Method for implementing dual link list structure to enable fast link-list pointer updates | |
| US20200052885A1 (en) | File storage method and apparatus for blockchain network | |
| CN110704438B (en) | Method and device for generating bloom filter in blockchain | |
| CN109408595A (en) | Block chain bookkeeping methods, equipment and computer readable storage medium | |
| US7533080B2 (en) | Commit tree optimization based on recovery topology information | |
| CN115733677A (en) | Scheduling method and device for cipher machine | |
| CN113411373A (en) | Transaction data storage method, tracking and tracing method and block chain network | |
| CN110515564B (en) | Method and device for determining input/output (I/O) path | |
| CN107172222A (en) | A kind of date storage method and device based on distributed memory system | |
| CN114844907B (en) | Bank transaction high-speed low-connection number implementation method based on MQ asynchronous transceiving | |
| CN114416765B (en) | Block chain transaction stepless prediction execution method and system | |
| CN116112507A (en) | Hierarchical blockchain-based multitasking asynchronous execution method and device | |
| CN110378680A (en) | A kind of data processing method, device, storage medium and server | |
| US20040107308A1 (en) | Memory that allows simultaneous read requests | |
| CN111339089B (en) | Data storage and acquisition method and device applied to blockchain |
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 |