CN113110934A - Parallel chain block generation method, computer device, and storage medium - Google Patents
Parallel chain block generation method, computer device, and storage medium Download PDFInfo
- Publication number
- CN113110934A CN113110934A CN202110384111.7A CN202110384111A CN113110934A CN 113110934 A CN113110934 A CN 113110934A CN 202110384111 A CN202110384111 A CN 202110384111A CN 113110934 A CN113110934 A CN 113110934A
- Authority
- CN
- China
- Prior art keywords
- channel
- parallel chain
- time slot
- block
- remainder
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 73
- 238000004806 packaging method and process Methods 0.000 claims abstract description 20
- 230000004044 response Effects 0.000 claims abstract description 16
- 238000004590 computer program Methods 0.000 claims description 8
- 238000012856 packing Methods 0.000 claims description 8
- 230000001360 synchronised effect Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000000087 stabilizing effect Effects 0.000 description 1
- 230000001629 suppression Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- General Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention provides a parallel chain block generation method, computer equipment and a storage medium, wherein the method comprises the following steps: receiving a first time slot registration transaction of a first parallel chain; when the first time slot is not registered, recording a first corresponding relation between the first time slot and a first parallel chain name on a main chain; in response to obtaining the packaging right of the first block with the first block height, pulling a plurality of first transactions from the memory pool, and executing the following steps for each first transaction respectively: when the first transaction is a parallel chain transaction, calculating a first quotient of the first block height and the total number of the channels; inquiring the total number of second time slots of a second channel with the channel number being the first quotient; calculating a first remainder of the first quotient and the total number of the second time slots; judging whether a second parallel chain to which the first transaction belongs corresponds to a second time slot with the number of the first remainder in the second channel: if not, the first transaction is stored in the memory pool again; if so, the first transaction is packed into the first block. The application stabilizes the exchange peak and reduces the commission charge.
Description
Technical Field
The present application relates to the field of parallel chain technologies, and in particular, to a parallel chain block generation method, a computer device, and a storage medium.
Background
In the existing main chain parallel chain architecture, parallel chain transactions of different parallel chains are mixed into a main chain block, and the parallel chains filter own transactions according to own titles.
The mechanism leads to increase of parallel chain transactions in a certain period, and a large number of parallel chain transactions squeeze packaging resources of main chain transactions, thus causing block chain network congestion; the handling fee of the consensus transaction depends on the network congestion condition, and the above mechanism causes the handling fee waste problem for the parallel chain transaction of the consensus transaction type which is not urgent for the uplink.
Disclosure of Invention
In view of the above-mentioned deficiencies or inadequacies in the prior art, it would be desirable to provide a parallel chain block generation method, computer apparatus, and storage medium that levels off peak exchange and reduces commission fees.
In a first aspect, the present invention provides a method for generating a parallel chain block suitable for a main chain node, where a block chain is configured with channel and timeslot parameters, the method including:
receiving a first time slot registration transaction of a first parallel chain; wherein the first time slot registration transaction includes a first time slot of the first channel and a first parallel chain name of the first parallel chain;
determining whether the first slot is registered:
if not, recording the first corresponding relation between the first time slot and the first parallel chain name on the main chain;
in response to obtaining the packaging right of the first block with the first block height, pulling a plurality of first transactions from the memory pool, and executing the following steps for each first transaction respectively:
when the first transaction is a parallel chain transaction, calculating a first remainder and a first quotient of the first block height and the total number of the channels;
inquiring the total number of second time slots of a second channel with the channel number being the first remainder;
calculating a second remainder of the first quotient and the total number of the second time slots;
judging whether a second parallel chain to which the first transaction belongs corresponds to a second time slot with the number of a second remainder in a second channel:
if not, the first transaction is stored in the memory pool again;
if yes, packaging the first transaction into a first block;
wherein the first block height is for parallel chain nodes of each parallel chain:
calculating a first remainder, a first quotient, and a second remainder;
judging whether the parallel chain corresponds to a second time slot:
if yes, generating a first parallel chain block according to the first block;
otherwise, the first block head of the first block is synchronized.
In a second aspect, the present invention provides a parallel chain block generation method suitable for parallel chain nodes, where a block chain is configured with channel and timeslot parameters, the method includes:
generating a first time slot registration transaction; the first time slot registration transaction comprises a first channel, a first time slot of the first channel and a first parallel chain name of a first parallel chain where the first time slot registration transaction is located;
sending the first time slot registration transaction to a main chain, so that when the main chain node judges that the first time slot is not registered, recording a first corresponding relation between the first time slot and a parallel chain name of a current parallel chain on the main chain;
obtaining a first block of a main chain; the first block is packed with a plurality of first transactions, the packed first transactions comprise a plurality of first transactions pulled from a memory pool in response to the main chain node obtaining the packing right of the first block with the first block height, the packed first transactions are parallel chain transactions, a second parallel chain to which the packed first transactions belong corresponds to a second time slot with a second remainder in a second channel, the second channel is a channel with a first quotient, the channel number is a channel number, the first quotient is a quotient of the first block height and the total number of the channels, the second remainder is the remainder of the first quotient and the total number of the second time slot, the total number of the second time slot is the total number of the time slot of the second channel with the first remainder, and the first remainder is the remainder of the first block height and the total number of the channels;
calculating a first remainder, a first quotient, and a second remainder;
judging whether the current parallel chain corresponds to a second time slot:
if yes, generating a first parallel chain block according to the first block;
otherwise, the first block head of the first block is synchronized.
In a third aspect, the present invention provides a method for generating a parallel chain block suitable for a main chain node, where a block chain is configured with channel and timeslot parameters, the method including:
receiving a first time slot registration transaction of a first parallel chain; wherein the first time slot registration transaction includes a first parallel chain name of the first parallel chain;
allocating a first time slot of a first channel which is not registered for a first parallel chain; and the number of the first and second groups,
recording a first corresponding relation between a first time slot and a first parallel chain name on a main chain;
in response to obtaining the packaging right of the first block with the first block height, pulling a plurality of first transactions from the memory pool, and executing the following steps for each first transaction respectively:
when the first transaction is a parallel chain transaction, calculating a first remainder and a first quotient of the first block height and the total number of the channels;
inquiring the total number of second time slots of a second channel with the channel number being the first remainder;
calculating a second remainder of the first quotient and the total number of the second time slots;
judging whether a second parallel chain to which the first transaction belongs corresponds to a second time slot with the number of a second remainder in a second channel:
if not, the first transaction is stored in the memory pool again;
if yes, packaging the first transaction into a first block;
wherein the first block height is for parallel chain nodes of each parallel chain:
calculating a first remainder, a first quotient, and a second remainder;
judging whether the parallel chain corresponds to a second time slot:
if yes, generating a first parallel chain block according to the first block;
otherwise, the first block head of the first block is synchronized.
In a fourth aspect, the present invention provides a parallel chain block generation method suitable for parallel chain nodes, where a block chain is configured with channel and timeslot parameters, the method includes:
generating a first time slot registration transaction; the first time slot registration transaction comprises a first parallel chain name of a first parallel chain where the first time slot registration transaction is located;
sending the first time slot registration transaction to a main chain so that a main chain node can allocate a first time slot of an unregistered first channel to a first parallel chain, and recording a first corresponding relation among the first channel, the first time slot and a first parallel chain name on the main chain;
obtaining a first block of a main chain; the first block is packed with a plurality of first transactions, the packed first transactions comprise a plurality of first transactions pulled from a memory pool in response to the main chain node obtaining the packing right of the first block with the first block height, the packed first transactions are parallel chain transactions, a second parallel chain to which the packed first transactions belong corresponds to a second time slot with a second remainder in a second channel, the second channel is a channel with a first quotient, the channel number is a channel number, the first quotient is a quotient of the first block height and the total number of the channels, the second remainder is the remainder of the first quotient and the total number of the second time slot, the total number of the second time slot is the total number of the time slot of the second channel with the first remainder, and the first remainder is the remainder of the first block height and the total number of the channels;
calculating a first remainder, a first quotient, and a second remainder;
judging whether the current parallel chain corresponds to a second time slot:
if yes, generating a first parallel chain block according to the first block;
otherwise, the first block head of the first block is synchronized.
In a fifth aspect, the present invention also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a parallel chain block generation method provided according to embodiments of the present invention.
In a sixth aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute the parallel chain block generation method provided according to the embodiments of the present invention.
Embodiments of the present invention provide a parallel chain block generation method, a computer device, and a storage medium, which register a transaction by receiving a first time slot of a first parallel chain; when the first time slot is not registered, recording a first corresponding relation between the first time slot and a first parallel chain name on a main chain; in response to obtaining the packaging right of the first block with the first block height, pulling a plurality of first transactions from the memory pool, and executing the following steps for each first transaction respectively: when the first transaction is a parallel chain transaction, calculating a first quotient of the first block height and the total number of the channels; inquiring the total number of second time slots of a second channel with the channel number being the first quotient; calculating a first remainder of the first quotient and the total number of the second time slots; judging whether a second parallel chain to which the first transaction belongs corresponds to a second time slot with the number of the first remainder in the second channel: if not, the first transaction is stored in the memory pool again; if yes, the method of packaging the first transaction into the first block can stabilize the exchange of the transaction peak and reduce the commission charge.
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 parallel chain block generation method according to an embodiment of the present invention.
Fig. 2 is a flowchart of another parallel chain block generation method according to an embodiment of the present invention.
Fig. 3 is a flowchart of another parallel chain block generation method according to an embodiment of the present invention.
Fig. 4 is a flowchart of another parallel chain block generation method according to an embodiment of the present invention.
Fig. 5 is a schematic structural diagram of a computer device 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 parallel chain block generation method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, the present invention provides a parallel chain block generation method suitable for a main chain node, where a block chain is configured with channel and timeslot parameters, and the method includes:
s11: receiving a first time slot registration transaction of a first parallel chain; wherein the first time slot registration transaction includes a first time slot of the first channel and a first parallel chain name of the first parallel chain;
s131: determining whether the first slot is registered:
otherwise, step S132 is executed: recording a first corresponding relation between a first time slot and a first parallel chain name on a main chain;
s15: in response to obtaining the packaging right of the first block with the first block height, pulling a plurality of first transactions from the memory pool, and executing the following steps for each first transaction respectively:
s171: when the first transaction is a parallel chain transaction, calculating a first remainder and a first quotient of the first block height and the total number of the channels;
s172: inquiring the total number of second time slots of a second channel with the channel number being the first remainder;
s173: calculating a second remainder of the first quotient and the total number of the second time slots;
s1741: judging whether a second parallel chain to which the first transaction belongs corresponds to a second time slot with the number of a second remainder in a second channel:
otherwise, step S1742 is executed: the first transaction is stored in the memory pool again;
if yes, go to step S1743: packaging the first transaction into a first block;
wherein the first block height is for parallel chain nodes of each parallel chain:
calculating a first remainder, a first quotient, and a second remainder;
judging whether the parallel chain corresponds to a second time slot:
if yes, generating a first parallel chain block according to the first block;
otherwise, the first block head of the first block is synchronized.
Specifically, taking the total number of time slots as a non-fixed value, recording the first corresponding relationship between the first time slot and the first parallel chain name on the main chain comprises the steps of adding one to the total number of the first time slot of the first channel to update the total number of the first time slot; recording the first time slot, the first corresponding relation of the first parallel chain name and the total number of the first time slot on the main chain as an example; assuming the total number of channels is 100; the block chain in the time zone comprises a main chain maincalin, a parallel chain parachain 1-30 (the parallel chain is named as pc 1-pc 30); pc1 has channel 1 slot 0 registered, pc2 has channel 2 slot 0 registered, 0 … … pc30 has channel 30 slot 0 registered;
the management node of the parachain31 generates a slot registration transaction tx1 and transmits the slot registration transaction tx1 to the main chain node in response to registering the channel 30 slot 0, wherein pc31 and the channel 30 slot 0 are included in tx 1; those skilled in the art will appreciate that the time slot registration transaction can also be generated by different nodes according to actual requirements, for example, the time slot registration transaction can be generated by a consensus node of the parachain31, or can be generated by each node of the parachain31, and the same technical effect can be achieved;
the main chain node performs step S11, receiving tx 1;
the main chain node executes step S131 to determine whether slot 0 of channel 30 is registered:
since channel 30 slot 0 is registered, tx1 execution fails;
the management node of the parachain31 generates and transmits a slot registration transaction tx2 to the main chain node in response to registering channel 1 slot 1, wherein pc31 and channel 1 slot 1 are included in tx 2;
the main chain node performs step S11, receiving tx 2;
the main chain node executes step S131 to determine whether channel 1 slot 1 is registered:
since the channel 1 time slot 1 is not registered, the main chain node executes step S132, and changes the total number of time slots of the channel 1 to 2, and records the corresponding relationship between the channel 1 time slot 1 and the pc31, and the total number of time slots of the channel 1 to 2 on the main chain;
the main chain node responds to the packaging right of the block (1001), and executes a step S15, and transactions tx11 to tx20 are pulled from the memory pool (transaction tx11 to tx15 are pc1, and transaction tx16 to tx20 are pc 2);
the main chain nodes respectively execute the following steps on tx11 to tx 20:
tx 11-tx 15 are trades of pc1, here, tx11 is taken as an example:
the main chain node executes step S171, and calculates a first remainder and a first quotient of 1001 and 100 because tx11 is a parallel chain transaction, where the first remainder is 1 and the first quotient is 10;
the main chain node executes step S172, and inquires the total number of time slots of channel 1, where the total number of time slots of channel 1 is 2;
the main-chain node executes step S173 to calculate a second remainder of the first quotient 10 and the total number of timeslots 2, where the second remainder is 0;
the main chain node executes step S1741 to determine whether the parallel chain pc1 corresponding to tx11 corresponds to channel 1 slot 0:
if so, executing step S1743 to pack tx11 into block (1001);
tx 12-tx 15 are the same as tx11, and are not described herein;
tx 16-tx 20 are trades of pc2, here, tx16 is taken as an example:
the execution principle of S171 to S173 is the same as that of tx11, and the description is omitted here;
the main chain node executes step S1741 to determine whether the parallel chain pc2 corresponding to tx16 corresponds to channel 1 slot 0:
if not, step S1742 is executed to restore tx16 to the memory pool;
tx 17-tx 20 are the same as tx16, and are not described herein;
the final block (1001) is packaged with tx 11-tx 15;
calculating a first remainder 1, a first quotient 10 and a second remainder 0 by parallel chain nodes pc 1-pc 31;
if the parallel chain link point of the pc1 judges that the pc1 corresponds to the channel 1 time slot 0, a parallel chain block is generated according to the block (1001); as will be appreciated by those skilled in the art, since block (1001) is packed with tx 11-tx 15, the parallel chain node of pc1 should generate a parallel chain block from tx 11-tx 15, and if the block (1001) is not packed with the parallel chain transaction of pc1, the parallel chain node of pc1 should generate an empty block;
and (3) if the parallel chain nodes of pc 2-pc 31 judge that the corresponding parallel chains do not correspond to the channel 1 time slot 0, synchronizing the blockheader (1001).
The main chain node responds to the packaging right of the block (1101) and executes a step S15, and transactions tx21 to tx30 are pulled from the memory pool (transactions tx21 to tx25 are pc31, and transactions tx26 to tx30 are pc 1);
the main chain nodes respectively execute the following steps on tx21 to tx 30:
tx 21-tx 25 are trades of pc31, here, tx21 is taken as an example:
the main chain node executes step S171, and calculates 1101 and 100 a first remainder and a first quotient number because tx21 is a parallel chain transaction, where the first remainder is 1 and the first quotient number is 11;
the main chain node executes step S172, and inquires the total number of time slots of channel 1, where the total number of time slots of channel 1 is 2;
the main-chain node executes step S173 to calculate a second remainder of the first quotient 11 and the total number of timeslots 2, where the second remainder is 1;
the main chain node executes step S1741 to determine whether the parallel chain pc1 corresponding to tx21 corresponds to channel 1 slot 1:
if so, executing step S1743, packing tx21 into block (1101);
tx 22-tx 25 are the same as tx21, and are not described herein;
tx 26-tx 30 are trades of pc1, here, tx26 is taken as an example:
the execution principle of S171 to S173 is the same as that of tx21, and the description is omitted here;
the main chain node executes step S1741 to determine whether the parallel chain pc1 corresponding to tx26 corresponds to channel 1 slot 0:
if not, step S1742 is executed to restore tx26 to the memory pool;
tx 27-tx 30 are the same as tx26, and are not described herein;
the final block (1101) is packaged with tx 21-tx 25;
calculating a first remainder 1, a first quotient 11 and a second remainder 1 by parallel chain nodes pc 1-pc 31;
if the parallel link point of pc31 judges that pc31 corresponds to channel 1 time slot 1, a parallel chain block is generated according to block (1101);
and (3) judging that the parallel chain node of the pc 1-pc 30 does not correspond to the channel 1 time slot 1, and synchronizing the blockheader (1101).
In further embodiments, the total number of timeslots may be configured to be a fixed value according to actual requirements, for example, the total number of timeslots of all channels is configured to be 5, or the total number of timeslots of different channels is configured to be different fixed values, for example, the total number of timeslots of channel 1 is configured to be 5, and the total number of timeslots of channel 2 is configured to be 10 … …, which may achieve the same technical effect.
In more embodiments, the total number of channels may also be configured according to actual requirements, and if a shorter transaction period of a single parallel chain is desired, the total number of channels is configured to be smaller, for example, to be 50, and if a longer transaction period of a single parallel chain is desired, the total number of channels is configured to be smaller, for example, to be 150, and the same technical effect can be achieved.
It should be understood by those skilled in the art that if all parallel chains occupy one channel, i.e., the total number of timeslots of all channels is 1, the technical effects of suppressing the congestion of the transaction peak and reducing the commission fee can be achieved. However, if only one parallel chain is registered in each channel, as the block chain network ecology develops, more and more parallel chains are added, the total number of channels becomes larger and the transaction period of a single parallel chain becomes longer. The method and the device can not prolong the transaction period of part of parallel chains on the basis of realizing the suppression of the exchange peak and reducing the handling fee, and support more parallel chains to participate in the construction of the block chain network.
It should be understood by those skilled in the art that when the method shown in the present embodiment is configured, the time slot is counted from 0, and a suitable modification may be made, for example, if the time slot needs to be counted from 1, S1741 should be configured as: and judging whether the second parallel chain to which the first transaction belongs corresponds to a second time slot with the number of the second remainder plus one in the second channel.
In the prior art, if a large amount of parallel chain transactions of pc1 are generated within a period of time, the packaging resources of the main chain transaction can be squeezed by the parallel chain transaction peak of pc1, and further the packaging congestion of the main chain transaction is caused; the embodiment can disperse the transaction of the parallel chain to different blocks, and can effectively stabilize the crowding of the transaction peak.
In the prior art, when the packing congestion situation occurs, the problem of improvement of transaction commission charge is caused; additional transaction fee costs may be incurred for some parallel chain transactions that are not particularly urgent for the uplink (e.g., parallel chain consensus transactions); the embodiment can reduce the commission cost while stabilizing the exchange peak.
Preferably, the total number of time slots is a non-fixed value, and recording the first correspondence between the first time slot and the first parallel chain name on the main chain includes:
adding one to the first total number of timeslots of the first channel to update the first total number of timeslots;
and recording the first time slot, the first corresponding relation of the first parallel chain name and the total number of the first time slot on the main chain.
The parallel chain block generation principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
Further preferably, the step of adding one to the first total number of timeslots of the first channel to update the first total number of timeslots comprises:
calculating a first transaction total amount of transactions of the parallel chain corresponding to each time slot of the first channel in the first block height range;
determining whether the first transaction amount is less than a first value:
if so, the first total number of timeslots of the first channel is incremented by one to update the first total number of timeslots.
It will be understood by those skilled in the art that if the parallel chain has a high activity, it is reasonable to occupy one channel alone (i.e., the total number of slots of the channel is 1); however, for a parallel chain which is not active, in a scene where a channel is scarce, it is unreasonable to monopolize a certain channel resource. The activity of the parallel chain on a certain channel in a block height range is judged by calculating the transaction total amount of the parallel chain of the channel, if the transaction total amount is large, the new parallel chain is not allowed to register a new time slot on the channel, and if the transaction total amount is small, the new parallel chain is allowed to register a new time slot on the channel.
Preferably, the method further comprises:
receiving first request information which is sent by a third parallel chain node of a third parallel chain and requests first block data;
calculating a third remainder and a second quotient of the second block height of the main chain block where the first block data is located and the total number of the channels;
inquiring the total number of the third time slots of a third channel with the channel number as a third remainder;
calculating a fourth remainder of the second quotient and the total number of the third time slots;
judging whether the third parallel chain corresponds to a third time slot with a fourth remainder in the third channel:
if not, returning error information;
if yes, the first block data is returned.
In the prior art, since the same main chain block can have parallel chain transactions of different parallel chains, the parallel chain link point of pc1 can obtain transaction information of parallel chain transactions of other parallel chains through the main chain block;
the above-described embodiments ensure data unshared between different parallel chains.
Fig. 2 is a flowchart of another parallel chain block generation method according to an embodiment of the present invention. Fig. 2 is a method applied to a parallel link node corresponding to fig. 1, as shown in fig. 2, in this embodiment, the present invention provides a parallel link block generation method applied to a parallel link node, where a block chain is configured with channel and timeslot parameters, and the method includes:
s21: generating a first time slot registration transaction; the first time slot registration transaction comprises a first channel, a first time slot of the first channel and a first parallel chain name of a first parallel chain where the first time slot registration transaction is located;
s22: sending the first time slot registration transaction to a main chain, so that when the main chain node judges that the first time slot is not registered, recording a first corresponding relation between the first time slot and a parallel chain name of a current parallel chain on the main chain;
s23: obtaining a first block of a main chain; the first block is packed with a plurality of first transactions, the packed first transactions comprise a plurality of first transactions pulled from a memory pool in response to the main chain node obtaining the packing right of the first block with the first block height, the packed first transactions are parallel chain transactions, a second parallel chain to which the packed first transactions belong corresponds to a second time slot with a second remainder in a second channel, the second channel is a channel with a first quotient, the channel number is a channel number, the first quotient is a quotient of the first block height and the total number of the channels, the second remainder is the remainder of the first quotient and the total number of the second time slot, the total number of the second time slot is the total number of the time slot of the second channel with the first remainder, and the first remainder is the remainder of the first block height and the total number of the channels;
s24: calculating a first remainder, a first quotient, and a second remainder;
s251: judging whether the current parallel chain corresponds to a second time slot:
if yes, go to step S252: generating a first parallel chain block according to the first block;
otherwise, step S253 is executed: the first block header of the first block is synchronized.
The parallel chain block generation principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
Fig. 3 is a flowchart of another parallel chain block generation method according to an embodiment of the present invention. As shown in fig. 3, in this embodiment, the present invention provides a parallel chain block generation method suitable for a main chain node, where a block chain is configured with channel and timeslot parameters, and the method includes:
s31: receiving a first time slot registration transaction of a first parallel chain; wherein the first time slot registration transaction includes a first parallel chain name of the first parallel chain;
s33: allocating a first time slot of a first channel which is not registered for a first parallel chain; and the number of the first and second groups,
s35: recording a first corresponding relation between a first time slot and a first parallel chain name on a main chain;
s37: in response to obtaining the packaging right of the first block with the first block height, pulling a plurality of first transactions from the memory pool, and executing the following steps for each first transaction respectively:
s391: when the first transaction is a parallel chain transaction, calculating a first remainder and a first quotient of the first block height and the total number of the channels;
s392: inquiring the total number of second time slots of a second channel with the channel number being the first remainder;
s393: calculating a second remainder of the first quotient and the total number of the second time slots;
s3941: judging whether a second parallel chain to which the first transaction belongs corresponds to a second time slot with the number of a second remainder in a second channel:
otherwise, step S3942 is executed: the first transaction is stored in the memory pool again;
if yes, go to step S3943: packaging the first transaction into a first block;
wherein the first block height is for parallel chain nodes of each parallel chain:
calculating a first remainder, a first quotient, and a second remainder;
judging whether the parallel chain corresponds to a second time slot:
if yes, generating a first parallel chain block according to the first block;
otherwise, the first block head of the first block is synchronized.
This embodiment differs from the embodiment shown in fig. 1 in that in the embodiment shown in fig. 1, the first time slot registration transaction further includes the first time slot of the first channel, whereas in this application, the first time slot registration transaction does not include the first time slot of the specified first channel, which is allocated by the main chain node for the first parallel chain according to actual needs.
It should be understood by those skilled in the art that, in order to ensure that the first time slots of the first channels allocated to all the main chain nodes are the same, the main chain nodes should be configured with the same time slot allocation rule.
Other steps of this embodiment are basically similar to the parallel chain block generation principle shown in fig. 1, and are not described herein again.
Preferably, the total number of time slots is a non-fixed value, and recording the first correspondence between the first time slot and the first parallel chain name on the main chain includes:
adding one to the first total number of timeslots of the first channel to update the first total number of timeslots;
and recording the first time slot, the first corresponding relation of the first parallel chain name and the total number of the first time slot on the main chain.
The principle of generating parallel chain blocks in this embodiment is the same as that of the preferred embodiment shown in fig. 1, and is not described herein again.
Preferably, the first slot registration transaction further comprises a first channel, the allocating a first slot of the first channel unregistered for the first parallel chain comprises:
the first parallel chain is allocated a first unregistered time slot of the first channel.
Further preferably, allocating the unregistered first slot of the first channel to the first parallel chain comprises:
calculating a second transaction total amount of the transactions of the parallel chain corresponding to each time slot of the first channel in the first block height range;
determining whether the second transaction amount is less than the first value:
if yes, the unregistered first time slot of the first channel is allocated for the first parallel chain.
Preferably, allocating the first slot of the unregistered first channel to the first parallel chain comprises:
the following operations are performed for each channel: calculating a first transaction total amount of transactions of the parallel chain corresponding to each time slot of the channel in the first block height range;
determining the channel with the least first transaction total amount as a first channel;
the first parallel chain is allocated a first unregistered time slot of the first channel.
Preferably, the method further comprises:
receiving first request information which is sent by a third parallel chain node of a third parallel chain and requests first block data;
calculating a third remainder and a second quotient of the second block height of the main chain block where the first block data is located and the total number of the channels;
inquiring the total number of the third time slots of a third channel with the channel number as a third remainder;
calculating a fourth remainder of the second quotient and the total number of the third time slots;
judging whether the third parallel chain corresponds to a third time slot with a fourth remainder in the third channel:
if not, returning error information;
if yes, the first block data is returned.
The principle of generating parallel chain blocks in this embodiment is the same as that of the preferred embodiment shown in fig. 1, and is not described herein again.
The above-described embodiments ensure data unshared between different parallel chains.
Fig. 4 is a flowchart of another parallel chain block generation method according to an embodiment of the present invention. Fig. 4 is a method corresponding to fig. 3 and applied to a parallel link node, as shown in fig. 4, in this embodiment, the present invention provides a parallel link block generation method applied to a parallel link node, where a block chain is configured with channel and timeslot parameters, and the method includes:
s41: generating a first time slot registration transaction; the first time slot registration transaction comprises a first parallel chain name of a first parallel chain where the first time slot registration transaction is located;
s42: sending the first time slot registration transaction to a main chain so that a main chain node can allocate a first time slot of an unregistered first channel to a first parallel chain, and recording a first corresponding relation among the first channel, the first time slot and a first parallel chain name on the main chain;
s43: obtaining a first block of a main chain; the first block is packed with a plurality of first transactions, the packed first transactions comprise a plurality of first transactions pulled from a memory pool in response to the main chain node obtaining the packing right of the first block with the first block height, the packed first transactions are parallel chain transactions, a second parallel chain to which the packed first transactions belong corresponds to a second time slot with a second remainder in a second channel, the second channel is a channel with a first quotient, the channel number is a channel number, the first quotient is a quotient of the first block height and the total number of the channels, the second remainder is the remainder of the first quotient and the total number of the second time slot, the total number of the second time slot is the total number of the time slot of the second channel with the first remainder, and the first remainder is the remainder of the first block height and the total number of the channels;
s44: calculating a first remainder, a first quotient, and a second remainder;
s451: judging whether the current parallel chain corresponds to a second time slot:
if yes, go to step S452: generating a first parallel chain block according to the first block;
otherwise, step S453 is executed: the first block header of the first block is synchronized.
The parallel chain block generation principle of the above embodiment can refer to the method shown in fig. 3, and is not described herein again.
Preferably, the first slot registration transaction further comprises a first channel, the allocating a first slot of the first channel unregistered for the first parallel chain comprises:
the first parallel chain is allocated a first unregistered time slot of the first channel.
Further preferably, allocating the unregistered first slot of the first channel to the first parallel chain comprises:
calculating a second transaction total amount of the transactions of the parallel chain corresponding to each time slot of the first channel in the first block height range;
determining whether the second transaction amount is less than the first value:
if yes, the unregistered first time slot of the first channel is allocated for the first parallel chain.
Preferably, allocating the first slot of the unregistered first channel to the first parallel chain comprises:
the following operations are performed for each channel: calculating a first transaction total amount of transactions of the parallel chain corresponding to each time slot of the channel in the first block height range;
determining the channel with the least first transaction total amount as a first channel;
the first parallel chain is allocated a first unregistered time slot of the first channel.
Fig. 5 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
As shown in fig. 5, as another aspect, the present application also provides a computer apparatus including one or more Central Processing Units (CPUs) 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for the operation of the computer apparatus are also stored. The CPU501, ROM502, and RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to an embodiment of the present disclosure, the 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 any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511.
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 computer-readable storage medium that exists separately and is not assembled into a computer device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present application.
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 (17)
1. A parallel chain block generation method is characterized in that a block chain is configured with channel and time slot parameters, the method is suitable for a main chain node, and the method comprises the following steps:
receiving a first time slot registration transaction of a first parallel chain; wherein the first time slot registration transaction includes a first time slot of a first channel and a first parallel chain name of the first parallel chain;
determining whether the first slot is registered:
if not, recording the first corresponding relation between the first time slot and the first parallel chain name on the main chain;
in response to obtaining the packaging right of the first block with the first block height, pulling a plurality of first transactions from the memory pool, and respectively executing the following steps on each first transaction:
when the first transaction is a parallel chain transaction, calculating a first remainder and a first quotient of the first block height and the total number of channels;
inquiring the total number of second time slots of a second channel with the channel number being the first remainder;
calculating a second remainder of the first quotient and the second time slot total number;
judging whether a second parallel chain to which the first transaction belongs corresponds to a second time slot numbered as the second remainder in the second channel:
if not, the first transaction is stored in the memory pool again;
if yes, packaging the first transaction into the first block;
wherein the first block height is for parallel chain nodes of each parallel chain:
calculating the first remainder, first quotient number and second remainder;
judging whether the parallel chain corresponds to the second time slot:
if yes, generating a first parallel chain block according to the first block;
otherwise, synchronizing the first block head of the first block.
2. The method of claim 1, wherein the total number of timeslots is a non-fixed value, and wherein recording the first correspondence of the first timeslot and the first parallel chain name onto the main chain comprises:
adding one to a first total number of timeslots of the first channel to update the first total number of timeslots;
and recording the first time slot, the first corresponding relation of the first parallel chain name and the total number of the first time slot on a main chain.
3. The method of claim 2, wherein the adding the first total number of timeslots of the first channel by one to update the first total number of timeslots comprises:
calculating a first transaction total amount of transactions of the parallel chain corresponding to each time slot of the first channel in a first block height range;
determining whether the first transaction amount is less than a first value:
if so, the first total number of timeslots of the first channel is incremented by one to update the first total number of timeslots.
4. The method according to any one of claims 1-3, further comprising:
receiving first request information which is sent by a third parallel chain node of the third parallel chain and requests first block data;
calculating a third remainder and a second quotient of a second block height of a main chain block where the first block data is located and the total number of the channels;
inquiring the total number of the third time slots of a third channel with the channel number being the third remainder;
calculating a fourth remainder of the second quotient and the total number of the third time slots;
judging whether the third parallel chain corresponds to a third time slot with the number of the fourth remainder in the third channel:
if not, returning error information;
if yes, returning the first block data.
5. A parallel chain block generation method, wherein channel and timeslot parameters are configured on a block chain, the method is applicable to a parallel chain node, and the method comprises:
generating a first time slot registration transaction; the first time slot registration transaction comprises a first channel, a first time slot of the first channel and a first parallel chain name of a first parallel chain where the first time slot registration transaction is located;
sending the first time slot registration transaction to a main chain, so that when the main chain node judges that the first time slot is not registered, a first corresponding relation between the first time slot and a parallel chain name of a current parallel chain is recorded on the main chain;
obtaining a first block of a main chain; the first block is packed with a plurality of first transactions, the packed first transactions comprise a plurality of first transactions pulled from a memory pool in response to a main chain node obtaining a packing right of the first block with a first block height, the packed first transactions are parallel chain transactions, a second parallel chain to which the packed first transactions belong corresponds to a second time slot with a second remainder in a second channel, the second channel is a channel with a channel number of a first quotient, the first quotient is a quotient of the first block height and a total number of channels, the second remainder is a remainder of the first quotient and a total number of second time slots, the total number of the second time slots is a total number of time slots of the second channel with the channel number of the first remainder, and the first remainder is a remainder of the first block height and the total number of channels;
calculating the first remainder, first quotient number and second remainder;
judging whether the current parallel chain corresponds to the second time slot:
if yes, generating a first parallel chain block according to the first block;
otherwise, synchronizing the first block head of the first block.
6. A parallel chain block generation method is characterized in that a block chain is configured with channel and time slot parameters, the method is suitable for a main chain node, and the method comprises the following steps:
receiving a first time slot registration transaction of a first parallel chain; wherein the first slot registration transaction includes a first parallel chain name of the first parallel chain;
allocating a first time slot of a first channel which is not registered for the first parallel chain; and the number of the first and second groups,
recording a first corresponding relation between the first time slot and the first parallel chain name on a main chain;
in response to obtaining the packaging right of the first block with the first block height, pulling a plurality of first transactions from the memory pool, and respectively executing the following steps on each first transaction:
when the first transaction is a parallel chain transaction, calculating a first remainder and a first quotient of the first block height and the total number of channels;
inquiring the total number of second time slots of a second channel with the channel number being the first remainder;
calculating a second remainder of the first quotient and the second time slot total number;
judging whether a second parallel chain to which the first transaction belongs corresponds to a second time slot numbered as the second remainder in the second channel:
if not, the first transaction is stored in the memory pool again;
if yes, packaging the first transaction into the first block;
wherein the first block height is for parallel chain nodes of each parallel chain:
calculating the first remainder, first quotient number and second remainder;
judging whether the parallel chain corresponds to the second time slot:
if yes, generating a first parallel chain block according to the first block;
otherwise, synchronizing the first block head of the first block.
7. The method of claim 6, wherein the total number of timeslots is a non-fixed value, and wherein recording the first correspondence of the first timeslot and the first parallel chain name onto the main chain comprises:
adding one to a first total number of timeslots of the first channel to update the first total number of timeslots;
and recording the first time slot, the first corresponding relation of the first parallel chain name and the total number of the first time slot on a main chain.
8. The method of claim 6, wherein the first time slot registration transaction further comprises a first channel, and wherein allocating the first time slot of the unregistered first channel for the first parallel chain comprises:
a first unregistered time slot of the first channel is allocated for the first parallel chain.
9. The method of claim 6, wherein allocating the first time slot of the unregistered first channel for the first parallel chain comprises:
the following operations are performed for each channel: calculating a first transaction total amount of transactions of the parallel chain corresponding to each time slot of the channel in the first block height range;
determining the channel with the least first transaction total amount as the first channel;
a first unregistered time slot of the first channel is allocated for the first parallel chain.
10. The method of claim 8, wherein the allocating the unregistered first time slot of the first channel for the first parallel chain comprises:
calculating a second transaction total amount of transactions of the parallel chain corresponding to each time slot of the first channel in the first block height range;
determining whether the second transaction amount is less than a first value:
and if so, allocating the unregistered first time slot of the first channel for the first parallel chain.
11. The method according to any one of claims 6-10, further comprising:
receiving first request information which is sent by a third parallel chain node of the third parallel chain and requests first block data;
calculating a third remainder and a second quotient of a second block height of a main chain block where the first block data is located and the total number of the channels;
inquiring the total number of the third time slots of a third channel with the channel number being the third remainder;
calculating a fourth remainder of the second quotient and the total number of the third time slots;
judging whether the third parallel chain corresponds to a third time slot with the number of the fourth remainder in the third channel:
if not, returning error information;
if yes, returning the first block data.
12. A parallel chain block generation method, wherein channel and timeslot parameters are configured on a block chain, the method is applicable to a parallel chain node, and the method comprises:
generating a first time slot registration transaction; the first time slot registration transaction comprises a first parallel chain name of a first parallel chain where the first time slot registration transaction is located;
sending the first time slot registration transaction to a main chain so that a main chain node allocates a first time slot of an unregistered first channel for the first parallel chain, and recording a first corresponding relation among the first channel, the first time slot and a first parallel chain name on the main chain;
obtaining a first block of a main chain; the first block is packed with a plurality of first transactions, the packed first transactions comprise a plurality of first transactions pulled from a memory pool in response to a main chain node obtaining a packing right of the first block with a first block height, the packed first transactions are parallel chain transactions, a second parallel chain to which the packed first transactions belong corresponds to a second time slot with a second remainder in a second channel, the second channel is a channel with a channel number of a first quotient, the first quotient is a quotient of the first block height and a total number of channels, the second remainder is a remainder of the first quotient and a total number of second time slots, the total number of the second time slots is a total number of time slots of the second channel with the channel number of the first remainder, and the first remainder is a remainder of the first block height and the total number of channels;
calculating the first remainder, first quotient number and second remainder;
judging whether the current parallel chain corresponds to the second time slot:
if yes, generating a first parallel chain block according to the first block;
otherwise, synchronizing the first block head of the first block.
13. The method of claim 12, wherein the first time slot registration transaction further comprises a first channel, and wherein allocating the first time slot of the unregistered first channel for the first parallel chain comprises:
a first unregistered time slot of the first channel is allocated for the first parallel chain.
14. The method of claim 12, wherein allocating the first time slot of the unregistered first channel for the first parallel chain comprises:
the following operations are performed for each channel: calculating a first transaction total amount of transactions of the parallel chain corresponding to each time slot of the channel in the first block height range;
determining the channel with the least first transaction total amount as the first channel;
a first unregistered time slot of the first channel is allocated for the first parallel chain.
15. The method of claim 13, wherein the allocating the unregistered first slot of the first channel for the first parallel chain comprises:
calculating a second transaction total amount of transactions of the parallel chain corresponding to each time slot of the first channel in the first block height range;
determining whether the second transaction amount is less than a first value:
and if so, allocating the unregistered first time slot of the first channel for the first parallel chain.
16. A computer device, the device comprising:
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-15.
17. 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-15.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110384111.7A CN113110934A (en) | 2021-04-09 | 2021-04-09 | Parallel chain block generation method, computer device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110384111.7A CN113110934A (en) | 2021-04-09 | 2021-04-09 | Parallel chain block generation method, computer device, and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113110934A true CN113110934A (en) | 2021-07-13 |
Family
ID=76715336
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110384111.7A Pending CN113110934A (en) | 2021-04-09 | 2021-04-09 | Parallel chain block generation method, computer device, and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113110934A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109584072A (en) * | 2018-11-28 | 2019-04-05 | 杭州复杂美科技有限公司 | A kind of transaction sending method, equipment and the storage medium of parallel chain common recognition |
| CN109636384A (en) * | 2018-10-26 | 2019-04-16 | 阿里巴巴集团控股有限公司 | A kind of parallelization executes the method, apparatus and system of block chain transaction |
| CN110210972A (en) * | 2019-05-31 | 2019-09-06 | 杭州复杂美科技有限公司 | Common recognition transaction sending method, equipment and storage medium |
| CN111242780A (en) * | 2020-01-12 | 2020-06-05 | 杭州复杂美科技有限公司 | Method, device and storage medium for sending consensus transaction |
| WO2020177537A1 (en) * | 2019-03-02 | 2020-09-10 | 杭州复杂美科技有限公司 | Parallel chain consensus method, data exception processing method, device and storage medium |
-
2021
- 2021-04-09 CN CN202110384111.7A patent/CN113110934A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109636384A (en) * | 2018-10-26 | 2019-04-16 | 阿里巴巴集团控股有限公司 | A kind of parallelization executes the method, apparatus and system of block chain transaction |
| CN109584072A (en) * | 2018-11-28 | 2019-04-05 | 杭州复杂美科技有限公司 | A kind of transaction sending method, equipment and the storage medium of parallel chain common recognition |
| WO2020177537A1 (en) * | 2019-03-02 | 2020-09-10 | 杭州复杂美科技有限公司 | Parallel chain consensus method, data exception processing method, device and storage medium |
| CN110210972A (en) * | 2019-05-31 | 2019-09-06 | 杭州复杂美科技有限公司 | Common recognition transaction sending method, equipment and storage medium |
| CN111242780A (en) * | 2020-01-12 | 2020-06-05 | 杭州复杂美科技有限公司 | Method, device and storage medium for sending consensus transaction |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7796519B2 (en) | Dynamic bandwidth allocation circuit, dynamic bandwidth allocation method, optical network unit, PON system, dynamic bandwidth allocation program and recording medium | |
| CN103699445A (en) | Task scheduling method, device and system | |
| CN107045455A (en) | A kind of Docker Swarm cluster resource method for optimizing scheduling based on load estimation | |
| CN110138883B (en) | Hybrid cloud resource allocation method and device | |
| CN110287196B (en) | Block storage method, parallel chain transaction acquisition method, equipment and storage medium | |
| CN113032166B (en) | Inter-core communication method, processor, inter-core communication system, and computer-readable storage medium | |
| US11337224B2 (en) | Electronic device, method and computer readable storage medium for re-allocation of wireless communication resources | |
| CN108664321A (en) | System resource allocation method of adjustment and device | |
| CN116471277A (en) | Computing power distribution method, computing power distribution device, server and computer readable storage medium | |
| CN110210972B (en) | Method, device and storage medium for sending consensus transaction | |
| CN103248622A (en) | Method and system for guaranteeing service quality of automatic retractable online video | |
| CN113110934A (en) | Parallel chain block generation method, computer device, and storage medium | |
| CN106664259A (en) | Virtual network function capacity expansion method and apparatus | |
| CN114489963A (en) | Management method, system, equipment and storage medium of artificial intelligence application task | |
| US20050050198A1 (en) | Computer system and method for service load distributing | |
| CN115794421A (en) | Resource allocation method and device and electronic equipment | |
| CN110120978A (en) | A kind of method for security protection of elasticity user's cloud computing resources | |
| CN102811488B (en) | Resource regulating method, device and system | |
| JP6059259B2 (en) | Computer system and computer resource allocation method | |
| CN102215576B (en) | Distribution method for channel holding time, access point equipment and access network system | |
| CN110995863B (en) | Data center load distribution method and system based on load demand characteristics | |
| CN112839091A (en) | Block generation method, computer device and storage medium | |
| CN112948496A (en) | Parallel chain block generation method, computer device, and storage medium | |
| CN111818471B (en) | Resource charging method, MEC management system and MEC host | |
| CN112948497B (en) | Parallel chain block generation method, computer device, and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20210713 |
|
| WD01 | Invention patent application deemed withdrawn after publication |