System for optimizing concurrent processing of blockchain transactions of game item and optimization method using same
The system optimizes blockchain transaction processing for game items by dynamically adjusting the number of concurrent transactions based on collected data and using dummy transactions to manage load, enhancing processing speed and stability while maintaining data integrity.
Patent Information
- Application Number
- PCT/KR2023/007458
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-05-09
- Filing Date
- 2023-05-31
- Publication Date
- 2024-11-14
AI Technical Summary
Current systems face challenges in optimizing the processing of blockchain transactions for game items, particularly in determining the optimal number of concurrent transactions to ensure both performance and stability, given the varying block creation times in different blockchain networks.
A system that allocates workers based on the determined number of simultaneous transactions, collects transaction processing information, and adjusts the number of concurrent transactions using a method that includes dummy transactions to predict increased transaction loads, thereby optimizing processing speed and preventing delays.
This approach improves overall transaction processing speed, allows for effective adjustment of worker numbers, reduces unnecessary processing adjustments, and ensures that regular transactions are not slowed down by dummy transactions, maintaining data transfer speed and stability.
Smart Images

Figure KR2023007458_14112024_PF_FP_ABST
Abstract
Description
A system for optimizing the simultaneous processing of blockchain transactions for game items and an optimization method utilizing the same.
[0001] The present invention relates to a method for optimizing parallel processing of blockchain transactions of game items.
[0002] Once a transaction is submitted to a blockchain network, a block must ultimately be created. For example, block creation on the Ethereum network takes approximately 10 to 20 seconds, and other networks may have similar, shorter, or longer block creation times.
[0003] Therefore, from a transaction processing perspective, it's advantageous to process multiple transactions simultaneously to improve performance. In other words, the more transactions processed within the same block, the faster processing time can be. However, if the number of transactions exceeds processing capacity, delays can occur for various reasons, such as waiting for additional block generation time, making it difficult to efficiently operate a system that includes transactions.
[0004] In particular, it is crucial to transact game item data on the blockchain at an optimized speed within the game system. Because games require rapid data processing for large volumes of items, finding the optimal speed is crucial. Finding this optimal number of concurrent transactions is crucial for ensuring both performance and stability, but no specific algorithm or optimization method has been developed to address this issue.
[0005] The present invention has been devised to solve the above-mentioned conventional problems, and the purpose of the present invention is to provide a method for optimizing parallel processing of blockchain transactions of game items.
[0006] The system for optimizing the simultaneous processing of blockchain transactions according to the present invention includes a worker operation unit (200) that allocates workers for a determined number of simultaneous transaction processing (n), an input control unit (100) that transmits transaction information for a determined number of simultaneous transaction processing (n) to the workers assigned by the worker operation unit (200), an information collection unit (400) that collects transaction processing information for the transaction information from the workers, and the simultaneous optimization unit (500) that redetermines the number of simultaneous transaction processing (n) based on the received transaction processing information.
[0007] The method for optimizing simultaneous processing of blockchain transactions according to the present invention includes a worker allocation step (S200) in which workers are allocated in a worker operation unit (200) in the number of simultaneous transaction processing (n) determined in a simultaneous optimization unit (500), a transaction processing request step (S300) in which transaction information is transmitted in the number of simultaneous transaction processing (n) determined to the workers allocated in the worker operation unit in the input control unit (100), a transaction processing information collection step (S400) in which transaction processing information for the transaction information is collected from the workers in the information collection unit (400), and a simultaneous processing number adjustment step (S500) in which the number of simultaneous transaction processing (n) is re-determined in the number of simultaneous transaction processing (n) according to the received transaction processing information in the simultaneous optimization unit (500).
[0008] Therefore, according to the present invention,
[0009] First, by calculating the optimal number of parallel transaction processing requests on the current blockchain network, we can improve overall transaction processing speed. This allows for faster processing of game data on the blockchain.
[0010] Second, by applying different methods to reduce and increase the number of concurrent processes, it is possible to find an optimal number of workers that are more effective in a blockchain network.
[0011] Third, dummy transactions are used to predict situations where transactions have already increased, and this is used to increase the number of concurrent processes. Therefore, unnecessary adjustment steps, such as increasing the number of concurrent processes and then quickly decreasing them, can be omitted. This also prevents delays in processing time during optimization.
[0012] Fourth, since dummy transactions are forced to be processed with a lower priority than regular transactions in all situations, the impact of dummy transactions on the processing order and speed of regular transactions can be prevented. This means that even if dummy transactions are used, the actual data transfer speed will not be affected, so optimizations can be performed without affecting the operation speed.
[0013] FIG. 1 is a schematic diagram showing a system for optimizing simultaneous processing of blockchain transactions of game items according to one embodiment of the present invention.
[0014] FIG. 2 is a flowchart illustrating a method for optimizing simultaneous processing of blockchain transactions of game items according to the embodiment of FIG. 1.
[0015] FIG. 3 is a diagram for explaining a round of a method for optimizing simultaneous processing of blockchain transactions of game items according to the embodiment of FIG. 1.
[0016] FIG. 4 is a diagram for explaining information collection of a method for optimizing simultaneous processing of blockchain transactions of game items according to the embodiment of FIG. 1.
[0017] FIG. 5 is a schematic diagram showing a simultaneous optimization unit of a system according to the embodiment of FIG. 1.
[0018] FIG. 6 is a flowchart illustrating part of an optimization method according to the embodiment of FIG. 1.
[0019] FIG. 7 is a flowchart illustrating a method for optimizing simultaneous processing of blockchain transactions of game items according to another embodiment of the present invention.
[0020] FIG. 8 is a diagram for explaining a method for optimizing simultaneous processing of blockchain transactions of game items according to another embodiment of the present invention.
[0021] FIG. 9 is a diagram for explaining a method for optimizing simultaneous processing of blockchain transactions of game items according to the embodiment of FIG. 8.
[0022] FIG. 10 is a diagram for explaining a method for optimizing simultaneous processing of blockchain transactions of game items according to another embodiment of the present invention.
[0023] Hereinafter, preferred embodiments will be described with reference to the attached drawings. In this process, the thickness of lines and the sizes of components depicted in the drawings may be exaggerated for clarity and convenience. Furthermore, the terms described below are defined based on their functions in the present invention and may vary depending on the intent or custom of the user or operator. Therefore, the definitions of these terms should be based on the contents throughout this specification.
[0024] In addition, the following examples are not intended to limit the scope of the present invention, but are merely presented as examples, and there may be various embodiments implemented through the present technical idea.
[0025]
[0026]
[0027]
[0028] A system for moving items in games to the blockchain
[0029]
[0030] FIG. 1 is a schematic diagram showing a system for optimizing simultaneous processing of blockchain transactions of game items according to one embodiment of the present invention.
[0031]
[0032] Referring to FIG. 1, a system (1000) for simultaneous processing optimization of blockchain transactions of game items according to the present embodiment includes an input control unit (100), an operator operation unit (200), an information collection unit (400), and a simultaneous optimization unit (500). Meanwhile, a database unit (10) may exist in a separate system to provide data, and may also be included in the simultaneous processing optimization system (1000) of the present embodiment. In the present embodiment, it is assumed that the database unit (10) exists outside of the game server and the database unit (10) is described as a separate system. However, the simultaneous processing optimization system (1000) may also be implemented together with other software within the game server, in which case the simultaneous processing optimization system (1000) may be implemented including the database unit (10).
[0033]
[0034] First, the input control unit (100) obtains information about game items from the database unit (10) and transmits it to workers. In addition, it transmits the total number of transaction information to the worker control unit (200), thereby providing information for the worker control unit (200) to determine the optimal number of workers.
[0035]
[0036] The worker control unit (200) allocates workers equal to the determined number of concurrent transactions (n). The number of concurrent transactions (n) is the most important factor in the present invention. By adjusting the number of transactions that can be processed simultaneously, optimized work can be performed. The worker control unit (200) allocates the required number of workers, which are allocated from the worker pool (300).
[0037]
[0038] A worker and a worker pool (300) represent individual nodes within a blockchain network. These may be external to the concurrent processing optimization system (1000) of the embodiment of the present invention. The concurrent processing optimization system (1000) may also function as a single node within the blockchain network, but an external node, not the node to which the concurrent processing optimization system belongs, assumes the role of a worker.
[0039]
[0040] The information collection unit (400) collects transaction processing information from workers. It collects various information related to transaction processing and optimizes transaction processing based on this information. The simultaneous optimization unit (500) redefines the number of concurrent transaction processing (n) based on the received transaction processing information. The specific algorithm for this will be described later.
[0041]
[0042] Data stored from the database (10) to the blockchain (900) may be item information used in game software. Game items are often considered crucial assets within the game. Such item information may be stored on the blockchain to ensure data integrity during processes such as creation, acquisition, and ownership transfer. Due to the nature of blockchain technology, block creation takes time, and therefore, unlike a typical server, data is not immediately stored on the blockchain. Therefore, a transaction optimization process is essential to ensure efficiency and stability.
[0043]
[0044]
[0045]
[0046] The process of moving items from a game to the blockchain.
[0047]
[0048] FIG. 2 is a flowchart illustrating a method for optimizing the simultaneous processing of blockchain transactions for game items according to the embodiment of FIG. 1. FIG. 3 is a diagram illustrating a round of a method for optimizing the simultaneous processing of blockchain transactions for game items according to the embodiment of FIG. 1. FIG. 4 is a diagram illustrating information collection for a method for optimizing the simultaneous processing of blockchain transactions for game items according to the embodiment of FIG. 1.
[0049]
[0050]
[0051] Referring to Fig. 2, the optimization method of the present system includes a worker allocation step (S200), a transaction processing request step (S300), a transaction processing information collection step (S400), and a concurrent processing number adjustment step (S500). After the concurrent processing number adjustment step (S500) is completed, the worker allocation step (S200) is repeated. Finally, the worker allocation step (S200), transaction processing request step (S300), transaction processing information collection step (S400), and concurrent processing number adjustment step (S500) are repeatedly processed until all data is processed on the blockchain.
[0052]
[0053]
[0054] (a) Worker allocation step (S200)
[0055]
[0056] First, in the worker allocation step (S200), the worker operation unit (200) allocates workers equal to the number of concurrent transaction processing (n) determined by the concurrent optimization unit (500). As previously described, workers are allocated within the worker pool, and the number of workers may be equal to the number of concurrent transaction processing (n). When a dummy transaction, as described later, is executed, the actual number of workers and the number of general transactions may differ, and this will be described in detail later.
[0057]
[0058] Typically, the number of workers is applied as a natural number. The number of concurrent transactions (n), which is the number of workers, can be set to 32 as an initial value. The minimum value for the number of concurrent transactions (n) can be adjusted from 1 to a maximum of 1024. However, depending on the type of blockchain, the initial, minimum, and maximum values can be flexibly changed and applied, and can be adjusted to various ranges as the transaction process repeats.
[0059]
[0060]
[0061] (b) Transaction processing request step (S300)
[0062]
[0063] In the transaction processing request step (S300), the input control unit (100) transmits transaction information to the workers assigned to the worker operation unit (200) for the determined number of concurrent transaction processing (n). The process of transmitting transaction information to the assigned workers can be understood as a step of broadcasting the occurrence of a transaction in the blockchain process.
[0064]
[0065] Referring to Figures 3 and 4, transaction information is transmitted simultaneously and in parallel in one round. This process of processing transactions equal to the number of concurrent transactions (n) is collectively defined and described as processing one round. A round starts when transactions equal to the number of concurrent transactions (n) begin being requested in parallel, and ends when all transactions are processed. Therefore, the end point is when the processing of the last transaction is completed.
[0066]
[0067] While each transaction begins simultaneously, they do not all end at the same time. Since the blocks of the blockchain they apply to may be completed at different times, transactions may complete at different times. Several transactions may complete at the same time if they are processed in the same block.
[0068]
[0069]
[0070] (c) Transaction processing information collection step (S400)
[0071]
[0072] The transaction processing information collection step (S400) is where the information collection unit (400) collects transaction processing information from workers. This step primarily measures the time at which individual transactions are finally completed, and separately collects the time at which a block is finally formed.
[0073] The information collection unit (400) includes a processing time measurement unit that measures the average processing time (AvgTx) required to complete as many transactions as the number of concurrent transaction processing (n), and a generation time measurement unit that measures the average block generation time (B_t) of transactions.
[0074]
[0075] In the transaction processing information collection step (S400), the information collection unit (400) measures the average processing time (AvgTx) required to complete n requested transactions. As previously explained, since the processing completion time for each transaction may vary, the processing time is calculated as the average of the transaction processing completion times for the number of concurrently processed transactions (n).
[0076]
[0077] Typically, when a transaction is requested for processing, it is submitted to the blockchain network and broadcast to all nodes on the network. Typically, nodes verify the transaction and add it to a candidate block. Workers on the network perform computations to verify the block and add it to the blockchain. Once the block is completed and added to the blockchain, the transaction is considered complete.
[0078]
[0079] Therefore, to measure the time it takes for a transaction to be completed, one can measure the time from when the transaction is broadcast to the blockchain network until it is finally added to the blockchain as a block. This is commonly referred to as the transaction confirmation time.
[0080]
[0081] This confirmation time can vary depending on several factors, including the network's mining difficulty, the number of network nodes, and the transaction volume, and can take a wide range of times. This confirmation time can vary depending on the processing environment, and the present invention determines the optimal number of transaction parallel processing operations based on the changing environment.
[0082]
[0083] Referring back to Figure 4, the round end point can be identified, which is the point from when a transaction is requested to when the final transaction is processed. As shown in the figure, five transactions were performed, with the first transaction completing first and the fifth transaction completing last, marking the end point of one round.
[0084]
[0085] The average processing time (AvgTx) is measured as the average of the confirmation times of the first to fifth transactions, as shown in the drawing.
[0086]
[0087] Meanwhile, the information collection unit (400) measures the average block generation time (B_t) of transactions. First, generation time information is obtained for blocks created within a specific time range or number range based on the blockchain network. The generation time is calculated by obtaining timestamp information generated within the block.
[0088]
[0089] As mentioned, the creation times of all blocks within a time range or count range are obtained based on a specific reference time, and this is used to calculate the average block creation time (B_t). The average block creation time (B_t) is compared with the previously calculated average processing time (AvgTx) and used as a criterion for determining the increase or decrease in the number of concurrent transaction processing (n) during parallel processing.
[0090]
[0091]
[0092] (d) Simultaneous processing water adjustment step (S500)
[0093]
[0094] Fig. 5 is a schematic diagram showing a simultaneous optimization unit of the system according to the embodiment of Fig. 1. Fig. 6 is a flowchart showing part of an optimization method according to the embodiment of Fig. 1.
[0095]
[0096] Referring to FIG. 5, the concurrent optimization unit (500) includes a concurrent processing number reduction unit (510) that reduces the number of concurrent transaction processing (n) when the average processing time (AvgTx) is greater than the average block generation time (B_t), and a concurrent processing number increase unit (S520) that increases the number of concurrent transaction processing (n) when the average processing time (AvgTx) is less than the average block generation time (B_t).
[0097]
[0098] The concurrent processing number reduction unit (510) includes a ratio reduction unit (511) that reduces the number of concurrent transactions (n) by a ratio of the average processing time (AvgTx) to the average block generation time (B_t), a designated reduction unit (512) that reduces the number of concurrent transactions (n) by a designated reduction value (reduce_Interval) from the existing value when the reduced number of concurrent transactions (n) in the ratio reduction step (S511) is the same as the immediately preceding number of concurrent transactions (n), and a minimum correction unit (513) that returns the number of concurrent transactions (n) to 1 when the reduced number of concurrent transactions (n) is less than 1.
[0099]
[0100] Meanwhile, the concurrent processing number increasing unit (520) includes a ratio increasing unit (521) that increases the concurrent transaction processing number (n) by an increase rate (increase_ration) and a designated increasing unit (522) that increases the concurrent transaction processing number (n) by a designated increase value (increase_interval) when the n value before increasing is less than a designated minimum range (increase_min_range).
[0101]
[0102] The specific operation is described with reference to Fig. 6. The simultaneous processing number adjustment step (S500) redetermines the number of simultaneous transaction processing (n) in accordance with the received transaction processing information in the simultaneous optimization unit (500).
[0103]
[0104]
[0105] (d-1) Step to reduce the number of simultaneous processes (S510)
[0106]
[0107] Referring to FIG. 6, the concurrent processing number reduction step (S510) includes a ratio reduction step (S511), a designated reduction step (S512), and a minimum correction step (S513). The concurrent processing number reduction step (S510) reduces the number of concurrent transactions (n) in the concurrent optimization unit (500) when the average processing time (AvgTx) is greater than the average block generation time (B_t). When the average processing time (AvgTx) is greater than the average block generation time (B_t), the blockchain network has received requests that exceed its processing capacity. Therefore, the number of concurrent processes is reduced.
[0108]
[0109] The ratio reduction step (S511) reduces the number of concurrently processed transactions (n) by the ratio of the average processing time (AvgTx) to the average block generation time (B_t). This can be expressed as a formula as follows.
[0110]
[0111] [Mathematical Formula 1]
[0112] n' ≒ n * B_t / AvgTx
[0113] (where n and n' are integers)
[0114]
[0115] In addition, in the ratio reduction step (S511), if the reduced n value is the same as the number of concurrent transactions (n) immediately before the reduction, that is, if it is reduced by the ratio, there may be a case where there is no change in the number of concurrent transactions (n). In this case, a designated reduction step (S312) is added to compensate for this after the ratio reduction step (S311), and in the designated reduction step (S312), the number of concurrent transactions (n) is reduced by the designated reduction value (reduce_Interval). This reduction value (reduce_Interval) may be 1. If the number of concurrent transactions (n) is no longer reduced in the ratio reduction step (S311), the number of concurrent transactions (n) may be reduced by 1 per round.
[0116]
[0117] [Equation 2]
[0118] n' = n - reduce_Interval
[0119] (where n' and n are integers)
[0120]
[0121]
[0122] Meanwhile, in the step of reducing the number of concurrent processing steps (S510), if the number of concurrent processing transactions (n) is less than a specified minimum value (min_Value), a minimum correction step (S513) is included to return the number of concurrent processing transactions (n) to the specified minimum value. The specified minimum value may be 1.
[0123]
[0124] [Equation 3]
[0125] n' = n - reduce_Interval
[0126] (where n' is an integer, n'>min_Value)
[0127]
[0128]
[0129] (d-2) Step to increase the number of simultaneous processes (S520)
[0130]
[0131] Referring back to FIG. 6, the concurrent processing number increasing step (S520) includes a ratio increasing step (S521) and a designated increasing step (S522). In the concurrent processing number increasing step (S520), the concurrent optimization unit (500) increases the number of concurrent transactions (n) if the average processing time (AvgTx) is less than the average block generation time (B_t). If the average processing time (AvgTx) is less than the average block generation time (B_t), the blockchain network has room to utilize additional processing power. Therefore, the number of concurrent processes is increased.
[0132]
[0133] In the ratio increase step (S521), the number of concurrent transactions (n) is increased by the increase ratio (increase_ratio). At this time, the increase ratio can use a pre-defined value. For example, the increase ratio can be 0.1. This can be expressed in a formula as follows.
[0134]
[0135] [Equation 4]
[0136] n' = n + n * increase_ratio
[0137] (where n' and n are integers)
[0138]
[0139]
[0140] Meanwhile, in the designated increase step (S522), the n value is increased by the designated increase value (increase_interval). In particular, the designated increase step (S522) may have a condition that is applied when the number of concurrent transactions (n) before the increase is less than the designated minimum range (increase_min_range).
[0141]
[0142] The specified increment value (increase_interval) can use a previously specified value, for example, 1. Meanwhile, the specified minimum range (increase_min_range) can be 10. Therefore, if the number of concurrent transactions (n) is less than 10, the number of concurrent transactions (n) is increased by the specified increment value. This can be expressed as a formula as follows.
[0143]
[0144] [Equation 5]
[0145] n' = n + increase_interval
[0146] (where n', n are integers, n < increase_min_range)
[0147]
[0148] As a result, the methods for decreasing and increasing the number of concurrent transactions (n) must be applied in different ways, and since the maximum processing capacity of the network cannot be known when increasing, optimization is performed by gradually increasing rather than decreasing.
[0149]
[0150]
[0151]
[0152] Initial startup process
[0153]
[0154] FIG. 7 is a flowchart illustrating a method for optimizing simultaneous processing of blockchain transactions of game items according to another embodiment of the present invention.
[0155]
[0156] Referring to FIG. 7, although not shown in FIG. 2, an initialization process for executing a method for optimizing the simultaneous processing of blockchain transactions for game items is included. This process includes a transaction information acquisition and transmission step (S110) and a total transaction processing count transmission step (S150).
[0157]
[0158] The transaction information acquisition and transmission step (S110) is a step prior to the worker allocation step (S200) in which at least one transaction piece of information is acquired from the database unit (10) and transmitted to the input control unit (100). This is a process that informs the system of how much item data will be transmitted when the process of initially transmitting item information from the database to the blockchain begins.
[0159]
[0160] Meanwhile, the total transaction processing count transmission step (S150) is a step in which, after the transaction information acquisition and transmission step (S110), the input control unit (100) receives transaction information and transmits information about the number of transaction information to the worker operation unit (200). By transmitting the total number of received processing to the worker operation unit (200), the number of workers to be initially allocated can be determined.
[0161]
[0162] For example, if the initial setting for the number of concurrent transactions (n) is 32, the optimization system may not need to operate if the number of item information is less than 32. To determine these initial conditions, the total number of data items is first transmitted.
[0163]
[0164]
[0165]
[0166] Example of a dummy transaction
[0167]
[0168] FIG. 8 is a diagram illustrating a method for optimizing the simultaneous processing of blockchain transactions for game items according to another embodiment of the present invention. FIG. 9 is a diagram illustrating a method for optimizing the simultaneous processing of blockchain transactions for game items according to the embodiment of FIG. 8.
[0169]
[0170] The transaction processing request step (S300) may include a general transaction processing request step for requesting processing of a general transaction and a dummy transaction processing request step for requesting processing of a dummy transaction. The worker operation unit (200) additionally allocates workers in addition to the determined number of concurrent transaction processing (n), and the input control unit (100) transmits information on the general transactions of the determined number of concurrent transaction processing (n) and the added number of dummy transactions to the assigned workers.
[0171]
[0172] The general transaction processing request step processes a processing request for a transaction that requires actual processing, and the dummy transaction processing request step processes a processing request by creating a target with fictitious data that does not require processing.
[0173]
[0174] In this embodiment, by utilizing these dummy transactions, the number of transactions processed in parallel, i.e., the number of concurrent transactions (n), can be more precisely controlled. While a typical transaction parallel request is processed at the number of concurrent transactions (n), dummy transactions are added and processed outside the specified number of concurrent transactions (n). Therefore, in rounds where dummy transactions are requested, a larger number of transactions are processed in parallel than the specified number of concurrent transactions (n).
[0175]
[0176] Additionally, these dummy transactions are processed non-sequentially in response to processing requests from general transactions, and no distinction is made between dummy transactions and general transactions when requesting parallel processing of the entire transaction.
[0177]
[0178] Meanwhile, referring to FIG. 8, while the dummy transaction is not applied in every round, and the general transaction processing request step is performed in every round, the dummy transaction processing request step is executed discontinuously, i.e., is not performed in every round.
[0179]
[0180] This is because, when carried out in every round, it not only adds load to the blockchain network, but also allows for more precise control when determining whether to increase the number of concurrent transaction processing (n) compared to rounds where only general transactions are carried out.
[0181]
[0182] The cycle of these rounds can have a specified interval (round_interval). For example, an additional dummy transaction processing request step may be performed every five rounds. Furthermore, the specified interval can be controlled to increase or decrease depending on the state of the blockchain network.
[0183]
[0184]
[0185]
[0186] FIG. 9 is a drawing for explaining a transaction processing information collection step (S400) among the methods for optimizing simultaneous processing of blockchain transactions of game items according to the embodiment of FIG. 8.
[0187]
[0188] In the transaction processing request step (S300), when the dummy transaction processing request step is performed, the average processing time (AvgTx) measured in the transaction processing information collection step (S400) is calculated including the processing times of both general transactions and dummy transactions.
[0189]
[0190] Referring to Figure 9, the average processing time (AvgTx') including the dummy transaction, which is the sixth transaction, is calculated.
[0191]
[0192] In addition, in order to be applied to the step of increasing the number of concurrent processing (S520), the condition that the average processing time (AvgTx) of the previous round in which the dummy transaction processing request step is not performed must be smaller than the average block generation time (B_t) must be satisfied, and at the same time, the condition that the average processing time (AvgTx') of the current round in which the dummy transaction processing request step is performed must be smaller than the average block generation time (B_t) must be satisfied.
[0193]
[0194] Therefore, the number of concurrent transactions is increased only if both the average processing time of a round without dummy transactions (AvgTx) and the average processing time of a round with dummy transactions (AvgTx') are less than the average block generation time (B_t).
[0195]
[0196] Compared to determining whether to increase through general transactions like this, when comparing with a round that adds dummy transactions, the number of concurrent processes is increased in a round that only contains pure general transactions, and then when the number of transactions increases as a result, the average block generation time (B_t) is exceeded, and as a result, the number of concurrent processes is reduced again, etc., meaningless optimization processes can be reduced, and unnecessary fluctuations in the number of concurrent transactions (n) can be prevented.
[0197]
[0198]
[0199]
[0200] Additional examples of dummy transactions
[0201]
[0202] FIG. 10 is a diagram for explaining a method for optimizing simultaneous processing of blockchain transactions of game items according to another embodiment of the present invention.
[0203]
[0204] Referring to Figure 10, in a round where both regular and dummy transactions are executed, the dummy transaction request is initiated after all regular transaction requests have been completed. This limits the dummy transaction request start time to after all regular transactions have been completed, thereby ensuring that regular transactions are always processed within blocks preceding dummy transactions.
[0205]
[0206] This effectively prevents the processing time of regular transactions from increasing due to the addition of dummy transactions. While regular transactions do not have a priority, priority is intentionally assigned between regular and dummy transactions, ensuring that regular transactions always take precedence in the processing order within a block.
[0207]
[0208] As a result, the delay in block creation due to dummy transactions is not affected by general transactions, and adding dummy transactions to explore increment conditions can be done without affecting the overall data processing.
[0209]
[0210] As a result, as the number of transactions increases and transactions must be processed from one block to another, the average processing time (AvgTx) increases stepwise rather than gradually. In fact, if the request order of dummy transactions that do not need to be processed is always placed after regular transactions, regular transactions and dummy transactions can be processed within the same block, or only regular transactions can be processed within the preceding block, and dummy transactions can be processed in the subsequent block.
[0211]
[0212] Conversely, dummy transactions do not have priority over regular transactions in all situations, so they cannot be processed in blocks preceding those in which regular transactions are processed. Therefore, they offer the advantage of being able to test situations where the number of concurrent transactions increases without affecting the processing speed of actual transactions.
[0213]
[0214] The above-described embodiment of the present invention is merely exemplary, and those skilled in the art will readily appreciate that various modifications and equivalent other embodiments are possible. Therefore, it will be readily understood that the present invention is not limited to the forms mentioned in the detailed description above. Accordingly, the true technical protection scope of the present invention should be defined by the technical spirit of the appended claims. Furthermore, the present invention should be understood to include all modifications, equivalents, and alternatives within the spirit and scope of the present invention as defined by the appended claims.
[0215] The present invention has been devised to solve the above-mentioned conventional problems, and the purpose of the present invention is to provide a method for optimizing parallel processing of blockchain transactions of game items.
Claims
1. A worker control unit (200) that allocates workers to the number of concurrent transactions (n) determined; An input control unit (100) that transmits transaction information to the workers assigned in the worker operation unit (200) as many times as the number of concurrent transaction processing (n) determined; An information collection unit (400) that collects transaction processing information for the transaction information from the workers; and A system for optimizing simultaneous processing of blockchain transactions, including the simultaneous optimization unit (500) that re-determines the number of simultaneous transaction processing (n) according to the received transaction processing information.
2. In paragraph 1, A system for optimizing simultaneous processing of blockchain transactions, further comprising a database unit (10) that acquires at least one or more transaction information and transmits it to the input control unit (100).
3. In paragraph 1, A system for optimizing simultaneous processing of blockchain transactions, characterized in that the input control unit (100) receives the transaction information and transmits information about the number of transaction information to the operator operation unit (200).
4. In paragraph 1, A system for optimizing simultaneous processing of blockchain transactions, characterized in that the above transaction information is item information used in game software.
5. In paragraph 1, The above information collection unit (400) A processing time measuring unit that measures the average processing time (AvgTx) required to complete as many transactions as the number of concurrent transaction processing (n); and A system for optimizing simultaneous processing of blockchain transactions, characterized in that it includes a generation time measuring unit that measures the average block generation time (B_t) of the above transactions.
6. In paragraph 1, The above simultaneous optimization unit (500) is If the average processing time (AvgTx) is greater than the average block generation time (B_t), a concurrent processing number reduction unit (510) that reduces the number of concurrent transaction processing (n); and In the above simultaneous optimization unit (500), if the average processing time (AvgTx) is less than the average block generation time (B_t), a simultaneous processing number increasing unit (S520) that increases the number of simultaneous transaction processing (n); A system for optimizing simultaneous processing of blockchain transactions, characterized by including:
7. In paragraph 6, The above simultaneous processing number reduction unit (510) A ratio reduction unit (511) that reduces the number of concurrent transaction processing (n) by the ratio of the average processing time (AvgTx) to the average block generation time (B_t); If the number of concurrent transactions (n) reduced in the above ratio reduction step (S511) is the same as the number of concurrent transactions (n) immediately before, a designated reduction unit (512) that reduces the number of concurrent transactions (n) from the existing value by a designated reduction value (reduce_Interval); and A system for optimizing the simultaneous processing of blockchain transactions, characterized in that it includes a minimum correction unit (513) that returns the simultaneous processing number of transactions (n) to 1 when the reduced number of simultaneous processing of transactions (n) is less than 1.
8. In paragraph 6, The above simultaneous processing number increase unit (520) A ratio increasing unit (521) that increases the number of concurrent transactions (n) by an increase ratio (increase_ration); and A system for optimizing simultaneous processing of blockchain transactions, characterized in that it includes a designated increase unit (522) that increases the number of simultaneous transaction processing (n) by a designated increase value (increase_interval) when the above n value is less than a designated minimum range (increase_min_range) before being increased.
9. In paragraph 1, The above worker operation unit (200) additionally allocates workers in addition to the determined number of simultaneous transaction processing (n), A system for optimizing simultaneous processing of blockchain transactions, characterized in that the input control unit (100) transmits general transaction information of the determined number of simultaneous transaction processing (n) and an added number of dummy transactions to the assigned workers.
10. In paragraph 9, The above simultaneous processing number increase unit (520) A condition in which the average processing time (AvgTx) of the previous round in which the dummy transaction processing request step (S302) is not performed is less than the average block generation time (B_t); and A system for optimizing the simultaneous processing of blockchain transactions, characterized in that the number of simultaneous transaction processing (n) is increased when all conditions are satisfied: the average processing time (AvgTx) of the current round in which the dummy transaction processing request step (S302) is performed is smaller than the average block generation time (B_t).
11. In the worker operation unit (200), a worker allocation step (S200) for allocating workers as many times as the number of concurrent transaction processing (n) determined in the concurrent optimization unit (500); In the input control unit (100), a transaction processing request step (S300) for transmitting transaction information to the workers assigned in the worker operation unit as many times as the number of simultaneous transaction processing (n) determined; In the information collection unit (400), a transaction processing information collection step (S400) for collecting transaction processing information for the transaction information from the workers; and A method for optimizing simultaneous processing of a blockchain transaction, comprising a simultaneous processing number adjustment step (S500) for re-determining the number of simultaneous transaction processing (n) according to the received transaction processing information in the simultaneous optimization unit (500).
12. In paragraph 11, Before the above worker allocation step (S200), A method for optimizing simultaneous processing of blockchain transactions, further comprising a transaction information acquisition and transmission step (S110) of acquiring at least one or more transaction information from a database unit (10) and transmitting it to the input control unit (100).
13. In paragraph 12, After the above transaction information acquisition and transmission step (S110), A method for optimizing simultaneous processing of blockchain transactions, further comprising a step (S150) of transmitting the total number of transactions processed, which receives the transaction information from the input control unit (100) and transmits information about the number of transaction information to the operator operation unit (200).
14. In paragraph 11, A method for optimizing simultaneous processing of blockchain transactions, characterized in that the above transaction information is item information used in game software.
15. In paragraph 11, The above transaction processing information collection step (S400) is In the above information collection unit (400), a processing time measurement step (S410) for measuring the average processing time (AvgTx) for completing transactions equal to the number of concurrent transaction processing (n); and A method for optimizing simultaneous processing of blockchain transactions, characterized in that it includes a generation time measurement step (S420) for measuring the average block generation time (B_t) of the transaction in the information collection unit (400).
16. In paragraph 11, The above simultaneous processing number adjustment step (S500) is In the above simultaneous optimization unit (500), if the average processing time (AvgTx) is greater than the average block generation time (B_t), a simultaneous processing number reduction step (S510) for reducing the number of simultaneous transaction processing (n); In the above simultaneous optimization unit (500), if the average processing time (AvgTx) is less than the average block generation time (B_t), a simultaneous processing number increasing step (S520) for increasing the number of simultaneous transaction processing (n); A method for optimizing simultaneous processing of blockchain transactions, characterized in that it includes:
17. In paragraph 16, The above simultaneous processing number reduction step (S510) A ratio reduction step (S511) for reducing the number of concurrent transaction processing (n) by the ratio of the average processing time (AvgTx) to the average block generation time (B_t); If the number of concurrent transactions (n) reduced in the above ratio reduction step (S511) is the same as the number of concurrent transactions (n) immediately before, a designated reduction step (S512) for reducing the number of concurrent transactions (n) from the existing value by a designated reduction value (reduce_Interval); and A method for optimizing simultaneous processing of blockchain transactions, characterized in that it includes a minimum correction step (S513) for returning the simultaneous processing number of transactions (n) to 1 when the reduced number of simultaneous processing of transactions (n) is less than 1.
18. In paragraph 16, The step of increasing the number of simultaneous processing (S520) above A ratio increasing step (S521) for increasing the number of concurrent transactions (n) by an increase ratio (increase_ration); and A method for optimizing simultaneous processing of blockchain transactions, characterized in that it includes a designated increase step (S522) for increasing the number of simultaneous transaction processing (n) by a designated increase value (increase_interval) when the above n value is less than a designated minimum range (increase_min_range) before being increased.
19. In paragraph 11, The above transaction processing request step (S300) is A general transaction processing request step that requests processing of a general transaction; and A method for optimizing simultaneous processing of blockchain transactions, characterized in that it includes a dummy transaction processing request step for requesting processing of a dummy transaction.
20. In paragraph 19, In the above transaction processing request step (S300), when the dummy transaction processing request step is performed, The step of increasing the number of simultaneous processing (S520) is A condition in which the average processing time (AvgTx) of the previous round in which the dummy transaction processing request step is not performed is less than the average block generation time (B_t); and A method for optimizing simultaneous processing of blockchain transactions, characterized in that the number of simultaneous transaction processing (n) is increased when all conditions are satisfied: the average processing time (AvgTx) of the current round in which the dummy transaction processing request step is performed is smaller than the average block generation time (B_t).
21. In paragraph 18, In the above transaction processing request step (S300), A method for optimizing simultaneous processing of blockchain transactions, characterized in that the above dummy transaction processing request step is performed after the above general transaction processing request step is completed.
Citation Information
Patent Citations
Transaction packaging automatic adjustment system and method based on consensus time and medium
CN114897614A
Mobile electronic device having multi-camera modules
KR1020220020457A
Robot equipped with a mechanism to reduce vibrations while driving
KR1020230144910A
Composition for water purification, manufacturing method thereof, and water purification method using the same
KR1020240061017A
KR20220071699A
