Memory-based high-availability transaction matching system and method

A transaction and memory technology, applied in data processing applications, instruments, finance, etc., can solve problems such as machine idleness, performance degradation, server resource waste, etc., to save bandwidth resources, reduce IO operations, and improve throughput. Effect
CN110264353AInactive Publication Date: 2019-09-20必成汇(成都)科技有限公司
4 Cites 10 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
必成汇(成都)科技有限公司
Publication Date
2019-09-20
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention discloses a memory-based high-availability transaction matching system and method, and belongs to the technical field of digital currency transaction. A high tradable matching system comprising a user client, a gateway, an order module, a matching engine cluster module, a matching transaction algorithm module, an asynchronous persistence module, a memory reconstruction module and a zookeeper node registration module is constructed; the matching of the matching engine cluster module and the zookeeper node registration module is used to realize the distribution of transaction pairs and the progress of matching tasks, and the matching transaction algorithm module is used to realize the transaction of orders. The problems that in the prior art, the database load is high, the high availability characteristic is reduced, and the cluster cannot be extended transversely are solved.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention belongs to the technical field of digital currency transactions, and in particular relates to a memory-based high-availability transaction matching engine cluster. Background technique

[0002] Using database matching technology, the matching engine selects an active party order from the database according to the order of the pending order time, and then returns from the database in the order of "price priority, same price time priority" ) for counterparty orders matching. The matching engine queries the counterparty orders that meet the transaction conditions from the database for matching and matching. Frequent IO operations are required to query the database, which increases the load on the database and consumes bandwidth resources. The throughput of the matching engine decreases, and the overall performance is poor. Orders are placed with a large amount of traffic at the same time, and a large number of unfinished orders accumulate i...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More