CN111415259A - Transaction queuing method, device and storage medium - Google Patents
Transaction queuing method, device and storage medium Download PDFInfo
- Publication number
- CN111415259A CN111415259A CN202010225738.3A CN202010225738A CN111415259A CN 111415259 A CN111415259 A CN 111415259A CN 202010225738 A CN202010225738 A CN 202010225738A CN 111415259 A CN111415259 A CN 111415259A
- Authority
- CN
- China
- Prior art keywords
- transaction
- queue
- static
- dynamic
- 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
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000003068 static effect Effects 0.000 claims abstract description 63
- 238000004590 computer program Methods 0.000 claims description 8
- 230000001174 ascending effect Effects 0.000 claims 1
- 238000004806 packaging method and process Methods 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012163 sequencing technique Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- 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/3827—Use of message hashing
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
- G07C2011/04—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere related to queuing systems
Abstract
The invention provides a transaction queuing method, a device and a storage medium, which relate to the technical field of block chains and the like, and the method comprises the following steps: receiving a first transaction; determining whether a first commission for the first transaction is greater than a preconfigured threshold: if so, appending the first transaction to the static queue when the static queue can store the first transaction; if not, storing the first transaction into a dynamic queue according to a pre-configured queuing rule; a number of transactions are pulled from the static queue and the dynamic queue according to pre-configured transaction pull rules to generate a block. The method and the device support dynamic queuing of the transactions, expand static queuing space, increase certainty of transaction packaging, and improve user experience.
Description
Technical Field
The application relates to the technical field of block chains and the like, in particular to a transaction queuing method, equipment and a storage medium.
Background
In the existing block chain technology, the sorting modes of transactions in a transaction pool are mainly divided into two types: time sequence ordering and transaction rate high-low ordering.
The time sequencing depends on the broadcast delay in the network, and when the network is crowded, the transaction priority cannot be manually controlled by an effective means, namely the sequencing is fixed and static and cannot be dynamically adjusted.
The transaction rate high-low sequencing can make the transaction priority higher, but because the transaction number packaged by a single block is limited, the transaction cannot be guaranteed to be packaged into the block in time, namely, before the block is packaged, other transactions with higher transaction fees are added, the transaction is packaged in a delayed mode, and even the transactions can be extruded out of a transaction pool.
Disclosure of Invention
In view of the above-mentioned deficiencies or inadequacies in the prior art, it would be desirable to provide a transaction queuing method, apparatus, and storage medium that supports dynamic queuing of transactions and increases transaction packing certainty.
In a first aspect, the present invention provides a transaction queuing method suitable for a blockchain node, where a static queue and a dynamic queue are configured in a transaction pool, the method includes:
receiving a first transaction;
determining whether a first commission for the first transaction is greater than a preconfigured threshold:
if yes, judging whether the static queue can store the first transaction:
if so, appending the first transaction to the static queue;
if not, storing the first transaction into a dynamic queue according to a pre-configured queuing rule;
a number of transactions are pulled from the static queue and the dynamic queue according to pre-configured transaction pull rules to generate a block.
In a second aspect, the invention also provides an apparatus comprising one or more processors and memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a transaction queuing method provided according to embodiments of the invention.
In a third aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute a transaction queuing method provided according to embodiments of the present invention.
The transaction queuing method, the transaction queuing device and the storage medium provided by the embodiments of the invention receive a first transaction; determining whether a first commission for the first transaction is greater than a preconfigured threshold: if so, appending the first transaction to the static queue when the static queue can store the first transaction; if not, storing the first transaction into a dynamic queue according to a pre-configured queuing rule; the method for pulling a plurality of transactions from the static queue and the dynamic queue to generate the block according to the pre-configured transaction pulling rule supports dynamic queuing of the transactions, expands the static queuing space, increases the certainty of transaction packaging and improves the user experience.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a transaction queuing method according to an embodiment of the present invention.
Fig. 2 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a flowchart of a transaction queuing method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, a transaction queuing method applied to a blockchain node is provided, where a static queue and a dynamic queue are configured in a transaction pool, and the method includes:
s12: receiving a first transaction;
s141: determining whether a first commission for the first transaction is greater than a preconfigured threshold:
if yes, go to step S142: determining whether the static queue can store the first transaction:
if yes, go to step S1421: appending the first transaction to a static queue;
otherwise, step S143 is executed: storing the first transaction into a dynamic queue according to a pre-configured queuing rule;
s16: a number of transactions are pulled from the static queue and the dynamic queue according to pre-configured transaction pull rules to generate a block.
Specifically, assume S142 includes determining whether a first remaining capacity of the static queue is not less than a first capacity required to store the first transaction; discarding the first transaction when the static queue cannot store the first transaction; the transaction pull rule is to pull the transaction in the static queue preferentially; the queuing rule is that queuing is performed according to the sequence of the commission fees from big to small, and the step S143 includes:
determining whether the dynamic queue can store the first transaction:
if yes, storing the first transaction into a dynamic queue;
if not, judging whether a second transaction with a commission lower than the first commission exists:
if yes, deleting the second transaction from the dynamic queue, and storing the first transaction into the dynamic queue;
if not, discarding the first transaction;
with a pre-configured threshold of 10 AAA; the first remaining capacity is 100k, and the user a generates tx1 with a handling fee of 10.1AAA and a size of 85k and sends the tx1 to the blockchain node as an example;
the blockchain node performs step S12, receiving tx 1;
the blockchain node performs step S141 to determine whether the commission of tx1 is greater than 10 AAA:
since the commission of tx1 is 10.1AAA, which is greater than 10AAA, step S142 is executed: determine whether the static queue can store tx 1:
since the tx1 is 85k in size and the first remaining capacity is 100k, tx1 can be stored, and the tile link point performs step S1421: append tx1 to the static queue;
the blockchain node performs step S16 to preferentially pull transactions from the static queue and the dynamic queue to generate a block.
With a pre-configured threshold of 10 AAA; the first remaining capacity is 100k, and the user B generates tx2 with a handling fee of 10.1AAA and a size of 125k and sends the tx2 to the blockchain node for example;
the blockchain node performs step S12, receiving tx 2;
the blockchain node performs step S141 to determine whether the commission of tx2 is greater than a preconfigured threshold:
since the commission of tx2 is 10.1AAA, which is greater than 10AAA, step S142 is executed: determine whether the static queue can store tx 2:
since tx2 is 125k in size and the first remaining capacity is 100k, tx1 cannot be stored and tx2 is discarded by the chunk link point.
The blockchain node performs step S16 to preferentially pull transactions from the static queue and the dynamic queue to generate a block.
With a pre-configured threshold of 10 AAA; the first remaining capacity is 100k, the user C generates tx3 with the handling fee of 5.1AAA and the size of 85k and sends the tx3 to the blockchain node, and the dynamic queue may store tx3 as an example;
the blockchain node performs step S12, receiving tx 3;
the blockchain node performs step S141 to determine whether the commission of tx3 is greater than 10 AAA:
since the commission of tx3 is 5.1AAA and not more than 10AAA, step S143 is executed: determine whether the dynamic queue can store tx 3:
since the dynamic queue can store tx3, the chunk link node stores tx3 in the dynamic queue;
the blockchain node performs step S16 to preferentially pull transactions from the static queue and the dynamic queue to generate a block.
With a pre-configured threshold of 10 AAA; the first remaining capacity is 100k, the user D generates tx4 with the handling fee of 5.1AAA and the size of 125k and sends the tx4 to the blockchain node, the dynamic queue can not store tx4, and tx5 with the size of more than 125k and the handling fee of less than 5.1AAA exists in the dynamic queue as an example;
the blockchain node performs step S12, receiving tx 4;
the blockchain node performs step S141 to determine whether the commission of tx4 is greater than 10 AAA:
since the commission of tx4 is 5.1AAA and not more than 10AAA, step S143 is executed: determine whether the dynamic queue can store tx 4:
because the dynamic queue cannot store tx4, and there is tx5 in the dynamic queue that is over 125k in size and with a commission cost below 5.1AAA, tx5 is removed from the dynamic queue and tx4 is stored in the dynamic queue;
the blockchain node performs step S16 to preferentially pull transactions from the static queue and the dynamic queue to generate a block.
With a pre-configured threshold of 10 AAA; the first remaining capacity is 100k, the user E generates tx6 with the commission charge of 5.1AAA and the size of 125k and sends the tx6 to the blockchain node, the dynamic queue can not store tx6, and no transaction with the commission charge lower than 5.1AAA exists in the dynamic queue as an example;
the blockchain node performs step S12, receiving tx 6;
the blockchain node performs step S141 to determine whether the commission of tx6 is greater than 10 AAA:
since the commission of tx6 is 5.1AAA and not more than 10AAA, step S143 is executed: determine whether the dynamic queue can store tx 6:
as the dynamic queue may not store tx6 and there are no transactions in the dynamic queue with a commission cost below 5.1AAA, tx6 is discarded;
the blockchain node performs step S16 to preferentially pull transactions from the static queue and the dynamic queue to generate a block.
It should be noted that transactions with a commission greater than the threshold value will be added to the static queue, with adding meaning that once the transactions enter the static queue, they are queued in the order of the time they were received.
The above embodiment describes the transaction queuing method provided by the present invention in detail, and in further embodiments, the threshold is not limited to the above example, and may be configured to other values according to actual requirements, so long as it is much larger than the common commission, and the same technical effect may be achieved.
In further embodiments, whether the static queue can store the first transaction may also be configured in other ways according to actual needs, for example, configured as: and judging whether the storable transaction quantity of the static queue is more than one, so that the same technical effect can be realized.
In further embodiments, the queuing rule may be configured according to actual requirements, for example, configured to queue according to a sequence of the first data from small to large, where the first data is a ratio of the first renewal fee to the transaction size of the first transaction, and the same technical effect may be achieved.
In further embodiments, the transaction pull rule may be configured according to actual requirements, for example, configured to pull X transactions from the static queue when the number of transactions in the static queue is greater than X, and pull a number of transactions from the dynamic queue to generate the block, so as to achieve the same technical effect.
The embodiment reduces the uncertainty of transaction packaging on the basis of supporting dynamic adjustment of the handling fee.
Preferably, when the static queue cannot store the first transaction, the first transaction is stored in the dynamic queue according to the queuing rule.
Preferably, the first transaction is discarded when the static queue cannot store the first transaction.
Preferably, when the static queue cannot store the first transaction, appending the first transaction to a deterministic queue outside the transaction pool, pulling a number of transactions from the static queue and the dynamic queue according to a preconfigured transaction pull rule to generate the block comprises:
pulling a plurality of transactions from the static queue and the dynamic queue according to a pre-configured transaction pulling rule to generate a block;
several transactions in the deterministic queue are moved into the static queue.
Specifically, assuming a first remaining capacity of 100k, a deterministic queue empty, a block chain node receives tx10 with a handling fee of 10.1AAA and a size of 150 k;
the blockchain node performs step S12, receiving tx 10;
the blockchain node performs step S141 to determine whether the commission of tx10 is greater than 10 AAA:
as the commission of tx10 is 10.1AAA, greater than 10AAA, tx10 is appended to the deterministic queue;
the block chain node executes step S16, preferentially pulling transactions from the static queue and the dynamic queue to generate a block;
move tx10 into the static queue;
if the block chain node receives the transaction with the commission charge larger than the threshold value, the transaction is added to tx10 of the static queue;
the first transaction is added to the deterministic queue outside the transaction pool, where adding means that the transactions are queued in the order of the time of receipt of the transaction once they enter the deterministic queue.
Preferably, the determining whether the static queue can store the first transaction includes:
it is determined whether the first remaining capacity of the static queue is not less than a first capacity required to store the first transaction.
Preferably, determining whether the static queue can store the first transaction comprises:
it is determined whether the storable number of transactions for the static queue is greater than one.
Preferably, the queuing rule is to queue according to the sequence of the handling fees from big to small, and the storing the first transaction into the dynamic queue according to the pre-configured queuing rule comprises:
determining whether the dynamic queue can store the first transaction:
if yes, storing the first transaction into a dynamic queue;
if not, judging whether a second transaction with a commission lower than the first commission exists:
if yes, deleting the second transaction from the dynamic queue, and storing the first transaction into the dynamic queue;
otherwise, the first transaction is discarded.
Preferably, the transaction pull rule is to preferentially pull transactions in the static queue.
Fig. 2 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 2, as another aspect, the present application also provides an apparatus 200 including one or more Central Processing Units (CPUs) 201 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)202 or a program loaded from a storage section 208 into a Random Access Memory (RAM) 203. In the RAM203, various programs and data necessary for the operation of the apparatus 200 are also stored. The CPU201, ROM202, and RAM203 are connected to each other via a bus 204. An input/output (I/O) interface 205 is also connected to bus 204.
To the I/O interface 205, AN input section 206 including a keyboard, a mouse, and the like, AN output section 207 including a keyboard such as a Cathode Ray Tube (CRT), a liquid crystal display (L CD), and the like, a speaker, and the like, a storage section 208 including a hard disk and the like, and a communication section 209 including a network interface card such as a L AN card, a modem, and the like, the communication section 209 performs communication processing via a network such as the internet, a drive 210 is also connected to the I/O interface 205 as necessary, a removable medium 211 such as a magnetic disk, AN optical disk, a magneto-optical disk, a semiconductor memory, and the like is mounted on the drive 210 as necessary, so that a computer program read out therefrom is mounted into the storage section 208 as necessary.
In particular, according to an embodiment of the present disclosure, the transaction queuing method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing a transaction queuing method. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 209 and/or installed from the removable medium 211.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the transaction queuing methods described herein.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (10)
1. A transaction queuing method is characterized in that a static queue and a dynamic queue are configured in a transaction pool, the method is suitable for a blockchain node, and the method comprises the following steps:
receiving a first transaction;
determining whether a first commission for the first transaction is greater than a preconfigured threshold:
if yes, judging whether the static queue can store the first transaction:
if so, appending the first transaction to the static queue;
if not, storing the first transaction into the dynamic queue according to a pre-configured queuing rule;
pulling transactions from the static queue and the dynamic queue according to a pre-configured transaction pull rule to generate a block.
2. The method of claim 1, wherein the first transaction is stored in the dynamic queue according to the queuing rule when the static queue cannot store the first transaction.
3. The method of claim 1, wherein the first transaction is discarded when the static queue cannot store the first transaction.
4. The method of claim 1, wherein appending the first transaction to a deterministic queue outside of a transaction pool when the static queue cannot store the first transaction, wherein pulling transactions from the static queue and the dynamic queue to generate a block according to a preconfigured transaction pull rule comprises:
pulling a number of transactions from the static queue and the dynamic queue according to a pre-configured transaction pull rule to generate a block;
moving a number of transactions in the deterministic queue into the static queue.
5. The method of claim 1, wherein determining whether the static queue can store the first transaction comprises:
and judging whether the first residual capacity of the static queue is not less than the first capacity required for storing the first transaction.
6. The method of claim 1, wherein determining whether the static queue can store the first transaction comprises:
determining whether the storable number of transactions of the static queue is greater than one.
7. The method of claim 1, wherein the queuing rules are in order of ascending commission fees, and wherein storing the first transaction in the dynamic queue according to the preconfigured queuing rules comprises:
determining whether the dynamic queue can store the first transaction:
if yes, storing the first transaction into the dynamic queue;
if not, judging whether a second transaction with a commission lower than the first commission exists:
if yes, deleting the second transaction from the dynamic queue, and storing the first transaction into the dynamic queue;
otherwise, discarding the first transaction.
8. The method of any of claims 1-7, wherein the transaction pull rule is to pull transactions in the static queue preferentially.
9. An apparatus, characterized in that the apparatus comprises:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-8.
10. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010225738.3A CN111415259B (en) | 2020-03-26 | 2020-03-26 | Transaction queuing method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010225738.3A CN111415259B (en) | 2020-03-26 | 2020-03-26 | Transaction queuing method, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111415259A true CN111415259A (en) | 2020-07-14 |
| CN111415259B CN111415259B (en) | 2024-02-06 |
Family
ID=71494570
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010225738.3A Active CN111415259B (en) | 2020-03-26 | 2020-03-26 | Transaction queuing method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111415259B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115271746A (en) * | 2022-09-27 | 2022-11-01 | 江苏荣泽信息科技股份有限公司 | Block chain transaction sorting algorithm with priority |
| CN115604354A (en) * | 2022-12-09 | 2023-01-13 | 北京百度网讯科技有限公司（Cn） | Transaction processing method, device and equipment based on block chain and storage medium |
Citations (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2249554A1 (en) * | 1997-10-10 | 1999-04-10 | General Instrument Corporation | Secure processor with external memory using block chaining and block re-ordering |
| US20020108004A1 (en) * | 2001-02-08 | 2002-08-08 | Shah Paras A. | Enhancement of transaction order queue |
| US20070283131A1 (en) * | 2006-01-30 | 2007-12-06 | Ati Technologies Inc. | Processing of high priority data elements in systems comprising a host processor and a co-processor |
| CN106886890A (en) * | 2017-02-07 | 2017-06-23 | 杭州秘猿科技有限公司 | A kind of timing transaction execution method based on block chain |
| CN107592966A (en) * | 2015-05-13 | 2018-01-16 | 思科技术公司 | To the dynamic protection of shared memory used in the output queue in the network equipment |
| CN107742352A (en) * | 2017-09-20 | 2018-02-27 | 黄玉宇 | Decentralization lot/queuing strategy and system based on block chain and intelligent contract |
| CN107809480A (en) * | 2017-10-25 | 2018-03-16 | 上海瀚银信息技术有限公司 | One kind transaction commutation system |
| CN107819696A (en) * | 2017-11-22 | 2018-03-20 | 中国银行股份有限公司 | A kind of transaction flow control method and system |
| CN108288156A (en) * | 2018-01-04 | 2018-07-17 | 杭州复杂美科技有限公司 | A kind of storage of block chain transaction and queuing strategy |
| US20180240114A1 (en) * | 2017-02-22 | 2018-08-23 | Alibaba Group Holding Limited | Transaction verification in a consensus network |
| CN108846745A (en) * | 2018-04-19 | 2018-11-20 | 深圳市网心科技有限公司 | Block chain trading processing auxiliary system, block chain data processing system and method |
| CN108876521A (en) * | 2018-06-04 | 2018-11-23 | 贵州数据宝网络科技有限公司 | A kind of high concurrent data transacting system and method |
| CN109450659A (en) * | 2018-12-25 | 2019-03-08 | 杭州复杂美科技有限公司 | Block delayed broadcast method, equipment and storage medium |
| US20190089713A1 (en) * | 2017-09-18 | 2019-03-21 | James J. Leftwich | System and method for producing a dynamically ordered queue |
| CN109669789A (en) * | 2018-12-10 | 2019-04-23 | 杭州复杂美科技有限公司 | Transaction queuing strategy, trading pit storage method, equipment and storage medium |
| CN109995666A (en) * | 2019-04-12 | 2019-07-09 | 深圳市元征科技股份有限公司 | A kind of method for message transmission and relevant apparatus |
| CN110163609A (en) * | 2019-05-28 | 2019-08-23 | 深圳前海微众银行股份有限公司 | Data processing method and device in a kind of block chain |
| CN110445755A (en) * | 2019-07-04 | 2019-11-12 | 杭州复杂美科技有限公司 | Hand over pregnable defence method, equipment and storage medium |
| CN110457342A (en) * | 2019-07-02 | 2019-11-15 | 网联清算有限公司 | Transaction processing method and device |
| US20190392406A1 (en) * | 2018-06-20 | 2019-12-26 | International Business Machines Corporation | Privacy preserving transactions with probabilistic transaction fees |
| CN110659988A (en) * | 2019-09-10 | 2020-01-07 | 杭州秘猿科技有限公司 | Parallel processing method and device for block chain consensus and execution and electronic equipment |
| US20200026691A1 (en) * | 2017-03-28 | 2020-01-23 | Alibaba Group Holding Limited | Blockchain-based data processing method and device |
| CN110738497A (en) * | 2019-12-19 | 2020-01-31 | 腾讯科技（深圳）有限公司 | data processing method, device, node equipment and storage medium |
| CN110838065A (en) * | 2019-10-24 | 2020-02-25 | 腾讯云计算（北京）有限责任公司 | Transaction data processing method and device |
| US20200076573A1 (en) * | 2018-08-30 | 2020-03-05 | International Business Machines Corporation | Special relationships in a blockchain |
| CN110992009A (en) * | 2019-12-04 | 2020-04-10 | 杭州复杂美科技有限公司 | Delayed transaction advanced processing method, device and storage medium |
-
2020
- 2020-03-26 CN CN202010225738.3A patent/CN111415259B/en active Active
Patent Citations (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2249554A1 (en) * | 1997-10-10 | 1999-04-10 | General Instrument Corporation | Secure processor with external memory using block chaining and block re-ordering |
| US20020108004A1 (en) * | 2001-02-08 | 2002-08-08 | Shah Paras A. | Enhancement of transaction order queue |
| US20070283131A1 (en) * | 2006-01-30 | 2007-12-06 | Ati Technologies Inc. | Processing of high priority data elements in systems comprising a host processor and a co-processor |
| CN107592966A (en) * | 2015-05-13 | 2018-01-16 | 思科技术公司 | To the dynamic protection of shared memory used in the output queue in the network equipment |
| CN106886890A (en) * | 2017-02-07 | 2017-06-23 | 杭州秘猿科技有限公司 | A kind of timing transaction execution method based on block chain |
| US20180240114A1 (en) * | 2017-02-22 | 2018-08-23 | Alibaba Group Holding Limited | Transaction verification in a consensus network |
| US20200026691A1 (en) * | 2017-03-28 | 2020-01-23 | Alibaba Group Holding Limited | Blockchain-based data processing method and device |
| US20190089713A1 (en) * | 2017-09-18 | 2019-03-21 | James J. Leftwich | System and method for producing a dynamically ordered queue |
| CN107742352A (en) * | 2017-09-20 | 2018-02-27 | 黄玉宇 | Decentralization lot/queuing strategy and system based on block chain and intelligent contract |
| CN107809480A (en) * | 2017-10-25 | 2018-03-16 | 上海瀚银信息技术有限公司 | One kind transaction commutation system |
| CN107819696A (en) * | 2017-11-22 | 2018-03-20 | 中国银行股份有限公司 | A kind of transaction flow control method and system |
| CN108288156A (en) * | 2018-01-04 | 2018-07-17 | 杭州复杂美科技有限公司 | A kind of storage of block chain transaction and queuing strategy |
| CN108846745A (en) * | 2018-04-19 | 2018-11-20 | 深圳市网心科技有限公司 | Block chain trading processing auxiliary system, block chain data processing system and method |
| CN108876521A (en) * | 2018-06-04 | 2018-11-23 | 贵州数据宝网络科技有限公司 | A kind of high concurrent data transacting system and method |
| US20190392406A1 (en) * | 2018-06-20 | 2019-12-26 | International Business Machines Corporation | Privacy preserving transactions with probabilistic transaction fees |
| US20200076573A1 (en) * | 2018-08-30 | 2020-03-05 | International Business Machines Corporation | Special relationships in a blockchain |
| CN109669789A (en) * | 2018-12-10 | 2019-04-23 | 杭州复杂美科技有限公司 | Transaction queuing strategy, trading pit storage method, equipment and storage medium |
| CN109450659A (en) * | 2018-12-25 | 2019-03-08 | 杭州复杂美科技有限公司 | Block delayed broadcast method, equipment and storage medium |
| CN109995666A (en) * | 2019-04-12 | 2019-07-09 | 深圳市元征科技股份有限公司 | A kind of method for message transmission and relevant apparatus |
| CN110163609A (en) * | 2019-05-28 | 2019-08-23 | 深圳前海微众银行股份有限公司 | Data processing method and device in a kind of block chain |
| CN110457342A (en) * | 2019-07-02 | 2019-11-15 | 网联清算有限公司 | Transaction processing method and device |
| CN110445755A (en) * | 2019-07-04 | 2019-11-12 | 杭州复杂美科技有限公司 | Hand over pregnable defence method, equipment and storage medium |
| CN110659988A (en) * | 2019-09-10 | 2020-01-07 | 杭州秘猿科技有限公司 | Parallel processing method and device for block chain consensus and execution and electronic equipment |
| CN110838065A (en) * | 2019-10-24 | 2020-02-25 | 腾讯云计算（北京）有限责任公司 | Transaction data processing method and device |
| CN110992009A (en) * | 2019-12-04 | 2020-04-10 | 杭州复杂美科技有限公司 | Delayed transaction advanced processing method, device and storage medium |
| CN110738497A (en) * | 2019-12-19 | 2020-01-31 | 腾讯科技（深圳）有限公司 | data processing method, device, node equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115271746A (en) * | 2022-09-27 | 2022-11-01 | 江苏荣泽信息科技股份有限公司 | Block chain transaction sorting algorithm with priority |
| CN115604354A (en) * | 2022-12-09 | 2023-01-13 | 北京百度网讯科技有限公司（Cn） | Transaction processing method, device and equipment based on block chain and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111415259B (en) | 2024-02-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111415259B (en) | Transaction queuing method, device and storage medium | |
| US20180314633A1 (en) | Balanced double deques for eliminating memory fences in garbage collection | |
| CN111324449A (en) | Transaction storage and broadcasting method, device and storage medium of memory pool | |
| CN109687953B (en) | Transaction classification method, apparatus and storage medium | |
| CN106557358B (en) | Data storage method and device based on dual-core processor | |
| CN111221638B (en) | Concurrent task scheduling processing method, device, equipment and medium | |
| US10360267B2 (en) | Query plan and operation-aware communication buffer management | |
| US11823063B2 (en) | Distributed processing system and distributed processing method | |
| EP3531417A1 (en) | Transmission device, transmission method, and program | |
| CN105491150A (en) | Load balance processing method based on time sequence and system | |
| CN109242320B (en) | Order allocation method, device, server and storage medium | |
| CN114385353A (en) | Resource scheduling method and device, electronic equipment and storage medium | |
| CN110928905A (en) | Data processing method and device | |
| CN114911598A (en) | Task scheduling method, device, equipment and storage medium | |
| CN109919622B (en) | Transaction replacement method, apparatus and storage medium | |
| CN112887345A (en) | Node load balancing scheduling method for edge computing environment | |
| CN111405037A (en) | Block synchronization method, device and storage medium | |
| CN112600905A (en) | Transaction broadcasting and block generating method, apparatus and storage medium | |
| CN109829822B (en) | Transaction replacing method, transaction queuing method, device and storage medium | |
| CN114493875A (en) | Transaction execution method, computer device, and storage medium | |
| CN111711971B (en) | Data transmission method and device, storage medium and electronic equipment | |
| CN111639939A (en) | Block restoring method, equipment and storage medium | |
| CN116069518A (en) | Dynamic allocation processing task method and device, electronic equipment and readable storage medium | |
| CN112804322B (en) | Block generation method, computer device and storage medium | |
| CN109299112B (en) | Method and apparatus for processing data |
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 |