CN110246006A - Distributed environment dynamically distributes the method for brining task amount together - Google Patents
Distributed environment dynamically distributes the method for brining task amount together Download PDFInfo
- Publication number
- CN110246006A CN110246006A CN201910442972.9A CN201910442972A CN110246006A CN 110246006 A CN110246006 A CN 110246006A CN 201910442972 A CN201910442972 A CN 201910442972A CN 110246006 A CN110246006 A CN 110246006A
- Authority
- CN
- China
- Prior art keywords
- transaction
- brining
- engine node
- engine
- bring
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Economics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Development Economics (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of distributed environments to dynamically distribute the method for brining task amount together, specifically includes the following steps: step 1, registers in zookeeper system and multiple brings engine node together；Step 2, by the transaction in ordering system to mean allocation to respectively brining engine node together；Step 3, when brining the variation of engine number of nodes together, distribution is recalculated to respectively brining the transaction of engine node together to quantity；Step 4, the transaction pair more than engine node is respectively brought in rejecting together；Step 5, to the transaction being removed to redistributing；Step 6, by the offline transaction brought together on engine node to redistributing；Step 7, to new online transaction to being monitored, to handle in real time；The present invention will bring task amount equilibrium assignment together to engine node is respectively brought together, avoid brining together that accumulating occurs in task or part brings engine node tasks amount excess load together, shorten the processing time of the task of brining together, improve the working efficiency for brining engine node together.
Description
Technical field
The invention belongs to field of computer technology, bring task amount together more particularly to a kind of distributed environment dynamic allocation
Method.
Background technique
In trade matching system deployment framework before, what is taken is multiple-node backup technology, can dispose Liang Tai and with
On transaction engine node, since multiple engine nodes are respectively not aware that the presence of other side, each brings engine section together
Point can all attempt starting All Activity pair and bring thread together, then avoid brining thread together to locking to transaction and other bring engine together
Starting causes to repeat to bring together, and the other engines of brining together for not getting lock were attempted to remove to take lock every 5 minutes (or other specified times), only
Lock could be got after lock release (lock can be discharged by brining together after engine is hung) again by having, and start All Activity pair after getting lock
Thread is brought together to start to carry out order matching to order, so only a transaction engine provides service in synchronization, it is other
Engine node only plays the role of backup, provides the transaction engine task amount weight of service, and bring low efficiency together.
As transaction system portfolio increases, single machine engine node to bring ability together more insufficient, although can be by mentioning
It rises machine configuration and carrys out respite problem, but to bring capability improving together limited for upgraded machine configuration bring, it cannot unconfined liter
Grade machine configuration, and portfolio is ever-increasing, therefore single engine node provides the mode serviced and is no longer applicable in；When mentioning
For the service of brining together node hang after, although bring together ability can by remaining survive node take over, adapter tube process is not prompt enough,
Transaction cannot timely order matching.
Summary of the invention
The purpose of the present invention is to provide a kind of distributed environments to dynamically distribute the method for brining task amount together, will bring task together
Equilibrium assignment brings engine node together to multiple, and be averaged each workload for brining engine node together, so that respectively brining engine node together
Working time shorten, working efficiency improves, and avoids that accumulating occurs in the task of brining together or part brings engine node tasks amount together
Excess load.
The technical scheme adopted by the invention is that distributed environment dynamically distributes the method for brining task amount together, specifically include
Following steps:
Step 1, the uniquely tagged of itself is registered to zookeeper system as transient node by the engine of brining together of starting
On, registered in the same zookeeper system it is multiple bring engine node together, bring together to register under engine node and multiple bring line together
Journey respectively brings engine node and the intercommunication of zookeeper system information together；
It is described respectively bring together engine node obtained from zookeeper system all upper offline informations for brining engine node together with
And be registered in and respectively bring transaction under engine node together to information, zookeeper system can know the friendship for respectively brining engine node together
Easily to performance；
Step 2, zookeeper system obtains all transaction to information from ordering system, and will be in ordering system
Transaction respectively brings engine node together to mean allocation to zookeeper system；
Each brining the maximum transaction to be treated of engine node together is to trade to total quantity N divided by zookeeper to quantity L
That registers in system brings engine number of nodes n together, if aliquant, add one after being rounded to calculated result, then brings engine node together
Maximum transaction be to quantityOr
Step 3, it if the engine number of nodes of brining together registered in zookeeper system becomes n', recalculates each bring together and draws
The maximum transaction distributed on node is held up to quantity L', if the new engine number of nodes n' that brings together brings engine number of nodes n together greater than old,
That is L > L' thens follow the steps 4,5, if the new engine number of nodes n' that brings together brings engine number of nodes n together less than old, i.e.,
It is offline that the part registered in zookeeper system brings engine node together, thens follow the steps 6；
Step 4, if if certain, which brings the transaction registered on engine node together, exceeds the maximum transaction that should be distributed to quantity to quantity
L' then rejects this and brings the transaction pair on engine node together, until the transaction for brining engine node together is less than or equal to maximum to quantity
Transaction is to quantity L'；
Step 5, after transaction is to being brought together engine node revocation, zookeeper system notifies other to bring engine node together,
He brings engine node together and whether is less than maximum transaction to quantity L' to quantity according to its lower transaction registered, and can judgement by the friendship
Easily addition is brought together under engine node at this；
Step 6, when the part in zookeeper system bring together engine node it is offline when, the transaction added thereon is to data
It can be removed, zookeeper system notifies other continuous services to bring engine node together, and will be removed transaction to data average mark
The engine node of brining together for being assigned to other continuous services re-executes；
Step 7, the timed task of assigned frequency is created on brining engine node together, the timed task is responsible for order system
Online New Transaction unite to being monitored.
Further, the step 4 bring together engine node revocation transaction pair process it is as follows: bring together engine node optionally its
One of lower registration brings thread together and stops receiving new transaction to data, this bring together thread complete it is ongoing bring task together after
Thread is exited, and rejects the transaction pair that do not bring together.
Further, the transaction that the step 5 is removed after certain is brought together on engine node, brings engine node together to addition
Starting transaction pair brings thread together and locks the transaction pair, and the dealing for extracting the transaction pair from ordering system, which singly carries out brining together, appoints
Business.
Further, step 7 timed task is as follows to the process being monitored to online New Transaction: timed task with
Assigned frequency pulls All Activity pair from ordering system, compare the transaction that newly pulls to bring the transaction under engine node together
It is right, transaction in ordering system is judged to being online New Transaction pair or offline old transaction pair, if New Transaction is to then adding transaction
To task is brought together, if old transaction brings stopping together to old transaction is then rejected.
The beneficial effects of the present invention are: the present invention realizes the dynamic allocation for brining task amount in distributed environment together, it is comprehensive
Engine node is brought in consideration together and ordering system is traded when changing to quantity, to the allocation rule for brining task amount together, makes to bring together
Task amount energy equilibrium assignment avoids brining together that accumulating occurs in task or part brings engine node tasks together to engine node is respectively brought together
Excess load is measured, the processing time of the task of brining together is shortened, improves the working efficiency for brining engine node together.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is flow chart of the invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
In a distributed system, by Task-decomposing at more parts, task resolution is independent to be executed on a single machine；It is distributed
The process that environment dynamically distributes the method for brining task amount together is as shown in Figure 1, comprising the following steps:
Step 1, itself uniquely tagged is registered to zookeeper system as transient node by the engine of brining together after starting
On, registered in the same zookeeper system it is multiple bring engine node together, bring together to register under engine node and multiple bring line together
Cheng Zhihang brings task together, respectively brings engine node and the intercommunication of zookeeper system information together；
Engine node is respectively brought together to obtain all upper offline informations for brining engine node together from zookeeper system and be registered in
Transaction under engine node is respectively brought together to sub- nodal information, new brings engine Node registry together to zookeeper system whenever having
Or bring together engine node it is offline when, zookeeper system all can notify other to bring engine node together；Zookeeper system
The transaction for respectively brining engine node together can be known to performance；
Step 2, zookeeper system obtains all transaction pair from ordering system, and by the transaction pair in ordering system
Be distributed evenly over zookeeper system respectively brings engine node together；
If the transaction of ordering system is N to total quantity, that registers in zookeeper system brings engine number of nodes together as n,
Then each brining the maximum transaction to be treated of engine node together is to trade to total quantity N divided by zookeeper system to quantity L
Engine number of nodes n is brought in registration together, if aliquant, add one after being rounded to calculated result, then brings the maximum of engine node together
It trades and is to quantityOr
Step 3, it if the engine number of nodes of brining together registered in zookeeper system becomes n', recalculates each bring together and draws
The maximum transaction distributed on node is held up to quantity L', if the new engine number of nodes n' that brings together brings engine number of nodes n together greater than old,
That is L > L' thens follow the steps 4,5, if the new engine number of nodes n' that brings together brings engine number of nodes n together less than old, i.e.,
The part registered in zookeeper system bring together engine node it is offline when, then follow the steps 6；
Step 4, if this is brought engine node together and selects its lower one registered beyond the maximum transaction that should be distributed to quantity L'
A thread of brining together stops receiving new transaction to data, this is brought together, and thread completion is ongoing to bring task backed off after random thread together,
And reject this and bring the transaction pair that do not bring together under thread together, then judge again this bring together the transaction under engine node to quantity whether
Greater than maximum transaction to quantity L', if so, repeating step 4 until the transaction for brining engine node together is less than or equal to most quantity
Big transaction is to quantity L'；
Step 5, after a transaction is to being brought together engine node revocation, zookeeper system notifies other to bring engine together
Node, other are brought engine node together and whether are less than maximum transaction to quantity L' to quantity according to its lower transaction registered, and judgement should
Can transaction to adding in the case where originally brining engine node together；
If certain is brought the transaction registered under engine node together and trades less than maximum to quantity L' to quantity, the friendship that will be removed
Easily brought together under engine node to being registered in this and bring together；Quantity is more than or equal to if certain brings the transaction registered under engine node together
To quantity L', then the transaction being removed is brought together under engine node that cannot be registered in this, need to be skipped this and be brought engine together for maximum transaction
Node, selection transaction are less than maximum transaction to quantity and register to the engine node of brining together of quantity L'；
To addition after certain is brought together under engine node, this brings the starting transaction of engine node together to brining together for the transaction being removed
Thread locks transaction pair, prevents other from brining engine node together using transaction to data, brings thread together from ordering system after starting
The dealing for extracting the transaction pair singly carries out brining pairing together；
Step 6, when the part registered in zookeeper system bring together engine node go wrong stop using when, under
Line is brought the transaction added on engine node together and can be deleted to data, and transaction can be rejected information to data by zookeeper system
It notifies and mean allocation to other continuous services brings engine node together, continuous service brings the transaction of engine node reboot together
To brining thread together, to guarantee that the continual and steady operation of match system, transaction update information at any time, save, trading to brining together
Thread brings the closing of engine node together after carrying out part, will not influence the restarting of transaction pair, and bring thread together after restarting
Continue, not will cause transaction to the loss of data information；
Step 7, after each brining the starting of engine node together, the timed task of assigned frequency is created on brining engine node together,
Timed task is responsible for pulling All Activity pair from ordering system, compare the All Activity that newly pulls to bring the friendship under engine together
It is easily right, transaction in ordering system is judged to being online New Transaction pair or offline old transaction pair, if New Transaction is to then adding friendship
Easily to task is brought together, if old transaction brings stopping together to old transaction is then rejected.
Quantity of the engine node addition New Transaction to after is respectively brought together in step 7 to be less than or equal to respectively bring the distribution of engine node together
Maximum transaction to quantity, when being equal to maximum transaction to quantity, stop adding new transaction pair, maximum transaction to quantity thus
When ordering system transaction to sum and the ratio for brining engine node together；The present invention can also register number in zookeeper system
It is a preset to bring engine node, preset to bring engine node together only when other bring the task amount excess load of engine node together, just meeting together
The task of brining together is shared, avoids distributed system pressure caused by brining the overwork of engine node together excessive, task is brought in raising together
Treatment effeciency.
The engine number of nodes of brining together for only accounting for registering in zookeeper system in step 3~6 of the present invention becomes
The method for brining task amount together is dynamically distributed when change, there is also ordering system transaction to change to quantity in brining task distribution together
The case where, the present invention not by ordering system trade to quantity and bring together engine number of nodes variation be placed in step 3 simultaneously, be due to
The online transaction of ordering system is to being gradual process, i.e., to being single online rather than batch is online, quantity occurs for transaction for transaction
Variation in a short time influences less the maximum transaction for individually brining engine node together on quantity, but cannot ignore again,
So setting steps 7 of the present invention, by brining engine node timer access ordering system together, to online transaction new in ordering system
To bring together task addition and brining together, enable the present invention comprehensively consider when carrying out and brining task amount distribution together transaction to quantity and
It brings the variation of engine number of nodes together, reasonable distribution is carried out to task of brining together, convenient for managing, brining together task processing in time, respectively bring together
The working time of engine node shortens, working efficiency improves.
The present invention can automatically detect it is new bring engine node and transaction together to the upper offline information of child node, in real time to from
The transaction obtained in ordering system carries out data to bring distribution together, so that each engine node of brining together is in working stage always,
The processing capacity for brining automotive engine system together to transaction to data is improved, reduces transaction to the processing time of data.
Each embodiment in this specification is all made of relevant mode and describes, same and similar portion between each embodiment
Dividing may refer to each other, and each embodiment focuses on the differences from other embodiments.Especially for system reality
For applying example, since it is substantially similar to the method embodiment, so being described relatively simple, related place is referring to embodiment of the method
Part explanation.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the scope of the present invention.It is all
Any modification, equivalent replacement, improvement and so within the spirit and principles in the present invention, are all contained in protection scope of the present invention
It is interior.
Claims (4)
1. distributed environment dynamically distributes the method for brining task amount together, which is characterized in that specifically includes the following steps:
Step 1, the uniquely tagged of itself is registered in zookeeper system by the engine of brining together of starting as transient node, together
Registered in one zookeeper system it is multiple bring engine node together, bring together registered under engine node it is multiple bring thread together, respectively
Bring engine node and the intercommunication of zookeeper system information together；
The engine node of respectively brining together obtains all upper offline informations for brining engine node together and note from zookeeper system
To information, zookeeper system can know the transaction pair for respectively brining engine node together for transaction of the volume in the case where respectively brining engine node together
Performance；
Step 2, zookeeper system obtains all transaction to information from ordering system, and by the transaction in ordering system
Engine node is respectively brought together to mean allocation to zookeeper system；
Each brining the maximum transaction to be treated of engine node together is to trade to total quantity N divided by zookeeper system to quantity L
Engine number of nodes n is brought in upper registration together, if aliquant, add one after being rounded to calculated result, then brings engine node together most
It trades greatly and is to quantityOr
Step 3, it if the engine number of nodes of brining together registered in zookeeper system becomes n', recalculates and each brings engine section together
The maximum transaction distributed on point is to quantity L', if the new engine number of nodes n' that brings together brings engine number of nodes n, i.e. L together greater than old
> L' thens follow the steps 4,5, if the new engine number of nodes n' that brings together brings engine number of nodes n, i.e. zookeeper together less than old
It is offline that the part registered in system brings engine node together, thens follow the steps 6；
Step 4, if trading beyond the maximum that should be distributed to quantity L' if certain brings the transaction registered on engine node together to quantity,
It rejects this and brings the transaction pair on engine node together, until the transaction for brining engine node together is less than or equal to maximum transaction pair to quantity
Quantity L'；
Step 5, after transaction is to being brought together engine node revocation, zookeeper system notifies other to bring engine node, other pinches together
It closes engine node and whether maximum transaction is less than to quantity L' to quantity according to its lower transaction registered, can judgement by the transaction pair
Addition is brought together under engine node at this；
Step 6, when the part in zookeeper system bring together engine node it is offline when, the transaction added thereon can quilt to data
It rejects, zookeeper system notifies other continuous services to bring engine node together, and will be removed and trade to data mean allocation extremely
The engine node of brining together of other continuous services re-executes；
Step 7, the timed task of assigned frequency is created on brining engine node together, the timed task is responsible for in ordering system
The New Transaction of line is to being monitored.
2. distributed environment according to claim 1 dynamically distributes the method for brining task amount together, which is characterized in that the step
Rapid 4 bring together the transaction pair of engine node revocation process it is as follows: bring engine node optionally its lower one registered together and bring thread together and stop
New transaction is only received to data, this is brought together, and thread completion is ongoing to bring task backed off after random thread together, and rejects and do not bring together
Transaction pair.
3. distributed environment according to claim 1 dynamically distributes the method for brining task amount together, which is characterized in that the step
To addition after certain is brought together on engine node, that brings the starting transaction pair of engine node together brings thread together simultaneously for rapid 5 transaction being removed
The transaction pair is lockked, the dealing for extracting the transaction pair from ordering system singly carries out brining task together.
4. distributed environment according to claim 1 dynamically distributes the method for brining task amount together, which is characterized in that the step
Rapid 7 timed task is as follows to the process being monitored to online New Transaction: timed task is drawn from ordering system with assigned frequency
Take All Activity pair, compare the transaction that newly pulls to bring the transaction pair under engine node together, judge the transaction in ordering system
To being online New Transaction pair or offline old transaction pair, if New Transaction to transaction is then added to brining task together, if old transaction pair
Old transaction is then rejected to bring stopping together.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910442972.9A CN110246006A (en) | 2019-05-26 | 2019-05-26 | Distributed environment dynamically distributes the method for brining task amount together |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910442972.9A CN110246006A (en) | 2019-05-26 | 2019-05-26 | Distributed environment dynamically distributes the method for brining task amount together |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110246006A true CN110246006A (en) | 2019-09-17 |
Family
ID=67885043
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910442972.9A Pending CN110246006A (en) | 2019-05-26 | 2019-05-26 | Distributed environment dynamically distributes the method for brining task amount together |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110246006A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111353888A (en) * | 2020-03-03 | 2020-06-30 | 杭州时戳信息科技有限公司 | Transaction matching system, on-chain matching method thereof and block link point |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104915259A (en) * | 2015-06-15 | 2015-09-16 | 浪潮软件集团有限公司 | Task scheduling method applied to distributed acquisition system |
| CN105160570A (en) * | 2015-09-15 | 2015-12-16 | 浪潮软件股份有限公司 | Concurrent on-line transaction processing method capable of horizontal expansion |
| CN105320527A (en) * | 2014-06-12 | 2016-02-10 | 中兴通讯股份有限公司 | Configuration file renewing method, device and system based on zookeeper distributed type search engine |
| CN106022917A (en) * | 2016-05-08 | 2016-10-12 | 杭州复杂美科技有限公司 | Block chain matching exchange scheme |
| CN106681824A (en) * | 2015-11-10 | 2017-05-17 | 阿里巴巴集团控股有限公司 | Distributed system scheduling method and device and electronic equipment |
| CN106980678A (en) * | 2017-03-30 | 2017-07-25 | 温馨港网络信息科技（苏州）有限公司 | Data analysing method and system based on zookeeper technologies |
| CN107330788A (en) * | 2017-06-15 | 2017-11-07 | 雷盈科技（上海）有限公司 | A kind of block chain digital asset transaction match method, system, device and medium |
| CN107608661A (en) * | 2017-09-14 | 2018-01-19 | 北京天德科技有限公司 | A kind of high concurrent two dimension based on block chain brings the core algorithm of matrix together |
| CN109087082A (en) * | 2018-07-23 | 2018-12-25 | 阿里巴巴集团控股有限公司 | Financial transaction based on block chain executes method and device, electronic equipment |
| CN109146672A (en) * | 2018-09-04 | 2019-01-04 | 北京京东金融科技控股有限公司 | It is a kind of that matching process and device are brought together based on production model |
-
2019
- 2019-05-26 CN CN201910442972.9A patent/CN110246006A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105320527A (en) * | 2014-06-12 | 2016-02-10 | 中兴通讯股份有限公司 | Configuration file renewing method, device and system based on zookeeper distributed type search engine |
| CN104915259A (en) * | 2015-06-15 | 2015-09-16 | 浪潮软件集团有限公司 | Task scheduling method applied to distributed acquisition system |
| CN105160570A (en) * | 2015-09-15 | 2015-12-16 | 浪潮软件股份有限公司 | Concurrent on-line transaction processing method capable of horizontal expansion |
| CN106681824A (en) * | 2015-11-10 | 2017-05-17 | 阿里巴巴集团控股有限公司 | Distributed system scheduling method and device and electronic equipment |
| CN106022917A (en) * | 2016-05-08 | 2016-10-12 | 杭州复杂美科技有限公司 | Block chain matching exchange scheme |
| CN106980678A (en) * | 2017-03-30 | 2017-07-25 | 温馨港网络信息科技（苏州）有限公司 | Data analysing method and system based on zookeeper technologies |
| CN107330788A (en) * | 2017-06-15 | 2017-11-07 | 雷盈科技（上海）有限公司 | A kind of block chain digital asset transaction match method, system, device and medium |
| CN107608661A (en) * | 2017-09-14 | 2018-01-19 | 北京天德科技有限公司 | A kind of high concurrent two dimension based on block chain brings the core algorithm of matrix together |
| CN109087082A (en) * | 2018-07-23 | 2018-12-25 | 阿里巴巴集团控股有限公司 | Financial transaction based on block chain executes method and device, electronic equipment |
| CN109146672A (en) * | 2018-09-04 | 2019-01-04 | 北京京东金融科技控股有限公司 | It is a kind of that matching process and device are brought together based on production model |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111353888A (en) * | 2020-03-03 | 2020-06-30 | 杭州时戳信息科技有限公司 | Transaction matching system, on-chain matching method thereof and block link point |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108810100B (en) | Method, device and equipment for electing master node | |
| US9892006B2 (en) | Non-blocking listener registration in the presence of data grid nodes joining the cluster | |
| US20090300017A1 (en) | Transaction Parallel Control Method, and Database Managemet System | |
| US20070180453A1 (en) | On demand application scheduling in a heterogeneous workload environment | |
| CN110557416B (en) | Multi-node collaborative blocking method and system | |
| CN102025550A (en) | System and method for managing data in distributed cluster | |
| CN104079630A (en) | Business server side load balancing method, client side, server side and system | |
| EP3180695A1 (en) | Systems and methods for auto-scaling a big data system | |
| CN107329820A (en) | A kind of task processing method and device for group system | |
| CN108737573A (en) | A kind of distributed storage cluster and its service response control method, device and equipment | |
| CN104063355A (en) | Method for configuring server cluster and central configuration server | |
| CN110457129A (en) | A kind of priority lock method for pre-emptively and system based on zookeeper | |
| CN105847352B (en) | Expansion method, device and distributed cache system based on distributed cache system | |
| CN110246006A (en) | Distributed environment dynamically distributes the method for brining task amount together | |
| CN106462459A (en) | Managing metadata for distributed processing system | |
| CN104410511B (en) | A kind of server management method and system | |
| CN105791166A (en) | Load balanced distribution method and system | |
| CN107277188B (en) | Method, client, server and service system for determining IP address attribution information | |
| CN115658311A (en) | Resource scheduling method, device, equipment and medium | |
| CN112953771A (en) | Financial asset management system based on micro-service and decoupling method | |
| CN111881018A (en) | Automatic test dynamic scheduling system | |
| CN102811154B (en) | Resource acquisition method and network server system | |
| CN112612834B (en) | Database middleware and method for connecting client and server | |
| CN113032092B (en) | Distributed computing method, device and platform | |
| CN114995961A (en) | Request scheduling method, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190917 |
|
| RJ01 | Rejection of invention patent application after publication |