CN115099978A - Data processing method and device - Google Patents
Data processing method and device Download PDFInfo
- Publication number
- CN115099978A CN115099978A CN202211022884.1A CN202211022884A CN115099978A CN 115099978 A CN115099978 A CN 115099978A CN 202211022884 A CN202211022884 A CN 202211022884A CN 115099978 A CN115099978 A CN 115099978A
- Authority
- CN
- China
- Prior art keywords
- matching
- transaction
- local
- entrusts
- price
- 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.)
- Granted
Links
Images
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
- 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 embodiment of the application provides a data processing method and a data processing device, wherein the method comprises the following steps: the CPU of the matching server acquires a newly added transaction entrustment of a target object and sends the newly added transaction entrustment to the DPU of the matching server; the DPU of the machine carries out matching processing on the newly added transaction entrusts to obtain matching results of the target targets; the DPU of the local machine sends the matching result and the matching record to a CPU of the local machine; the CPU of the local machine generates a matching data subset of the target object according to the matching result and the matching record, and sends the matching data subset to the market situation server. By adopting the method, the matching transaction is processed by adding the DPU of the local computer, so that the running load of the CPU of the local computer is reduced.
Description
Technical Field
The application belongs to the technical field of data processing, and particularly relates to a data processing method and device.
Background
With the continuous development of the Chinese securities market, the security trading behaviors are continuously increased, the scale of a security exchange is also continuously increased, the security trading is mainly characterized in that a user uploads purchase orders and sell orders of securities on a trading machine in the security exchange, and after the orders pass the auditing of a wind control system, a matching server carries out matching trading on the purchased orders and the sold orders until the order trading is completed. However, at present, a matching server of an exchange mainly uses a Central Processing Unit (CPU) to match and trade orders, but the huge stock trading orders increase the operation load of the CPU. Therefore, how to reduce the operation burden of the CPU is an urgent problem to be solved.
Disclosure of Invention
The embodiment of the application provides a Data Processing method and device, a Data Processing Unit (DPU) is added to the architecture of an original local CPU of a matching server to process matching transactions, and the running load of the local CPU is reduced.
In a first aspect, an embodiment of the present application provides a data processing method, which is applied to a matching server, where the matching server includes a local central processing unit CPU and a local data processor DPU, and the method includes: the CPU of the local machine acquires a newly added transaction entrustment of a target object and sends the newly added transaction entrustment to a local DPU of a matching server; the DPU of the machine carries out matching processing on the newly added transaction entrusts to obtain matching results of the target targets; the local machine DPU sends the matching result and the matching record to the local CPU; the local CPU generates a matching data subset of the target object according to the matching result and the matching record, and sends the matching data subset to the market server.
In the embodiment of the application, the CPU of the local computer acquires the newly added transaction entrustment of the target object and sends the newly added transaction entrustment to the DPU of the local computer of the matching server; the DPU of the machine carries out matching processing on the newly added transaction entrusts to obtain matching results of the target targets; the DPU of the local machine sends the matching result and the matching record to a CPU of the local machine; the CPU of the local machine generates a matching data subset of the target object according to the matching result and the matching record, and sends the matching data subset to the market situation server. By adopting the method, the matching transaction is processed by adding the DPU of the local computer, so that the running load of the CPU of the local computer is reduced.
In one possible example, the matching result of the target object comprises the bargaining price and the quantity of the matched orders of the target object, the highest price of the rest of the unmatched purchase orders and the lowest price of the rest of the unmatched sale orders, and the matching data subset of the target object is generated according to the matching result and the matching record, and comprises the following steps: updating the matching price and the matching quantity in the matching record according to the closing price and the quantity of the matched entrusts; and generating a matching data subset of the target according to the updated matching records, the highest price of the rest unmatched purchase orders and the lowest price of the rest unmatched sale orders.
In the embodiment of the application, the matching records are updated according to the closing price and the closing quantity after matching is completed, and the matching data subset of the target price is generated according to the updated matching records, the highest price of the rest of unmatched purchase orders and the lowest price of the rest of unmatched sale orders. The purpose of matching the data subsets is to send the data subsets to the market server, and the market server generates market snapshots, so that the market snapshots can be generated more conveniently through the data and used for transaction reference of users.
In one possible example, after updating the match price and the match quantity in the match record according to the committed transaction price and the quantity, the method further comprises: and storing the updated matching records into a hardware database.
In the embodiment of the application, the updated matching records are stored in a hardware database. The matching records can be updated conveniently next time.
In one possible example, the native DPU includes a plurality of processing flow table entries, one processing flow for each of the plurality of processing flow table entries; the matching processing of the new transaction order to obtain the matching result of the target comprises the following steps: matching a first one of the plurality of processing flow table entries according to the target; and the local DPU adopts the control unit and the processing unit of the first processing flow table entry to match the newly-added transaction entrusts of the target targets to obtain matching results of the target targets.
In this embodiment of the application, different targets correspond to different processing flow table entries, and when the corresponding processing flow table entries are matched, the control unit and the processing unit in the local DPU may perform matching transaction on the newly added transaction delegation according to the processing flow in the processing flow table entries. The implementation method can efficiently process newly added transaction entrusts with different targets and improve the rate of matching transaction.
In one possible example, an incomplete trading order in the target object's newly added trading orders is obtained; matching a target incomplete commission in the incomplete transaction commission, wherein the sell offer is higher than a first preset offer or the buy offer is lower than a second preset offer, to a second processing flow table entry in the plurality of processing flow table entries; and matching the incomplete transaction entrusts of the target targets and original incomplete transaction entrusts by adopting the control unit and the processing unit of the second processing flow table entry to obtain matching results of the target targets, wherein the original incomplete transaction entrusts are the incomplete transaction entrusts before the new transaction entrusts are obtained.
In the embodiment of the application, a target incomplete transaction proxy of which the sell quotation is higher than the first preset quotation or the buy price is lower than the first preset quotation in the incomplete transaction proxy is matched with the second processing flow table entry, the target incomplete transaction proxy and the original incomplete transaction proxy are matched through the control unit and the processing unit in the second processing flow table entry, and the matching result of the target is obtained. The implementation method can effectively reduce the burden of matching processing on the newly-added transaction entrusts in the first processing flow table entry, thereby improving the matching rate of the target newly-added transaction entrusts.
In one possible example, the matching processing on the new transaction commission to obtain the matching result of the target includes: inquiring the original unmatched transaction entrusts corresponding to the target targets; and matching the newly added transaction entrusts and the original unmatched transaction entrusts according to the conditions of entrusted price priority, entrusted quantity priority and/or entrusted time priority to obtain the matching result of the target.
In the embodiment of the application, the newly added transaction entrusts and the original incomplete transaction entrusts are matched and processed together according to the conditions of entrusting price priority, entrusting quantity priority and/or entrusting time priority. The data operation flow of the DPU of the machine can be reduced, and the matching transaction can be more easily and successfully completed due to richer target objects.
In one possible example, the native CPUs include a plurality of first native CPUs in one-to-one correspondence with a plurality of second native CPUs of the market server according to the target; sending the matching data subset to a market server, comprising: and sending the matching data subset to a second local CPU corresponding to the first local CPU.
In the embodiment of the application, the matching server comprises a plurality of first local CPUs, the market server comprises a plurality of second local CPUs, and the plurality of first local CPUs and the plurality of second local CPUs are in one-to-one correspondence according to target targets. Therefore, the working efficiency of the matching stage and the market snapshot generating stage can be improved, and the running speed of the whole transaction system is increased.
In a second aspect, an embodiment of the present application provides a data processing apparatus, which is applied to a matching server, where the matching server includes a local CPU and a local DPU, and the apparatus includes:
the acquisition unit is used for acquiring a newly added transaction entrustment of a target object by the CPU of the local machine and sending the newly added transaction entrustment to the DPU of the local machine of the matching server;
the processing unit is used for the local DPU to match the newly-added transaction entrusts to obtain a matching result of the target object;
a sending unit, which is used for the local DPU to send the matching result and the matching record to the local CPU;
and a generation unit for generating a matching data subset of the target object according to the matching result and the matching record by the local CPU and sending the matching data subset to the market server.
In a third aspect, an embodiment of the present application provides an electronic device, where the electronic device includes a processor, a memory, and a communication interface, where the processor, the memory, and the communication interface are connected to each other and perform communication between them, the memory stores executable program codes, the communication interface is used for performing wireless communication, and the processor is used to retrieve the executable program codes stored in the memory and perform, for example, some or all of the steps described in any of the methods in the first aspect.
In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, in which program data is stored, and when the program data is executed by a processor, the program data is used to execute the program data to implement part or all of the steps described in the first aspect of the embodiment of the present application.
In a fifth aspect, embodiments of the present application provide a computer program product, where the computer program product includes a non-transitory computer-readable storage medium storing a computer program, where the computer program is operable to cause a computer to perform some or all of the steps as described in the first aspect of the embodiments of the present application. The computer program product may be a software installation package.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic structural diagram of a transaction system according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a matching server according to an embodiment of the present disclosure;
fig. 3 is a schematic flowchart of a data processing method according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a DPU according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a server connection structure according to an embodiment of the present application;
FIG. 6a is a block diagram illustrating functional units of a data processing apparatus according to an embodiment of the present disclosure;
FIG. 6b is a block diagram illustrating functional units of another data processing apparatus according to an embodiment of the present disclosure;
fig. 7 is a block diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present application without making any creative effort belong to the protection scope of the present application.
The terms "first," "second," and the like in the description and claims of the present application and in the above-described drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps is not limited to only those steps recited, but may alternatively include other steps not recited, or may alternatively include other steps inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
First, a system architecture according to an embodiment of the present application will be described.
Referring to fig. 1, fig. 1 is a schematic structural diagram of a transaction system according to an embodiment of the present disclosure, and as shown in fig. 1, the transaction system includes a transaction terminal, a matching server, and a market server. The trading terminal is used for trading entrusts of users, the matching server is used for matching the trading entrusts, and the market server is used for generating latest market snapshots and sending the latest market snapshots to the trading terminal.
The operation engineering of the transaction system is specifically as follows: the method comprises the steps that a user submits an application of a transaction commission at a transaction terminal, the transaction terminal uploads the transaction commission to a matching server after the transaction commission is subjected to risk check, the matching server matches the transaction commission with other transaction commissions, a matching result is sent to a market server after matching is completed, the market server receives the matching result, calculates the matching result to generate a latest market snapshot, and finally the market snapshot is sent to the transaction terminal for the user to refer before transaction.
Referring to fig. 2, fig. 2 is a schematic structural diagram of a matching server according to an embodiment of the present disclosure, and as shown in fig. 2, the matching server 200 includes a CPU210 and a DPU 220.
The CPU210 is a core hardware unit that controls and allocates all hardware resources (such as memory and input/output units) of the computer and executes general operations, and is used as an operation and control core of the computer system. DPU220 is a data-centric, IO-intensive chip, supports infrastructure resource layer virtualization using software-defined technology routes, and has the capability of improving computing system efficiency and reducing the total cost of ownership of the overall system.
The DPU220 further comprises a processing unit 222 and a control unit 221. The processing unit 222 is configured to process data plane traffic such as network forwarding and hardware offloading, and the control unit 221 is configured to process control plane traffic and also bear traffic that cannot be completely offloaded by the data plane. The data plane is mainly responsible for data exchange work, the control plane is mainly used for realizing an exchange strategy and guiding the work of the data plane, the data plane and the control plane are generally interacted based on an OpenFlow protocol, and the OpenFlow protocol is a network communication protocol and can control a forwarding plane of an online switch or a router so as to change a network path of a network data packet. The control surface can be an openvswitch control surface, and the openvswitch control surface can facilitate an administrator to monitor the network state and the data traffic in the whole set of cloud environment.
Based on this, the embodiments of the present application provide a data processing method, and the following describes the embodiments of the present application in detail with reference to the accompanying drawings.
Referring to fig. 3, fig. 3 is a schematic flowchart of a data processing method provided in an embodiment of the present application, where the data processing method is applied to a matching server, where the matching server may be the matching server described in fig. 2, and the matching server includes a local CPU and a local DPU, and as shown in fig. 3, the method includes the following steps:
The new transaction order of the target object is obtained from a transaction terminal of the exchange, the new transaction order comprises the price and the quantity of the buying or selling of the target object, and the new transaction order can be subjected to risk auditing before obtaining, for example, after the same person submits the same buying and selling orders, the matching server matches the orders together.
And step 302, the local DPU performs matching processing on the newly added transaction entrusts to obtain a matching result of the target targets.
The matching processing refers to a trading mode that a seller entrusts a sales order/a sales order in a trading market, a buyer entrusts a purchase order/a purchase order in the trading market, the trading market determines the transaction price of both parties according to the price priority, time priority and quantity priority principles and generates an electronic trading contract, and the transaction mode is that physical delivery is carried out according to a delivery warehouse specified by the trading order. When the matching transaction is performed according to the three conditions of price priority, time priority and quantity priority, the three conditions can be set to meet the order of priority, so that the matching transaction is convenient to perform, for example, the matching transaction can be performed according to the order of price priority, time priority and quantity priority. If there are a plurality of purchase orders (or sale orders) with the same price, time and quantity, and a single sale order (or purchase order), the purchase orders (or sale orders) may be prioritized according to the user level of the offer order, and the user level may be determined by the user's order volume, etc., without limitation.
For example, if the matching transaction is performed according to the priority order of price priority, time priority and quantity priority, when the price of the buyer performing the matching transaction is 10 blocks and the quantity is 100, the seller performing the matching transaction has entrusts 1 (price 10 blocks and quantity 100), entrusts 2 (price 10 blocks and quantity 90), entrusts 3 (price 11 and quantity 100) and entrusts 4 (price 10 blocks and quantity 100). At this time, three selling entrusts of entrustment 1, entrustment 2 and entrustment 4 can be obtained by screening according to the condition of price priority, if the order of entrustment time of the three entrusts is: the order 1 is the same as the order 2 in order to order time and is prior to the order time of the order 4, the order 1 and the order 2 can be screened out according to the time priority condition, finally the order 1 can be screened out according to the quantity priority condition to be the order for finally trading with the purchase order, and the bargaining price after the trading is completed is 10 price blocks and 100 quantity. The foregoing examples are provided for the purpose of illustrating embodiments of the present application and are not to be construed as limiting the scope of the present application.
Since the matching transaction is required to be performed with the original transaction entrusts, after the original transaction entrusts are obtained and the matching transaction is completed, the matching result may include the closing price and the quantity of the matched entrusts of the current target, the highest price of the remaining unmatched buying entrusts, and the lowest price of the remaining unmatched selling entrusts.
In one possible embodiment, the native DPU includes a plurality of processing flow table entries, one processing flow for each of the plurality of processing flow table entries; the method for matching the newly added transaction entrusts to obtain the matching result of the target targets comprises the following steps: matching a first processing flow table entry of the plurality of processing flow table entries according to the target object; the DPU of the machine adopts the control unit and the processing unit of the first processing flow table entry to match the newly added transaction entrusts of the target targets to obtain the matching result of the target targets.
Here, the processing flow table entries herein are determined according to different targets, each processing flow table entry corresponds to a different processing flow, and the processing flow refers to a series of processing flows completed by the control unit and the processing unit. The administrator needs to preset the processing flow to be stored in the entry of the processing flow table, so that matching processing is facilitated. That is, the control unit and the processing unit in the local DPU match the new transaction entrusts of the target targets according to the matching of the target targets to the corresponding first processing flow table entry, and then match the new transaction entrusts of the target targets according to the processing flow in the first processing flow table entry, so as to obtain the matching result of the target targets.
Referring to fig. 4, fig. 4 is a schematic structural diagram of a DPU according to an embodiment of the present disclosure. Referring to fig. 4, DPU400 in fig. 4 includes a processing flow table entry 401, a control unit 402, and a processing unit 403. The processing flow table entry 401 includes a processing flow 404, and the processing flow 404 includes a series of processing flows completed by the control unit 402 and the processing unit 403. When the target object is matched with the processing flow table entry 401, the control unit 402 and the processing unit 403 perform matching processing on the new transaction request of the target object according to the processing flow 404 in the processing flow table entry 401 to obtain a matching result of the target object.
In this embodiment of the present application, different targets correspond to different processing flow table entries, and when a corresponding processing flow table entry is matched, the control unit and the processing unit in the local DPU may perform a matching transaction on a newly added transaction delegation according to a processing flow in the processing flow table entry. The method can efficiently process newly added transaction entrusts with different targets and improve the rate of matching transactions.
In one feasible embodiment, unfinished transaction entrusts in the newly added transaction entrusts of the target object are obtained; matching a target incomplete commission in the incomplete transaction commission, wherein the selling price is higher than a first preset price or the buying price is lower than a second preset price, to a second processing flow table entry in the plurality of processing flow table entries; and matching the incomplete transaction entrusts of the target targets and the original incomplete transaction entrusts by adopting the control unit and the processing unit of the second processing flow table entry to obtain matching results of the target targets, wherein the original incomplete transaction entrusts are the incomplete transaction entrusts before the new transaction entrusts are obtained.
The matching method comprises the steps of matching newly-added transaction orders, namely matching purchase orders and sale orders in a plurality of newly-added transaction orders of a target object with each other, so that partial successful orders can be quickly obtained, some unsuccessfully matched orders may exist after matching is completed, some orders with random prices may exist in the orders, for example, some orders with overhigh sale price or low purchase price are selected, a general trader can see the lowest price of the remaining unmatched purchase orders and the highest price of the purchase orders in a market snapshot before trading, and then the orders are carried out by floating in a small range according to the prices, so that the orders with random prices are difficult to match. Besides, the method also comprises some long-time unsuccessfully-matched orders, and the orders can have other reasons which cause difficulty in matching successfully, such as large number of orders and the like.
If these commissions are put in general processing flow table entries for matching processing, the local DPU constantly reads these data when performing matching transactions, which increases the operation load of the local DPU and decreases the matching rate. In order to solve this problem, the embodiment of the present application proposes to put these delegations of price misreport into another processing flow table entry, that is, a second processing flow table entry, and may reduce the frequency of reading data in the second processing flow table entry, or reduce the use speed of the network, thereby reducing the operation burden of the native DPU, for example, the bandwidth of the second processing flow table entry may be set to be lower than that of the first processing flow table entry, and may be regarded as a secondary processing flow table entry. The foregoing examples are provided for the purpose of illustrating embodiments of the present application and are not intended to limit the scope of the present application.
In the embodiment of the application, a target incomplete transaction entrusts with the sale quotation higher than a first preset quotation or the purchase price lower than the first preset quotation in the incomplete transaction entrusts are matched with a second processing flow table entry, and the target incomplete transaction entrusts and the original incomplete transaction entrusts are matched through a control unit and a processing unit in the second processing flow table entry to obtain a matching result of the target. The implementation method can effectively reduce the burden of matching processing on the newly-added transaction entrusts in the first processing flow table entries, thereby improving the matching rate of the target newly-added transaction entrusts.
Besides the above-mentioned method for matching, the following method can be adopted:
in a feasible embodiment, the matching processing is carried out on the newly added transaction entrusts to obtain the matching result of the target, and the method also comprises the step of inquiring the original unmatched transaction entrusts corresponding to the target; and carrying out matching processing on the newly added transaction entrusts and the original unmatched transaction entrusts according to the conditions of entrusted price priority, entrusted quantity priority and/or entrusted time priority to obtain the matching result of the target.
In the matching processing method of the above embodiment, unlike the matching processing method of the above embodiment, matching transactions are performed on a purchase order and a sell order in a new transaction order, and then an unsuccessful matching order is matched with an original incomplete transaction order. In the matching processing method of the embodiment, all transaction orders of the target targets are put together to be matched, namely, the new transaction order and the original incomplete transaction order are matched together according to the conditions of order price priority, order quantity priority and/or order time priority to obtain the matching result of the target targets. Compared with the matching processing method of the embodiment, the data operation flow of the local DPU can be reduced, and the two matching methods can be selected according to different scenes in practice. As shown in table 1, table 1 is a matching method comparison table. Here, method 1 is the matching processing method in the above embodiment, and method 2 is the matching processing method in this embodiment.
TABLE 1 matching processing method comparison table
In the embodiment of the application, the newly added transaction entrusts and the original incomplete transaction entrusts are matched and processed together according to the conditions of entrusting price priority, entrusting quantity priority and/or entrusting time priority. The data operation flow of the local DPU can be reduced, and the matching transaction is easier to succeed due to richer target objects.
In addition, securities trading requires consideration of many factors such as macroscopic economic changes, ambient external environmental changes, and the psychology of the trading user, among others. However, the main reason why the original incomplete transaction request is objectively is that the maximum price of the buy request in the request is lower than the minimum price of the sell request. After the user knows the highest price of the remaining unmatched buy orders and the lowest price of the sell orders in the market snapshot, the user can comprehensively consider the prices of the own orders according to the prices, the macroscopic economic changes of the current market, the surrounding external environment and the like. But generally, the market price drift over a period is relatively constant, except for some special cases. Knowing this market characteristic, there can also be the following matching process:
a request price interval (including a purchase request and a sell request) of an original incomplete transaction request of a target object is obtained, and the periodic price fluctuation range of the target object is used as a range of each interval to divide the interval to obtain a plurality of request price intervals. Specifically, the method for acquiring the periodic price fluctuation amplitude comprises the following steps: calling a matching price of the target object before the preset time, dividing the matching price of the preset time according to a preset period, calculating the average price of the divided matching price of each period, then calculating the difference value between the average prices of adjacent periods, then calculating the average value of all the obtained difference values, and finally taking the average value of the difference values as the dividing basis of the consignment price interval of the unfinished transaction consignment.
For example, if the preset time is 1 year, all matching prices in the year previous to the current time of the target object are called, and if the preset period is 1 month, all matching prices in the year may be divided into 12 months, and the average price of the matching prices in each month is calculated. And then calculating a difference value between the average prices of adjacent periods, for example, a difference value between the average prices of january and february, finally obtaining 11 difference values, calculating an average value of the 11 difference values, and dividing a consignment price interval of the unfinished transaction consignment into a plurality of consignment price intervals by taking the average value of the 11 difference values as a range of each interval.
And respectively matching the transaction entrusts of each entrusted price interval into different processing flow table entries, wherein one main processing flow table entry and a plurality of other standby processing flow table entries exist in the processing flow table entries, and the data reading speed of the standby processing flow table entries is lower than that of the main processing flow table entries. However, the main processing flow table entry is not fixed, but may be changed according to the above preset cycle, and the changed main processing flow table entry is determined by the size of the average value of the entrusting prices (including a buy entrusting and a sell entrusting) in the current new transaction entrusting. However, if some special conditions cause the fluctuation range of the transaction price to be larger, the entries of the main processing flow table can be changed automatically.
For example, if the preset period is 1 month, the first day of each month may be set as the change day of the main processing flow table entry, that is, the main processing flow table entry is changed on the first day of each month. If the processing flow table entry to which the price interval in which the average value of the commission price falls in the newly-added transaction commission acquired on the first day of the month belongs is the first processing flow table entry, the first processing flow table entry is changed into the main processing flow table entry of the month, and the rest are standby processing flow table entries.
The processing flow for matching treatment is as follows: acquiring a newly added transaction entrustment of a target object; and matching the main processing flow table entries in the plurality of corresponding processing flow table entries of the target object, and matching the newly added transaction entrusts of the target object and the original unfinished transaction entrusts matched into the main processing flow table entries by adopting the control unit and the processing unit of the main processing flow table entries to obtain a matching result of the target object. And matching the newly added transaction entrusts which are not matched successfully into the processing flow table entry corresponding to the price.
And step 303, the local DPU sends the matching result and the matching record to a local CPU.
The local DPU completes some data processing, that is, matching processing, data transmission with other devices, or the local CPU, and therefore the local DPU needs to transmit the processed data to the local CPU, and the local CPU transmits the data to the outside. The standard of the transmission interface between the native CPU and the native DPU may be a peripheral component interconnect express (PCIe).
And step 304, the CPU of the local computer generates a matching data subset of the target object according to the matching result and the matching record, and sends the matching data subset to the market situation server.
Specifically, the local CPU sends the matching data subset to the local CPU in the market server. The data in the matching data subset is used for generating market quotation snapshots by the market quotation server, and the market quotation snapshots are respectively sent to each trading terminal to make reference before trading for the user.
In one possible embodiment, generating a matching data subset of the target object according to the matching result and the matching record includes: updating the matching price and the matching quantity in the matching record according to the closing price and the quantity of the matched entrusts; and generating a matching data subset of the target according to the updated matching records, the highest prices of the rest unmatched purchase orders and the lowest prices of the rest unmatched sale orders.
Wherein, the matching price and the matching quantity in the matching record refer to the transaction price and the transaction quantity after each matching is completed. After a new matching transaction is completed, the matching transaction data needs to be updated to the matching price and the matching quantity in the matching record, so that the data can be called next time conveniently. The match data subset also includes the match price of the target object, the number of matches, the maximum price of the remaining unmatched buy orders, and the minimum price of the remaining unmatched sell orders.
In the embodiment of the application, the matching records are updated according to the closing price and the closing quantity after matching is completed, and the matching data subset of the target price is generated according to the updated matching records, the highest price of the rest of unmatched purchase orders and the lowest price of the rest of unmatched sale orders. Since the purpose of matching the data subsets is to send the data subsets to the market server and generate market snapshots by the market server, the implementation method can more conveniently generate the market snapshots through the data and use the market snapshots for transaction reference of users.
In one possible embodiment, after updating the matching price and the matching quantity in the matching record according to the committed transaction price and the quantity, the method further comprises: and storing the updated matching records into a hardware database.
The matching records need to be updated before the matching data subsets are generated, and each time the matching records are updated, it is required to ensure that the current matching records are the latest and complete matching records, so that the updated matching records need to be stored to facilitate updating next time.
In the embodiment of the application, the updated matching records are stored in a hardware database. The matching records can be updated conveniently next time.
In one possible embodiment, the local CPUs include a plurality of first local CPUs, and the plurality of first local CPUs correspond to a plurality of second local CPUs of the market server one to one according to target targets; sending the matching data subset to a market server, comprising: and sending the matching data subset to a second local CPU corresponding to the first local CPU.
The market server and the matching server both contain local CPUs, and the local CPUs in the market server and the matching server are mainly used for data transmission and small amount of calculation in the matching process. The local CPU of the matching server generates a matching data subset based on the matching result and the matching record and transmits the matching data subset to the local CPU of the market server, and the local CPU of the market server generates a market snapshot based on the matching data subset and transmits the generated market snapshot to each transaction terminal.
Furthermore, since the matching transaction is performed for the single targets one by one, the matching is not performed simultaneously, but the matching can be performed simultaneously for different targets, and after the simultaneous matching of the different targets is completed, a plurality of local CPUs can be provided to process the subsequent data transmission of the different targets respectively. Specifically, the single local CPU in the matching server is responsible for generating and sending a single target matching data subset, and the single local CPU in the market server is responsible for receiving the single target matching data subset and generating a market snapshot.
For example, please refer to fig. 5, fig. 5 is a schematic structural diagram of a server connection structure provided in an embodiment of the present application, and referring to fig. 5, fig. 5 includes a matching server 500 and a market server 510. The matching server 500 includes a DPU502 and a plurality of CPUs 501, and the market information server 510 includes a plurality of CPUs 511. A single CPU of the multiple CPUs 501 in the matching server 500 processes a single target data service, the multiple CPUs 501 delegate respective target transactions to the DPU502, the DPU502 has multiple processing flow table entries, each target may correspond to at least one processing flow table entry, that is, each CPU of the multiple CPUs 501 corresponds to at least one processing flow table entry. The CPUs 501 in the matching server 500 correspond to the CPUs 511 in the market server 510 one by one. For example, the CPU1 in the matching server 500 corresponding to subject 1 and the CPU1 in the market server 510, then after the matching server 500 completes the matching transaction for subject 1, the CPU1 in the matching server 500 generates a matching data subset and sends it to the CPU1 in the market server 510.
In the embodiment of the application, the matching server comprises a plurality of first local CPUs, the market server comprises a plurality of second local CPUs, and the plurality of first local CPUs and the plurality of second local CPUs are in one-to-one correspondence according to target targets. The working efficiency of the matching stage and the market snapshot generating stage can be improved, and therefore the running speed of the whole transaction system is increased.
It can be seen that in the embodiment of the application, the CPU of the local computer obtains the newly added transaction entrustment of the target object and sends the newly added transaction entrustment to the DPU of the matching server local computer; the DPU of the machine carries out matching processing on the newly added transaction entrusts to obtain matching results of the target targets; the DPU of the local machine sends the matching result and the matching record to a CPU of the local machine; the CPU of the local machine generates a matching data subset of the target object according to the matching result and the matching record, and sends the matching data subset to the market situation server. By adopting the method, the matching transaction is processed by adding the DPU of the local computer, so that the running load of the CPU of the local computer is reduced.
Referring to fig. 6a in accordance with the above-described embodiment, fig. 6a is a block diagram of functional units of a data processing apparatus according to an embodiment of the present application, where the apparatus is applied to a matching server, and the matching server includes a local CPU and a local DPU, and as shown in fig. 6a, a data processing apparatus 60 includes: an obtaining unit 601, configured to obtain a new transaction commission of a target object by the local CPU, and send the new transaction commission to the local DPU of the matching server; a processing unit 602, configured to perform matching processing on the new transaction commission by the DPU of the local computer to obtain a matching result of the target object; a sending unit 603, configured to send the matching result and the matching record to the CPU of the local machine by the local machine DPU; a generating unit 604 for generating a matching data subset of the target object from the matching result and the matching record, and transmitting the matching data subset to the market server.
In one possible example, the matching result of the target object comprises the bargaining price and the quantity of the matched orders of the target object, the highest price of the rest of the unmatched purchase orders and the lowest price of the rest of the unmatched sale orders, and the matching data subset of the target object is generated according to the matching result and the matching record, and comprises the following steps: updating the matching price and the matching quantity in the matching record according to the closing price and the quantity of the matched entrusts; and generating a matching data subset of the target according to the updated matching records, the highest price of the rest unmatched purchase orders and the lowest price of the rest unmatched sale orders.
In one possible example, after updating the match price and the match quantity in the match record according to the committed transaction price and the quantity, the method further comprises: and storing the updated matching records into a hardware database.
In one possible example, the native DPU includes a plurality of processing flow table entries, one processing flow for each of the plurality of processing flow table entries; the matching processing of the new transaction order to obtain the matching result of the target comprises the following steps: matching a first one of the plurality of processing flow table entries according to the target; and the local DPU adopts the control unit and the processing unit of the first processing flow table entry to match the newly-added transaction entrusts of the target targets to obtain matching results of the target targets.
In one possible example, an incomplete trading order in the target object's newly added trading orders is obtained; matching a target incomplete commission in the incomplete transaction commission, wherein the selling offer is higher than a first preset offer or the buying offer is lower than a second preset offer, to a second processing flow table entry in the plurality of processing flow table entries; and matching the incomplete transaction entrusts of the target targets and the original incomplete transaction entrusts by adopting the control unit and the processing unit of the second processing flow table entry to obtain matching results of the target targets, wherein the original incomplete transaction entrusts are the incomplete transaction entrusts before the new transaction entrusts are obtained.
In one possible example, the matching of the new transaction order to obtain the matching result of the target object includes: inquiring the original unmatched transaction entrusts corresponding to the target targets; and matching the newly added transaction entrusts and the original unmatched transaction entrusts according to the conditions of entrusted price priority, entrusted quantity priority and/or entrusted time priority to obtain the matching result of the target.
In one possible example, the native CPUs include a plurality of first native CPUs in one-to-one correspondence with a plurality of second native CPUs of the market server according to the target; the sending the matching data subset to the market server includes: and sending the matching data subset to a second local CPU corresponding to the first local CPU.
It can be understood that, since the method embodiment and the apparatus embodiment are different presentation forms of the same technical concept, the content of the method embodiment portion in the present application should be synchronously adapted to the apparatus embodiment portion, and is not described herein again.
In the case of using an integrated unit, as shown in fig. 6b, fig. 6b is a block diagram of a functional unit of another data processing apparatus provided in the embodiment of the present application. In fig. 6b, the data processing device 61 comprises: a processing module 612 and a communication module 611. The processing module 612 is used for controlling and managing actions of the data processing apparatus, such as steps of the acquiring unit 601, the processing unit 602, the sending unit 603, and the generating unit 604, and/or other processes for performing the techniques described herein. The communication module 611 is used to support interaction between the data processing apparatus and other devices. As shown in fig. 6b, the data processing device 61 may further comprise a storage module 613, the storage module 613 being used for storing program codes and data of the data processing device.
The Processing module 612 may be a Processor or a controller, and for example, may be a Central Processing Unit (CPU), a general-purpose Processor, a Digital Signal Processor (DSP), an ASIC, an FPGA or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. A processor may also be a combination of computing functions, e.g., comprising one or more microprocessors, a DSP and a microprocessor, or the like. The communication module 611 may be a transceiver, an RF circuit or a communication interface, etc. The storage module 613 may be a memory.
All relevant contents of each scene related to the method embodiment may be referred to the functional description of the corresponding functional module, and are not described herein again. The data processing device 61 can perform the data processing method shown in fig. 3.
The above embodiments may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, the above-described embodiments may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. The procedures or functions according to the embodiments of the present application are generated in whole or in part when a computer instruction or a computer program is loaded or executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire or wirelessly. Computer-readable storage media can be any available media that can be accessed by a computer or a data storage device, such as a server, data center, etc., that contains one or more collections of available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. The semiconductor medium may be a solid state disk.
Fig. 7 is a block diagram of an electronic device according to an embodiment of the present application. As shown in fig. 7, electronic device 700 may include one or more of the following components: a processor 701, a memory 702 coupled to the processor 701, wherein the memory 702 may store one or more computer programs that may be configured to implement the methods described in the embodiments above when executed by the one or more processors 701. The electronic device 700 may be the matching server.
The Memory 702 may include a Random Access Memory (RAM) or a Read-Only Memory (ROM). The memory 702 may be used to store instructions, programs, code, sets of codes, or sets of instructions. The memory 702 may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for implementing at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing the various method embodiments described above, and the like. The storage data area may also store data created during use by the electronic device 700, and the like.
It is understood that the electronic device 700 may include more or less structural elements than those shown in the above structural block diagrams, for example, a power module, a physical button, a WiFi (Wireless Fidelity) module, a speaker, a bluetooth module, a sensor, etc., which are not limited herein.
The present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores program data, and when the program data is executed by a processor, the program data is used for executing part or all of the steps of any one of the data processing methods described in the above method embodiments.
Embodiments of the present application also provide a computer program product, which includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to cause a computer to execute part or all of the steps of any one of the data processing methods described in the above method embodiments. The computer program product may be a software installation package, and the computer includes a receiving end and/or a transmitting end.
It should be noted that, for the sake of simplicity, any one of the above method embodiments of the data processing method is described as a series of combinations of actions, but it should be understood by those skilled in the art that the present application is not limited by the described order of actions, because some steps may be performed in other orders or simultaneously according to the present application. Further, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred and that no particular act is required to implement the invention.
While the present application has been described in connection with various embodiments, other variations to the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed application, from a review of the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other elements or steps, and the word "a" or "an" does not exclude a plurality. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.
It will be understood by those skilled in the art that all or part of the steps of the various methods of the method embodiments of any of the above-described data processing methods may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable memory, which may include: flash Memory disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.
The foregoing embodiments of the present application have been described in detail, and the principles and implementations of a data processing method and apparatus of the present application are described herein with reference to specific embodiments, and the description of the foregoing embodiments is only used to help understand the method and core ideas of the present application; meanwhile, for a person skilled in the art, according to the idea of the data processing method and apparatus of the present application, the specific implementation manner and the application scope may be changed, and in summary, the content of the present specification should not be construed as a limitation to the present application.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, hardware products and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be understood that any product controlled or configured to perform the processing method of the flowcharts described in the method embodiment of the data processing method of the present application, such as the terminal of the above flowcharts, and the computer program product, belong to the category of the related products described in the present application.
It is apparent that those skilled in the art can make various changes and modifications to the data processing method and apparatus provided in the present application without departing from the spirit and scope of the present application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
Claims (10)
1. A data processing method is applied to a matching server, wherein the matching server comprises a local Central Processing Unit (CPU) and a local Data Processor (DPU), and the method comprises the following steps:
the CPU of the local computer acquires a newly added transaction entrustment of a target object and sends the newly added transaction entrustment to the DPU of the local computer;
the DPU of the computer carries out matching processing on the newly added transaction entrusts to obtain matching results of the target targets;
the local machine DPU sends the matching result and the matching record to the local CPU;
and the CPU of the local machine generates a matching data subset of the target object according to the matching result and the matching record and sends the matching data subset to the market situation server.
2. The method according to claim 1, wherein the matching result of the target object includes a bargain price and a quantity of matched orders of the target object, a maximum price of a remaining unmatched buy order, and a minimum price of a remaining unmatched sell order, and the generating of the matching data subset of the target object based on the matching result and the matching record includes:
updating the matching price and the matching quantity in the matching record according to the closing price and the matching quantity of the matched entrusts;
and generating a matching data subset of the target according to the updated matching records, the highest price of the rest of the unmatched purchase orders and the lowest price of the rest of the unmatched sale orders.
3. The method of claim 2, wherein after updating the match price and the match quantity in the match record according to the committed transaction price and the quantity, the method further comprises:
and storing the updated matching records into a hardware database.
4. The method of any of claims 1-3, wherein the native DPU comprises a plurality of processing flow table entries, one processing flow for each of the plurality of processing flow table entries; the matching processing of the newly added transaction entrusts to obtain the matching result of the target object comprises the following steps:
matching a first of the plurality of processing flow table entries according to the target object;
and the local DPU adopts the control unit and the processing unit of the first processing flow table entry to match the newly-added transaction entrusts of the target targets to obtain matching results of the target targets.
5. The method of claim 4, further comprising:
acquiring an unfinished transaction entrustment in the newly added transaction entrustments of the target object;
matching a target incomplete commission in the incomplete transaction commission that has a sell offer higher than a first preset offer or a buy offer lower than a second preset offer to a second processing flow table entry of the plurality of processing flow table entries;
and matching the incomplete transaction entrusts of the target targets and the original incomplete transaction entrusts by adopting the control unit and the processing unit of the second processing flow table entry to obtain matching results of the target targets, wherein the original incomplete transaction entrusts are the incomplete transaction entrusts before the new transaction entrusts are obtained.
6. The method according to any one of claims 1 to 3, wherein the matching processing of the new transaction order to obtain the matching result of the target object comprises:
inquiring the original unmatched transaction entrusts corresponding to the target targets;
and matching the newly added transaction entrusts and the original unmatched transaction entrusts according to the conditions of entrusted price priority, entrusted quantity priority and/or entrusted time priority to obtain the matching result of the target.
7. The method of claim 1, wherein the native CPUs include a plurality of first native CPUs in one-to-one correspondence with a plurality of second native CPUs of the market server according to the target; the sending the matching data subset to a market server comprises:
and sending the matching data subset to a second local CPU corresponding to the first local CPU.
8. A data processing apparatus applied to a matching server including a local CPU and a local DPU, the apparatus comprising:
the acquisition unit is used for acquiring a newly added transaction entrustment of a target object by the CPU of the local machine and sending the newly added transaction entrustment to the DPU of the local machine of the matching server;
the processing unit is used for the local DPU to match the newly-added transaction entrusts to obtain a matching result of the target object;
a sending unit, configured to send the matching result and the matching record to the local CPU by the local DPU;
and the generating unit is used for generating a matching data subset of the target object according to the matching result and the matching record by the CPU of the local machine and sending the matching data subset to the market server.
9. An electronic device, the device comprising:
the system comprises a processor, a memory and a communication interface, wherein the processor, the memory and the communication interface are connected with each other and complete the communication work among the processors;
the memory having stored thereon executable program code, the communication interface for wireless communication;
the processor is configured to retrieve the executable program code stored on the memory and execute the method of any of claims 1-7.
10. A computer-readable storage medium, characterized in that a computer program for electronic data exchange is stored, wherein the computer program causes a computer to perform the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211022884.1A CN115099978B (en) | 2022-08-25 | 2022-08-25 | Data processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211022884.1A CN115099978B (en) | 2022-08-25 | 2022-08-25 | Data processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115099978A true CN115099978A (en) | 2022-09-23 |
| CN115099978B CN115099978B (en) | 2022-11-18 |
Family
ID=83301070
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211022884.1A Active CN115099978B (en) | 2022-08-25 | 2022-08-25 | Data processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115099978B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1667630A (en) * | 2005-04-08 | 2005-09-14 | 王志坚 | Finance and taxation monitoring method and system based on transaction original certificate data |
| CN101246578A (en) * | 2008-03-24 | 2008-08-20 | 齐鲁证券有限公司 | Three-party deposit processing system and method |
| US20120265655A1 (en) * | 2011-04-18 | 2012-10-18 | Stroh Tim | System and method for processing a transaction document including one or more financial transaction entries |
| CN103250174A (en) * | 2010-04-27 | 2013-08-14 | 欧睦技术公司 | A system and method for rapidly calculating risk in an electronic trading exchange |
| CN105844523A (en) * | 2016-04-11 | 2016-08-10 | 海南世嘉亮科技有限公司 | Method, apparatus and calculation equipment for simulated stock trading by using securities back traced data |
| CN108667765A (en) * | 2017-03-28 | 2018-10-16 | 深圳市中兴微电子技术有限公司 | A kind of data processing method and device |
| CN110460540A (en) * | 2019-06-28 | 2019-11-15 | 杨涛 | A kind of low latency high frequency transaction system and method |
| CN114201421A (en) * | 2022-02-17 | 2022-03-18 | 苏州浪潮智能科技有限公司 | Data stream processing method, storage control node and readable storage medium |
| CN114626922A (en) * | 2022-03-21 | 2022-06-14 | 国网辽宁省电力有限公司 | Self-adaptive bidding multi-energy P2P trading platform based on block chain |
| CN114726788A (en) * | 2022-05-06 | 2022-07-08 | 深圳星云智联科技有限公司 | Message transmission method applied to DPU and related device |
| CN114880266A (en) * | 2022-07-01 | 2022-08-09 | 深圳星云智联科技有限公司 | Fault processing method and device, computer equipment and storage medium |
| CN114936072A (en) * | 2022-06-13 | 2022-08-23 | 深圳星云智联科技有限公司 | Hardware capability calling method and related equipment |
-
2022
- 2022-08-25 CN CN202211022884.1A patent/CN115099978B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1667630A (en) * | 2005-04-08 | 2005-09-14 | 王志坚 | Finance and taxation monitoring method and system based on transaction original certificate data |
| CN101246578A (en) * | 2008-03-24 | 2008-08-20 | 齐鲁证券有限公司 | Three-party deposit processing system and method |
| CN103250174A (en) * | 2010-04-27 | 2013-08-14 | 欧睦技术公司 | A system and method for rapidly calculating risk in an electronic trading exchange |
| US20120265655A1 (en) * | 2011-04-18 | 2012-10-18 | Stroh Tim | System and method for processing a transaction document including one or more financial transaction entries |
| CN105844523A (en) * | 2016-04-11 | 2016-08-10 | 海南世嘉亮科技有限公司 | Method, apparatus and calculation equipment for simulated stock trading by using securities back traced data |
| CN108667765A (en) * | 2017-03-28 | 2018-10-16 | 深圳市中兴微电子技术有限公司 | A kind of data processing method and device |
| CN110460540A (en) * | 2019-06-28 | 2019-11-15 | 杨涛 | A kind of low latency high frequency transaction system and method |
| CN114201421A (en) * | 2022-02-17 | 2022-03-18 | 苏州浪潮智能科技有限公司 | Data stream processing method, storage control node and readable storage medium |
| CN114626922A (en) * | 2022-03-21 | 2022-06-14 | 国网辽宁省电力有限公司 | Self-adaptive bidding multi-energy P2P trading platform based on block chain |
| CN114726788A (en) * | 2022-05-06 | 2022-07-08 | 深圳星云智联科技有限公司 | Message transmission method applied to DPU and related device |
| CN114936072A (en) * | 2022-06-13 | 2022-08-23 | 深圳星云智联科技有限公司 | Hardware capability calling method and related equipment |
| CN114880266A (en) * | 2022-07-01 | 2022-08-09 | 深圳星云智联科技有限公司 | Fault processing method and device, computer equipment and storage medium |
Non-Patent Citations (3)
| Title |
|---|
| ARPAN JAIN.ETC: ""Accelerating CPU-based Distributed DNN Training on Modern HPC Clusters using BlueField-2 DPUs"", 《2021 IEEE SYMPOSIUM ON HIGH-PERFORMANCE INTERCONNECTS (HOTI)》 * |
| 杜平: ""加强基础制度体系建设加快构建全国一体化数据交易市场体系"", 《数据》 * |
| 许子皓: ""多家入局路线不一 DPU上演差异化竞争"", 《中国电子报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115099978B (en) | 2022-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11030692B2 (en) | System and method for a semi-lit market | |
| US11089089B2 (en) | Methods and systems for automated resource exchange among computing facilities | |
| US10296971B2 (en) | Providing real-time trading of virtual infrastructure resources | |
| RU2591651C2 (en) | Method and system for programming service initialisation | |
| US20150081508A1 (en) | Techniques for facilitating electronic trading | |
| CN109508177B (en) | Real-time computing method, device, server and storage medium | |
| US20170109815A1 (en) | On demand auctions of cloud resources (bundles) in hybrid cloud environments | |
| WO2020082611A1 (en) | Method for carrying out deep learning on basis of blockchain platform and electronic device | |
| EP3878161B1 (en) | Intelligent, decentralized and autonomous marketplace for distributed computing and storage | |
| US20140330647A1 (en) | Application and service selection for optimized promotion | |
| US11113244B1 (en) | Integrated data pipeline | |
| US20140279353A1 (en) | C2EX Compute Commodities Exchange | |
| US20120130850A1 (en) | Techniques and system for revenue sharing in an online storefront | |
| WO2022121216A1 (en) | Data processing method and apparatus, terminal, and readable storage medium | |
| US10885565B1 (en) | Network-based data discovery and consumption coordination service | |
| US9639875B1 (en) | Reconfiguring reserved instance marketplace offerings for requested reserved instance configurations | |
| CN115099978B (en) | Data processing method and device | |
| US20120331486A1 (en) | Selective link aggregation in a virtualized environment | |
| CN116319576A (en) | Access flow control method, device, computer equipment and storage medium | |
| US10523591B2 (en) | Discovering resource availability across regions | |
| CN111881148A (en) | Object combination attribute determination method and device and electronic equipment | |
| CN111144977A (en) | Stock order processing method and device | |
| US10055780B1 (en) | Dynamic list view inventory in commerce apps | |
| CN115129654B (en) | Market quotation snapshot processing method and related device | |
| US20240046343A1 (en) | Method, apparatus and system for auction of assets |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |