CN109710387B - Policy engine for block chain transaction priority ordering and use method thereof - Google Patents
Policy engine for block chain transaction priority ordering and use method thereof Download PDFInfo
- Publication number
- CN109710387B CN109710387B CN201811487152.3A CN201811487152A CN109710387B CN 109710387 B CN109710387 B CN 109710387B CN 201811487152 A CN201811487152 A CN 201811487152A CN 109710387 B CN109710387 B CN 109710387B
- Authority
- CN
- China
- Prior art keywords
- transaction
- strategy
- engine
- pool
- priority
- 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.)
- Active
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a strategy engine for block chain transaction priority ordering and a using method thereof, wherein the strategy engine is used for screening transactions in a list before the transactions are executed, reordering according to rules of a preset strategy and the high-low sequence of the priority, and allocating different hardware and computing resources for the transactions aiming at different strategy grades, and the using method comprises the following steps: s1: the block chain selects the affairs to be packed according to a preset strategy, and calls a strategy engine when the block chain is ready to be packed, so as to judge whether a priority account or an address exists and be responsible for sequencing the priority; s2: the block chain pushes the transaction pool to a pool queue, and a high-speed cache queue is adopted to receive the transaction pool in a first-in first-out sequence; s3: the strategy engines sequence the affairs, take the affair pool out of the pool queue and sequence the affairs in the affair pool, and the strategy engines comprise a plurality of external rule engines; s4: and pushing and executing, and allocating resources for each transaction according to the final output result of the policy engine.
Description
Technical Field
The invention relates to the field of block chain transaction priority ordering, in particular to a policy engine for block chain transaction priority ordering and a using method thereof.
Background
In most current blockchain platforms, transactions are executed in a certain priority order. For example, a well-known blockchain platform etherhouse, whose transaction execution policy is executed by Gas Price from high to low by default, and only 3 different policy options including this policy are built in, and other blockchain technologies or platforms are also similar. But their policies are both configuration-unchangeable.
For non-modifiable enforcement policies, those policies may not be satisfied when particularly important transactions, such as urgent transfer transactions or prioritized customer service, need to be enforced immediately or in advance. For a service type enterprise, the service type enterprise must have its own client and service quality evaluation system, and a service scene needing priority control is frequently encountered in daily service, but cannot be met by a traditional block chain platform. In addition, in the scenarios of the alliance chain and the private chain, a set of controllable priority strategies is also needed to meet the changing business requirements of the members according to different businesses or different division of labor that the members need to complete.
Disclosure of Invention
The invention aims to provide a strategy engine for block chain transaction priority ordering and a using method thereof, which can screen transactions in a list before the transactions are executed, and reorder the transaction list from high to low according to the priority according to rules defined by the strategy. Meanwhile, aiming at different strategy levels, different hardware and computing resources are allocated to the transaction to ensure the correct operation of the high-priority transaction.
The embodiment of the invention is realized by the following steps:
a strategy engine for block chain transaction priority ordering and a using method thereof are provided, the strategy engine discriminates the transactions in a list before the transactions are executed, and then reorders according to the rules of a preset strategy and the high-low order of the priority, the strategy engine allocates different hardware and computing resources for the transactions aiming at different strategy levels, the using method of the strategy engine comprises the following steps:
s1: the block chain selects the affairs to be packed according to a preset strategy, and calls a strategy engine when the block chain is ready to be packed, judges whether the priority (or the address) exists and is responsible for sequencing the priority;
s2: the block chain pushes the transaction pool to a pool queue, and a high-speed cache queue is adopted to receive the transaction pool in a first-in first-out sequence;
s3: the strategy engines sequence the affairs, take the affair pool out of the pool queue and sequence the affairs in the affair pool, and the strategy engines comprise a plurality of external rule engines;
s4: and pushing and executing, and distributing corresponding hardware and computing resources for each transaction according to the final output result of the policy engine.
In a preferred embodiment of the present invention, when the policy engine performs pre-ordering work in a plug-in form, the policy engine generates a sequence index according to the transaction list, and extracts an index to be executed from the sequence index in the block chain transaction execution stage.
In the preferred embodiment of the present invention, the policy engine includes a variety of external rules engines, the policy engine being fully decoupled from the blockchain.
In the preferred embodiment of the present invention, the specific operation of S1 is as follows: when a blockchain packages a transaction into a new block, first invoking a policy engine to identify whether a priority account (or address) for the new block exists; if yes, the strategy engine extracts the transaction in the account with the priority or the address with the priority to be executed in priority; if the transaction priorities are the same, the strategy engine sorts according to the scale of the strategy and the transaction size according to the height; the priority accounts or priority addresses themselves have a priority order, which is ordered by the policy engine, and when the number of transactions for a new block reaches a threshold, the transactions for the new block are not incremented.
In the preferred embodiment of the present invention, the specific operation of S2 is as follows: and establishing a pool queue mechanism, wherein the pool queue mechanism is based on a cache queue, receives the transaction pools according to a first-in first-out sequence, and then carries out policy ordering on the transactions in each transaction pool in sequence.
In the preferred embodiment of the present invention, the transaction pool adopts asynchronous sorting, new things are added into the transaction pool, the block chain system is provided with timeout time inside, once the timeout time is exceeded, the sorting in the transaction pool is suspended until the transactions are taken out; and when the external strategy fails or times out, discarding the asynchronous sorting and starting formal sorting to execute again.
In a preferred embodiment of the present invention, the step S3 includes the following steps:
s31: acquiring transaction pools from the pool queues in sequence according to a first-in first-out principle, and then pushing the transaction pools to a strategy engine;
s32, after the strategy engine receives the affair pool, the strategy engine decides to use the simple strategy engine or the external rule engine according to the system strategy;
and S33, after receiving the feedback of the system strategy, the strategy engine orders the affairs in the affair pool according to the ordering index contained in the feedback.
In the preferred embodiment of the present invention, the simple policy in S32 includes a simple sorting rule written in a programming language; if the transaction is complex, an external rule engine is used, the external rule engine transfers the transaction to the policy engine by calling an external rule engine interface, and the external rule engine waits for feedback.
In a preferred embodiment of the present invention, the step S4 includes the following steps:
s41: pushing and executing the sequenced transaction pool;
s42: during execution, corresponding hardware and computing resources are allocated to each transaction according to the final output result of the policy engine.
The embodiment of the invention has the beneficial effects that: the user can freely customize the rules of the rule engine according to the self business requirement, and can upgrade and maintain, thereby solving the problem that the priority can not be changed due to the business change; the policy engine may cause blocking when queues are queued and transaction pools are ordered because some rules may be very complex and the time it takes for the ordering to complete is relatively long. Therefore, the policy engine also supports multi-threaded execution, i.e., multiple policy engines are executed simultaneously to speed up the ordering work of the transaction pool; the strategy engine is compatible with various service scenes, various external rule engines are supported in an adapter mode, and more complex service rules can be customized through the rule engine of a third party; rules can be extended to many dimensions through an external interface provided by the policy engine; the strategy engine and the block chain are completely decoupled, and the external rule process is added into the strategy engine in an adapter mode, so that the maintenance cost of the whole block chain is greatly reduced.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.
Fig. 1 is a schematic overall structure diagram of an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
First embodiment
The invention aims to realize a set of customizable Policy Engines (PE), which can screen the transactions in a list before the transactions are executed, and reorder the transaction list from high to low according to the rules defined by the Policy. Meanwhile, aiming at different strategy levels, different hardware and computing resources are allocated to the transaction, so that the correct operation of the high-priority transaction is ensured. For some blockchain platforms that execute first and then sort, the PE performs pre-sorting before executing in the form of plug-in, which is very fast, and generates an order index according to the transaction list, so as to quickly extract the index of the transaction to be executed from the index in the execution stage.
For a relatively complex strategy, the invention simultaneously supports a plurality of external rule engines, decouples the complex strategy rule from the block chain, achieves the purpose of dividing and treating, and reduces the management and maintenance cost. The established strategy supports modification, upgrading and maintenance, and the overall usability is improved. This patent mainly divides into 3 stages to realize, and overall structure schematic diagram is shown as figure 1:
s1: selecting the affairs to be packaged according to the strategy, wherein the specific operation is as follows:
s11: when the blockchain is ready to pack a transaction into a new block, the PE is first invoked to identify whether an allocated priority account or address exists. If so, the transactions involved in those accounts with priority enforcement rights are extracted in preparation for priority enforcement. All privileged accounts, i.e. the accounts with the priority execution right, also have a priority order, and are ordered by the PE, and when the number of transactions reaches a certain threshold, the new block does not perform the new transaction any more, and the threshold is configured by the PE. When the same authority level of the transaction is encountered, the PEs are ranked from high to low according to the size of the strategy and the size of the transaction, and the size of the transaction in the embodiment generally refers to the cost of the transaction. Note that only the transactions that are executed preferentially are screened here, and the final ordering, i.e., pre-ordering work, is not performed.
S2: pushing a transaction POOL (hereinafter referred to as TX POOL) or a transaction list to a POOL Queue (hereinafter referred to as TP Queue), comprising the steps of:
s21: for some public chains, the block generation may be faster, such as in ether houses, generating one block in about 15 seconds. If the strategy is relatively complex, the sequencing congestion phenomenon may be generated, and in order to accelerate the mining speed, the mining operation of the previous block may be stopped when the congestion phenomenon occurs in some block chains, which is not feasible for the high-priority execution strategy. Therefore, the invention realizes a set of pool queue mechanism, which is based on a cache queue, receives the transaction pools in a First-in First-out (FIFO) sequence, and then carries out strategy sequencing on the transactions in each transaction pool in sequence, thereby avoiding that the transactions are terminated by a block chain due to congestion and the strategy sequencing is not influenced.
As optimization, the invention also provides a set of brand new transaction pool, which adopts an asynchronous advanced sequence confirmation: i.e., asynchronous acknowledgement order, when new transactions are added to the transaction pool, which has the benefit of reducing latency in later ordering. Note that the asynchronous process may continue for a significant period of time due to the existence of external rules, so the system sets a Timeout beyond which the validation of ordering in the transaction pool is suspended until a subsequent operation formally fetches a transaction from the transaction pool. And if the external strategy fails or is overtime, the asynchronous sorting is abandoned, and the formal sorting is started to execute again. Such a transaction pool is more suitable for simple internal policy scenarios due to the delay of uncertainty or other uncontrollable reasons for external policies.
S3: taking out the transaction pool from the pool queue for sorting, and the method specifically comprises the following steps:
and S31, acquiring the transaction pools from the pool queue in sequence according to the FIFO principle, starting the strategy engine and pushing the transaction pools to the strategy engine.
S32: after receiving the transaction pool, the PE determines whether to use a simple strategy or an external rule engine according to a system strategy, wherein the simple strategy refers to a simple sequencing rule written by using programming languages (JAVA, GO, Nodejs and the like) supported by the invention. If the business is complex, an external rule engine is needed, a supported external rule engine interface is called, the transaction information is needed to be transmitted, and the feedback is waited.
S33: after receiving the rule feedback, the PE sorts the transactions in the transaction pool according to the sorting index contained in the feedback.
S4: and pushing execution, wherein the specific operation is as follows:
s41: and pushing, executing and digging the sequenced transaction pools.
S42: and in the execution process, corresponding hardware and computing resources are allocated or allocated to each transaction according to the final output result of the PE.
In summary, compared with the prior art and the prior art, the invention has the following advantages:
1. completely free policy engine: the user can freely customize the rules of the rule engine according to the self business requirement, and can upgrade and maintain, thereby solving the problem that the priority can not be changed due to the business change. The policy engine may cause blocking when queues are queued and transaction pools are ordered because some rules may be very complex and the time it takes for the ordering to complete is relatively long. Thus, the policy engine also supports multi-threaded execution, i.e., multiple policy engines are executed simultaneously to speed up the ordering work of the transaction pool, but the final order must be consistent with that in the original queue. Although this will still lead to some degradation of the TPS of the blockchain, this performance loss is worth the gain in controllable priority.
2. And (3) expandability: the PE was originally designed to be compatible with a variety of service scenarios as much as possible. The PE supports various external rule engines in the mode of adapters, and more complex business rules can be customized through a rule engine of a third party. Rules can be extended to many dimensions through the external interface provided by the PE, such as the central authorization system of the interfacing user, and transaction ordering is arranged directly according to the rights specified in the authorization system. This is enabled because the PE itself is a highly encapsulated, external process independent engine. All external processes only need to return corresponding sequencing results through the adapters provided by the PEs to be in common.
3. Module isolation: the strategy engine and the block chain are completely decoupled, and the external rule process is added into the strategy engine in an adapter mode, so that the maintenance cost of the whole block chain is greatly reduced.
This description describes examples of embodiments of the invention, and is not intended to illustrate and describe all possible forms of the invention. It should be understood that the embodiments described in this specification can be implemented in many alternative forms. The figures are not necessarily to scale; some features may be exaggerated or minimized to show details of particular components. Specific structural and functional details disclosed are not to be interpreted as limiting, but merely as a representative basis for teaching one skilled in the art to variously employ the present invention. It will be appreciated by persons skilled in the art that a plurality of features illustrated and described with reference to any one of the figures may be combined with features illustrated in one or more other figures to form embodiments which are not explicitly illustrated or described. The described combination of features provides a representative embodiment for a typical application. However, various combinations and modifications of the features consistent with the teachings of the present invention may be used as desired for particular applications or implementations.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (9)
1. A strategy engine for block chain transaction priority ordering and a using method thereof are characterized in that the strategy engine screens transactions in a list before the transactions are executed and then reorders the transactions according to the high-low order of priority according to rules of a preset strategy, the strategy engine allocates different hardware and computing resources for the transactions aiming at different strategy levels, and the using method of the strategy engine comprises the following steps:
s1: the block chain selects the affairs to pack according to the preset strategy, calls the strategy engine when the block chain is ready to pack, judges whether a priority account or a priority address exists and is responsible for sorting the priority;
s2: the block chain pushes the transaction pool to a pool queue, and a high-speed cache queue is adopted to receive the transaction pool in a first-in first-out sequence;
s3: the plurality of policy engines sequence the transactions, take out the transaction pool from the pool queue and sequence the transactions in the transaction pool, and the policy engines comprise a plurality of external rule engines;
s4: and pushing and executing, and distributing corresponding hardware and computing resources for each transaction according to the final output result of the policy engine.
2. The policy engine for blockchain transaction prioritization and the method of using the same according to claim 1, wherein when the policy engine performs pre-ordering work in a plug-in manner, the policy engine generates a sequence index according to the transaction list, and extracts an index to be executed from the sequence index in the execution stage of blockchain transaction.
3. The policy engine and method of use thereof for blockchain transaction prioritization according to claim 1, wherein the policy engine includes a variety of external rules engines, the policy engine and the blockchain being fully decoupled.
4. The policy engine for block chain transaction prioritization and method of use thereof according to claim 1, wherein the specific operations of S1 are as follows: when a blockchain packs a transaction into a new block, firstly calling the policy engine to identify whether a priority account or a priority address of the new block exists; if the transaction exists, the policy engine extracts the transaction in the account with the priority or the address with the priority to be executed in priority; if the transaction priorities are the same, the strategy engine sorts according to the scale of the strategy and the transaction size according to the height; the priority accounts or priority addresses themselves have a priority order that is ordered by the policy engine, and when the number of transactions of the new block reaches a threshold, the transactions of the new block are not increased.
5. The policy engine for block chain transaction prioritization and method of use thereof according to claim 1, wherein the specific operations of S2 are as follows: and establishing a pool queue mechanism, wherein the pool queue mechanism is based on a cache queue, receives the transaction pools according to a first-in first-out sequence, and then carries out policy ordering on the transactions in each transaction pool in sequence.
6. The policy engine for blockchain transaction prioritization and method of using the same according to claim 5, wherein the transaction pool employs asynchronous ordering, new transactions are added to the transaction pool immediately and asynchronously confirming the order, the blockchain system has built-in timeout time, and once the timeout time is exceeded, the ordering in the transaction pool is suspended until a transaction is fetched; and when the external strategy fails or times out, discarding the asynchronous sorting and starting formal sorting to execute again.
7. The policy engine for block chain transaction prioritization and method of use thereof according to claim 1, wherein the S3 includes the steps of:
s31: acquiring transaction pools from the pool queues in sequence according to a first-in first-out principle, and then pushing the transaction pools to the strategy engine;
s32, after receiving the transaction pool, the strategy engine decides to use a simple strategy engine or an external rule engine according to the system strategy;
and S33, after receiving the feedback of the system strategy, the strategy engine orders the affairs in the affair pool according to the ordering index contained in the feedback.
8. The policy engine for blockchain transaction prioritization and method of using the same of claim 7, wherein the simple policy in S32 includes simple ordering rules written in a programming language; and if the transaction is complex, using the external rule engine, transmitting the transaction to the policy engine by calling an external rule engine interface through the external rule engine, and waiting for feedback by the external rule engine.
9. The policy engine for block chain transaction prioritization and method of use thereof according to claim 1, wherein the S4 includes the steps of:
s41: pushing and executing the sequenced transaction pool;
s42: and in the execution process, distributing corresponding hardware and computing resources to each transaction according to the final output result of the strategy engine.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811487152.3A CN109710387B (en) | 2018-12-06 | 2018-12-06 | Policy engine for block chain transaction priority ordering and use method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811487152.3A CN109710387B (en) | 2018-12-06 | 2018-12-06 | Policy engine for block chain transaction priority ordering and use method thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109710387A CN109710387A (en) | 2019-05-03 |
| CN109710387B true CN109710387B (en) | 2020-12-15 |
Family
ID=66254057
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811487152.3A Active CN109710387B (en) | 2018-12-06 | 2018-12-06 | Policy engine for block chain transaction priority ordering and use method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109710387B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11336455B2 (en) | 2019-09-25 | 2022-05-17 | International Business Machines Corporation | Consensus protocol for blockchain DAG structure |
| CN110717762B (en) * | 2019-12-16 | 2020-03-17 | 腾讯科技（深圳）有限公司 | Data processing method, data processing device, node equipment and storage medium |
| CN110738497B (en) * | 2019-12-19 | 2020-03-31 | 腾讯科技（深圳）有限公司 | Data processing method and device, node equipment and storage medium |
| CN111382177A (en) * | 2020-03-09 | 2020-07-07 | 中国邮政储蓄银行股份有限公司 | Service data task processing method, device and system |
| CN112346825A (en) * | 2020-11-11 | 2021-02-09 | 湖南智慧政务区块链科技有限公司 | Block chain transaction anti-duplication mechanism based on bitmap algorithm |
| CN113419823B (en) * | 2021-06-22 | 2023-07-18 | 东北大学 | Alliance chain system suitable for high concurrency transaction and design method thereof |
| CN114356995A (en) * | 2022-01-04 | 2022-04-15 | 京东科技信息技术有限公司 | Block chain data analysis method and device and related equipment |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1096399A2 (en) * | 1999-11-01 | 2001-05-02 | Daisho System Service Co., Ltd., Osaka Securities Exchange Building | Method and apparatus for determining priority order of transactions, transaction system, recoding medium and program |
| CN102306205A (en) * | 2011-09-30 | 2012-01-04 | 苏州大学 | Method and device for allocating transactions |
| CN106874087A (en) * | 2017-01-25 | 2017-06-20 | 上海钜真金融信息服务有限公司 | A kind of block chain intelligence contract timed task dispatching method |
| CN107992356A (en) * | 2017-12-13 | 2018-05-04 | 上海壹账通金融科技有限公司 | Block chain affairs block processes method, electronic device and readable storage medium storing program for executing |
| CN108596621A (en) * | 2018-04-28 | 2018-09-28 | 深圳市优学链科技有限公司 | Block chain accounting nodes generation method, device, computer equipment and storage medium |
| CN108810137A (en) * | 2018-06-11 | 2018-11-13 | 西安纸贵互联网科技有限公司 | A kind of alliance's block catenary system |
| CN108804112A (en) * | 2018-05-22 | 2018-11-13 | 上海分布信息科技有限公司 | A kind of block chain falls account processing method and system |
-
2018
- 2018-12-06 CN CN201811487152.3A patent/CN109710387B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1096399A2 (en) * | 1999-11-01 | 2001-05-02 | Daisho System Service Co., Ltd., Osaka Securities Exchange Building | Method and apparatus for determining priority order of transactions, transaction system, recoding medium and program |
| CN102306205A (en) * | 2011-09-30 | 2012-01-04 | 苏州大学 | Method and device for allocating transactions |
| CN106874087A (en) * | 2017-01-25 | 2017-06-20 | 上海钜真金融信息服务有限公司 | A kind of block chain intelligence contract timed task dispatching method |
| CN107992356A (en) * | 2017-12-13 | 2018-05-04 | 上海壹账通金融科技有限公司 | Block chain affairs block processes method, electronic device and readable storage medium storing program for executing |
| CN108596621A (en) * | 2018-04-28 | 2018-09-28 | 深圳市优学链科技有限公司 | Block chain accounting nodes generation method, device, computer equipment and storage medium |
| CN108804112A (en) * | 2018-05-22 | 2018-11-13 | 上海分布信息科技有限公司 | A kind of block chain falls account processing method and system |
| CN108810137A (en) * | 2018-06-11 | 2018-11-13 | 西安纸贵互联网科技有限公司 | A kind of alliance's block catenary system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109710387A (en) | 2019-05-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109710387B (en) | Policy engine for block chain transaction priority ordering and use method thereof | |
| KR100509794B1 (en) | Method of scheduling jobs using database management system for real-time processing | |
| CN106802826B (en) | Service processing method and device based on thread pool | |
| US11036547B2 (en) | File operation task optimization | |
| CN109491801B (en) | Micro-service access scheduling method, micro-service access scheduling device, medium and electronic equipment | |
| CN103309653B (en) | The method and system of application execution is driven for cloud | |
| US20100153957A1 (en) | System and method for managing thread use in a thread pool | |
| US20120254204A1 (en) | Techniques to manage file conversions | |
| CN109901920A (en) | Method for scheduling task and device, electric terminal | |
| US20020152327A1 (en) | Network interface adapter with shared data send resources | |
| US20140324959A1 (en) | Time-sensitive data delivery | |
| US10320733B2 (en) | Prioritization of lock allocation | |
| US9448861B2 (en) | Concurrent processing of multiple received messages while releasing such messages in an original message order with abort policy roll back | |
| US20070079021A1 (en) | Selective I/O prioritization by system process/thread and foreground window identification | |
| CN107085605B (en) | Method and device for data packaging and electronic equipment | |
| US10310891B2 (en) | Hand-off scheduling | |
| US10437645B2 (en) | Scheduling of micro-service instances | |
| CN106294198B (en) | A kind of memory allocation method and method for releasing of (SuSE) Linux OS | |
| CN105677744A (en) | Method and apparatus for increasing service quality in file system | |
| CN108304272B (en) | Data IO request processing method and device | |
| US20190220326A1 (en) | Method and system for synchronizing and joining multiple calls to the same asynchronous code segment | |
| CN109726007A (en) | A kind of container layout quota management method and device and container arranging system | |
| EP3945420A1 (en) | Method and apparatus for data processing, server and storage medium | |
| US20220036206A1 (en) | Containerized distributed rules engine | |
| CN110780869A (en) | Distributed batch scheduling |
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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Wang Xuedong Inventor after: Chen Yongtao Inventor before: Wang Xuedong Inventor before: Cao Lei |
|
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |