CN111400043A - Transaction pool management method, device and storage medium - Google Patents
Transaction pool management method, device and storage medium Download PDFInfo
- Publication number
- CN111400043A CN111400043A CN202010176354.7A CN202010176354A CN111400043A CN 111400043 A CN111400043 A CN 111400043A CN 202010176354 A CN202010176354 A CN 202010176354A CN 111400043 A CN111400043 A CN 111400043A
- Authority
- CN
- China
- Prior art keywords
- transaction
- capacity
- occupied
- transactions
- pool
- 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
- 238000007726 management method Methods 0.000 title claims abstract description 12
- 238000000034 method Methods 0.000 claims abstract description 20
- 238000004590 computer program Methods 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 230000007812 deficiency Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000004065 semiconductor 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/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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Abstract
The invention provides a transaction pool management method, equipment and a storage medium, wherein the method comprises the following steps: receiving a first transaction; judging whether the sum of the total capacity occupied by all the transactions in the transaction pool and the first capacity required for storing the first transaction is smaller than the total capacity of the transaction pool: if yes, determining a first classification of the first transaction, and judging whether the sum of the second capacity occupied by each transaction of the first classification and the first capacity is larger than a first capacity threshold value which can be occupied by the first classification: and if not, storing the first transaction into a transaction pool. This application is taken into account all kinds of transactions on the block chain are not blocked.
Description
Technical Field
The application relates to the technical field of block chains and the like, in particular to a transaction pool management method, equipment and a storage medium.
Background
In the case of a block chain with high load, due to a transaction discarding mechanism of the transaction pool (especially, a transaction pool in a time sequence), a dapp with a special fire can preempt all transaction pool resources of the block chain, so that the transactions of other dapps will be blocked.
Disclosure of Invention
In view of the above-mentioned drawbacks and deficiencies of the prior art, it is desirable to provide a transaction pool management method, apparatus, and storage medium that allow for various types of transactions on a blockchain to be unblocked.
In a first aspect, the present invention provides a method, an apparatus, and a storage medium for managing a transaction pool applicable to a blockchain node, where the blockchain node is configured with a capacity threshold that can be occupied by transactions of each category in the transaction pool, where the method includes:
receiving a first transaction;
judging whether the sum of the total capacity occupied by all the transactions in the transaction pool and the first capacity required for storing the first transaction is smaller than the total capacity of the transaction pool:
if yes, determining a first classification of the first transaction, and judging whether the sum of the second capacity occupied by each transaction of the first classification and the first capacity is larger than a first capacity threshold value which can be occupied by the first classification:
and if not, storing the first transaction into a transaction pool.
In a second 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 transaction pool management method provided according to embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute the transaction pool management method provided according to the embodiments of the present invention.
The transaction pool management method, the device and the storage medium provided by the embodiments of the invention receive a first transaction; judging whether the sum of the total capacity occupied by all the transactions in the transaction pool and the first capacity required for storing the first transaction is smaller than the total capacity of the transaction pool: if yes, determining a first classification of the first transaction, and judging whether the sum of the second capacity occupied by each transaction of the first classification and the first capacity is larger than a first capacity threshold value which can be occupied by the first classification: and if not, storing the first transaction into a transaction pool, and considering that various transactions on the block chain are not blocked.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a transaction pool management method according to an embodiment of the present invention.
Fig. 2 is a flowchart of step S142 in a preferred embodiment of the method shown in fig. 1.
Fig. 3 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a flowchart of a transaction pool management method according to an embodiment of the present invention. As shown in fig. 1, in the present embodiment,
the invention provides a transaction pool management method, equipment and a storage medium suitable for block chain nodes, wherein the block chain nodes are configured with capacity thresholds which can be occupied by all classified transactions in the transaction pool, and the method comprises the following steps:
s12: receiving a first transaction;
s141: judging whether the sum of the total capacity occupied by all the transactions in the transaction pool and the first capacity required for storing the first transaction is smaller than the total capacity of the transaction pool:
if yes, go to step S142: determining a first classification of the first transaction, and judging whether the sum of a second capacity occupied by each transaction of the first classification and the first capacity is larger than a first capacity threshold value which can be occupied by the first classification:
otherwise, step S143 is executed: the first transaction is deposited into a transaction pool.
Specifically, assuming that the total capacity of the transaction pool is 10000kb, there are 3 classified transactions: a transaction for the main chain, a transaction for dapp1, a transaction for dapp 2; the transaction occupiable capacity threshold for the main chain is 6000kb, the transaction occupiable capacity threshold for dapp1 is 3000kb, and the transaction occupiable capacity threshold for dapp2 is 1000 kb; the capacity occupied by the transaction of the current main chain is 5950kb, the capacity occupied by the transaction of dapp1 is 2800kb, and the capacity occupied by the transaction of dapp2 is 900 kb; discarding the first transaction when the sum of the total capacity occupied by all transactions in the transaction pool and the first capacity required for storing the first transaction is not less than the total capacity of the transaction pool; discarding the first transaction when the sum of the second capacity and the first capacity is greater than a first categorically preconfigured capacity threshold;
assume that the first transaction tx1 is a backbone transaction and the first capacity required to store tx1 is 30 kb;
the node performs step S12, receiving tx 1;
the node executes step S141: judging whether the sum of the total capacity occupied by all the transactions in the transaction pool and the first capacity required for storing the first transaction is smaller than the total capacity of the transaction pool:
since 5950+2800+900+30 is 9680, 9680kb <10000kb, step S142 is performed: determining a first classification of the first transaction, and judging whether the sum of a second capacity occupied by each transaction of the first classification and the first capacity is larger than a first capacity threshold value which can be occupied by the first classification:
since tx1 is the transaction of the main chain, the second capacity occupied by the transaction of the main chain is 5950kb, (5950+30) kb is less than 6000kb, then step S143 is executed: tx1 is deposited into the transaction pool.
Assume that the first transaction tx1 is a backbone transaction and the first capacity required to store tx1 is 80 kb;
the node performs step S12, receiving tx 1;
the node executes step S141: judging whether the sum of the total capacity occupied by all the transactions in the transaction pool and the first capacity required for storing the first transaction is smaller than the total capacity of the transaction pool:
since 5950+2800+900+80 is 9730, 9730kb <10000kb, step S142 is executed: determining a first classification of the first transaction, and judging whether the sum of a second capacity occupied by each transaction of the first classification and the first capacity is larger than a first capacity threshold value which can be occupied by the first classification:
since tx1 is the transaction for the backbone, the second capacity occupied by the transaction for the backbone is 5950kb, (5950+80) kb greater than 6000kb, and tx1 is discarded. In further embodiments, the processing policy of the first transaction when the sum of the second capacity and the first capacity is greater than the capacity threshold preconfigured by the first category may also be configured according to the actual demand, for example, configured to delete the top several transactions in the list of the first category and store the first transaction in the transaction pool, and the same technical effect may be achieved, and the capacity required for storing several transactions here should be not less than the first capacity.
Assume that the first transaction tx1 is a backbone transaction and the first capacity required to store tx1 is 400 kb;
the node performs step S12, receiving tx 1;
the node executes step S141: judging whether the sum of the total capacity occupied by all the transactions in the transaction pool and the first capacity required for storing the first transaction is smaller than the total capacity of the transaction pool:
as 5950+2800+900+400 is 10050, and 10050kb is not less than 10000kb, tx1 is discarded. In further embodiments, the processing policy of the first transaction when the sum of the total capacity occupied by all transactions in the transaction pool and the first capacity required for storing the first transaction is not less than the total capacity of the transaction pool may also be configured according to actual requirements, for example, configured to delete the top transactions in the list of the first category and store the first transaction in the transaction pool, which may achieve the same technical effect, and the capacity required for storing the number of transactions here should be not less than the first capacity.
The above example assumes a total transaction pool capacity of 10000kb for a total of 3 classified transactions: a transaction for the main chain, a transaction for dapp1, a transaction for dapp 2; the transaction occupiable capacity threshold for the main chain is 6000kb, the transaction occupiable capacity threshold for dapp1 is 3000kb, and the transaction occupiable capacity threshold for dapp2 is 1000 kb; the capacity occupied by the transaction of the current main chain is 5950kb, the capacity occupied by the transaction of dapp1 is 2800kb, and the capacity occupied by the transaction of dapp2 is 900 kb; discarding the first transaction when the sum of the total capacity occupied by all transactions in the transaction pool and the first capacity required for storing the first transaction is not less than the total capacity of the transaction pool; the example is illustratively described as discarding the first transaction when the sum of the second capacity and the first capacity is greater than a first categorically preconfigured capacity threshold. In further embodiments, the threshold of the capacity that can be occupied by different category transactions can be configured according to actual needs, for example, also 3 category transactions: if the main-chain transaction, the dapp1 transaction and the dapp2 are guaranteed preferentially, the available capacity threshold of the main-chain transaction can be increased according to actual requirements, for example, the available capacity threshold is configured to 7000kb, and the same technical effect can be achieved. In addition, considering that the transactions of different classifications can not use up the occupied capacity threshold, the sum of the occupied capacity thresholds of various classification transactions can be configured to exceed the total capacity of 10000kb in practice, the storage capacity can be occupied by the previous transactions, and the transactions are adjusted and replaced only when the capacity threshold of the corresponding classification is exceeded, so that the utilization of resources is facilitated.
The embodiment gives consideration to the fact that various transactions on the block chain are not blocked, and improves user experience.
Fig. 2 is a flowchart of step S142 in a preferred embodiment of the method shown in fig. 1. As shown in fig. 2, in a preferred embodiment, step S142 includes:
s1421: judging whether the sum of the total capacity occupied by all transactions in the transaction pool and the first capacity is not more than a pre-configured first numerical value:
if yes, go to step S1422: storing the first transaction in a transaction pool;
otherwise, go to step S1423: and determining a first classification of the first transaction, and judging whether the sum of the second capacity occupied by each transaction of the first classification and the first capacity is greater than a first capacity threshold value which can be occupied by the first classification.
The more transactions in the transaction pool, the more transactions that represent possible packing into a block, the larger the block represents, and the more bandwidth is consumed by the block for broadcasting. The node removes the broadcast block and otherwise consumes bandwidth (e.g., broadcast transactions). Therefore, the bandwidth consumed by the broadcast block can be reduced by configuring the first threshold according to the actual demand, for example, configured to be 80% of the total capacity of the transaction pool.
The embodiment reduces the possibility of network congestion and further improves the user experience under the condition that various transactions on the block chain are not blocked.
Fig. 3 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 3, as another aspect, the present application also provides an apparatus 300 including one or more Central Processing Units (CPUs) 301 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)302 or a program loaded from a storage section 308 into a Random Access Memory (RAM) 303. In the RAM303, various programs and data necessary for the operation of the apparatus 300 are also stored. The CPU301, ROM302, and RAM303 are connected to each other via a bus 304. An input/output (I/O) interface 305 is also connected to bus 304.
To the I/O interface 305, AN input section 306 including a keyboard, a mouse, and the like, AN output section 307 including a network interface card such as a Cathode Ray Tube (CRT), a liquid crystal display (L CD), and the like, a speaker, and the like, a storage section 308 including a hard disk, and the like, and a communication section 309 including a network interface card such as a L AN card, a modem, and the like, the communication section 309 performs communication processing via a network such as the internet, a drive 310 is also connected to the I/O interface 305 as necessary, a removable medium 311 such as a magnetic disk, AN optical disk, a magneto-optical disk, a semiconductor memory, and the like is mounted on the drive 310 as necessary, so that a computer program read out therefrom is mounted into the storage section 308 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 309, and/or installed from the removable medium 311.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the 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 unit 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 (8)
1. A transaction pool management method is characterized in that a block chain node is configured with a capacity threshold value which can be occupied by each classified transaction in a transaction pool, the method is suitable for the block chain node, and the method comprises the following steps:
receiving a first transaction;
judging whether the sum of the total capacity occupied by all the transactions in the transaction pool and the first capacity required for storing the first transaction is less than the total capacity of the transaction pool:
if yes, determining a first classification of the first transaction, and judging whether the sum of a second capacity occupied by each transaction of the first classification and the first capacity is larger than a first capacity threshold value which can be occupied by the first classification:
and if not, storing the first transaction into the transaction pool.
2. The method of claim 1, wherein the determining the first classification of the first transaction comprises:
judging whether the sum of the total capacity occupied by all transactions in the transaction pool and the first capacity is not more than a pre-configured first numerical value:
if yes, storing the first transaction into the transaction pool;
otherwise, determining a first classification of the first transaction.
3. The method of claim 1, further comprising:
discarding the first transaction when the sum of the total capacity occupied by all transactions in the transaction pool and the first capacity required for storing the first transaction is not less than the total capacity of the transaction pool.
4. The method of claim 1, further comprising:
and when the sum of the total capacity occupied by all the transactions in the transaction pool and the first capacity required for storing the first transaction is not less than the total capacity of the transaction pool, deleting a plurality of most front transactions in the first classified list, and storing the first transaction in the transaction pool.
5. The method of claim 1, further comprising:
discarding the first transaction when a sum of the second capacity and the first capacity is greater than the first categorized preconfigured capacity threshold.
6. The method of claim 1, further comprising:
and when the sum of the second capacity and the first capacity is larger than the capacity threshold value pre-configured in the first classification, deleting the first transactions in the list of the first classification, and storing the first transactions in the transaction pool.
7. An apparatus, characterized in that the apparatus comprises:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-6.
8. 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-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010176354.7A CN111400043A (en) | 2020-03-13 | 2020-03-13 | Transaction pool management method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010176354.7A CN111400043A (en) | 2020-03-13 | 2020-03-13 | Transaction pool management method, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111400043A true CN111400043A (en) | 2020-07-10 |
Family
ID=71434423
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010176354.7A Pending CN111400043A (en) | 2020-03-13 | 2020-03-13 | Transaction pool management method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111400043A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112988413A (en) * | 2021-02-07 | 2021-06-18 | 杭州复杂美科技有限公司 | Trade batch broadcasting dynamic adjustment method, computer equipment and storage medium |
| CN113132253A (en) * | 2021-03-29 | 2021-07-16 | 杭州趣链科技有限公司 | Bandwidth current limiting method and electronic equipment |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107819696A (en) * | 2017-11-22 | 2018-03-20 | 中国银行股份有限公司 | A kind of transaction flow control method and system |
| US20180189333A1 (en) * | 2017-01-03 | 2018-07-05 | International Business Machines Corporation | Limiting blockchain size to optimize performance |
| CN109801070A (en) * | 2019-01-12 | 2019-05-24 | 杭州复杂美科技有限公司 | Transaction queuing strategy, equipment and storage medium |
| CN109995666A (en) * | 2019-04-12 | 2019-07-09 | 深圳市元征科技股份有限公司 | A kind of method for message transmission and relevant apparatus |
| CN110060161A (en) * | 2019-03-28 | 2019-07-26 | 众安信息技术服务有限公司 | It trades anti-heavy client service implementation method and serviced component for block chain |
| CN110717761A (en) * | 2019-12-12 | 2020-01-21 | 腾讯科技（深圳）有限公司 | Data processing method and device and computer storage medium |
| CN110717762A (en) * | 2019-12-16 | 2020-01-21 | 腾讯科技（深圳）有限公司 | Data processing method, data processing device, node equipment and storage medium |
| CN110738497A (en) * | 2019-12-19 | 2020-01-31 | 腾讯科技（深圳）有限公司 | data processing method, device, node equipment and storage medium |
-
2020
- 2020-03-13 CN CN202010176354.7A patent/CN111400043A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180189333A1 (en) * | 2017-01-03 | 2018-07-05 | International Business Machines Corporation | Limiting blockchain size to optimize performance |
| CN107819696A (en) * | 2017-11-22 | 2018-03-20 | 中国银行股份有限公司 | A kind of transaction flow control method and system |
| CN109801070A (en) * | 2019-01-12 | 2019-05-24 | 杭州复杂美科技有限公司 | Transaction queuing strategy, equipment and storage medium |
| CN110060161A (en) * | 2019-03-28 | 2019-07-26 | 众安信息技术服务有限公司 | It trades anti-heavy client service implementation method and serviced component for block chain |
| CN109995666A (en) * | 2019-04-12 | 2019-07-09 | 深圳市元征科技股份有限公司 | A kind of method for message transmission and relevant apparatus |
| CN110717761A (en) * | 2019-12-12 | 2020-01-21 | 腾讯科技（深圳）有限公司 | Data processing method and device and computer storage medium |
| CN110717762A (en) * | 2019-12-16 | 2020-01-21 | 腾讯科技（深圳）有限公司 | Data processing method, data processing device, node equipment and storage medium |
| CN110738497A (en) * | 2019-12-19 | 2020-01-31 | 腾讯科技（深圳）有限公司 | data processing method, device, node equipment and storage medium |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112988413A (en) * | 2021-02-07 | 2021-06-18 | 杭州复杂美科技有限公司 | Trade batch broadcasting dynamic adjustment method, computer equipment and storage medium |
| CN113132253A (en) * | 2021-03-29 | 2021-07-16 | 杭州趣链科技有限公司 | Bandwidth current limiting method and electronic equipment |
| WO2022206044A1 (en) * | 2021-03-29 | 2022-10-06 | 杭州趣链科技有限公司 | Bandwidth traffic limiting method and electronic device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109687953B (en) | Transaction classification method, apparatus and storage medium | |
| CN111221638B (en) | Concurrent task scheduling processing method, device, equipment and medium | |
| CN111400043A (en) | Transaction pool management method, device and storage medium | |
| CN111324449A (en) | Transaction storage and broadcasting method, device and storage medium of memory pool | |
| CN109039953B (en) | Bandwidth scheduling method and device | |
| CN114385353A (en) | Resource scheduling method and device, electronic equipment and storage medium | |
| US20200252348A1 (en) | Asymmetric co-operative queue management for messages | |
| CN112214288B (en) | Pod scheduling method, device, equipment and medium based on Kubernetes cluster | |
| CN114579296A (en) | Server idle calculation scheduling method and device and electronic equipment | |
| CN111538572A (en) | Task processing method, device, scheduling server and medium | |
| CN114153609A (en) | Resource control method and device, electronic equipment and computer readable storage medium | |
| CN116048740A (en) | Task scheduling method and system based on many-core system, electronic equipment and medium | |
| CN109901918B (en) | Method and device for processing overtime task | |
| CN111309442B (en) | Method, device, system, medium and equipment for adjusting number of micro-service containers | |
| CN109862069B (en) | Message processing method and device | |
| CN115665157B (en) | Balanced scheduling method and system based on application resource types | |
| CN113596146B (en) | Resource scheduling method and device based on big data | |
| CN113254208A (en) | Load balancing method and device for server, server and storage medium | |
| CN115834466B (en) | Method, device, equipment, system and storage medium for analyzing path of computing power network | |
| CN114629734B (en) | Method, device, system and storage medium for processing ticket | |
| CN111062634A (en) | Approval task allocation method and device, computer equipment and storage medium | |
| CN109067864A (en) | Notification message method for pushing, device and electronic equipment | |
| CN111524059A (en) | Memory utilization method, system, terminal and storage medium during image caching | |
| CN111259045B (en) | Data processing method, device, server and medium | |
| WO2021135763A1 (en) | Data processing method and apparatus, storage medium, and electronic apparatus |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200710 |