CN112035231A - Data processing system, method and server group - Google Patents
Data processing system, method and server group Download PDFInfo
- Publication number
- CN112035231A CN112035231A CN202010903806.7A CN202010903806A CN112035231A CN 112035231 A CN112035231 A CN 112035231A CN 202010903806 A CN202010903806 A CN 202010903806A CN 112035231 A CN112035231 A CN 112035231A
- Authority
- CN
- China
- Prior art keywords
- processed
- data
- application node
- server
- operation unit
- 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
- 238000000034 method Methods 0.000 title claims abstract description 131
- 230000008569 process Effects 0.000 claims abstract description 111
- 238000003672 processing method Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 6
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer And Data Communications (AREA)
Abstract
The application discloses a data processing system, a method and a server group, comprising: an application node and a dispatch server; the application node comprises a service registration process and a task processing process; the service registration process and the task processing process share a logic operation unit; the service registration process is used for sending a registration request to the dispatch server when detecting that the flag bit of the logic operation unit is a first preset identifier; the dispatching server is used for transmitting the data to be processed to the application node after receiving the registration request; and the task processing process is used for processing the data to be processed after the application node receives the data to be processed and switching the flag bit of the logic operation unit from a first preset identifier to a second preset identifier. The service registration process and the task processing process share one logic operation unit, the application node prompts the current state of the application node to a dispatching server through the zone bit, and the dispatching server determines whether to dispatch the file to be processed to the application node. Therefore, the method and the system do not need a load balancing server, and the cost of the system is reduced.
Description
Technical Field
The present application relates to the field of server technologies, and in particular, to a data processing system, a data processing method, and a server cluster.
Background
When a large amount of data needs to be processed, the processing speed of one server is slow, and the processing of the large amount of data cannot be completed within a specified time.
Therefore, a method for processing a large amount of data by a plurality of servers is proposed, and the processing speed of the large amount of data is further improved.
However, the load balancing server is a special server, which is expensive.
Disclosure of Invention
In order to solve the technical problem, the application provides a data processing system, a data processing method and a server group, and the distribution of data to be processed can be realized without a load balancing server.
The embodiment of the application discloses the following technical scheme:
in a first aspect, the present application provides a data processing system comprising: an application node and a dispatch server;
the application node comprises a service registration process and a task processing process; the service registration process and the task processing process share a logic operation unit;
the service registration process is used for sending a registration request to the dispatch server when detecting that the flag bit of the logic operation unit is a first preset identifier;
the dispatch server is used for transmitting data to be processed to the application node after receiving the registration request;
and the task processing process is used for processing the data to be processed after the application node receives the data to be processed, and switching the flag bit of the logic operation unit from the first preset identifier to a second preset identifier.
Optionally, the task processing process is further configured to switch the flag bit of the logic operation unit from the second preset identifier to the first preset identifier after the processing of the file to be processed is completed.
Optionally, the dispatch server is specifically configured to, after receiving the registration request, rank the to-be-processed data according to the priority of the to-be-processed data, and transmit the to-be-processed data with a higher priority to the application node.
Optionally, the task processing process is configured to return a processing result to the serving server after the processing of the file to be processed is completed;
the dispatch server is further configured to forward the processing result to the client.
Optionally, the file to be processed is generated by the client.
In a second aspect, the present application provides a data processing method, including:
when the service registration process detects that the flag bit of the logic operation unit is a first preset identifier, a registration request is sent to a distribution server;
after receiving the registration request, the dispatch server transmits data to be processed to the application node;
after the application node receives the data to be processed, a task processing process processes the data to be processed, and switches the flag bit of the logic operation unit from the first preset identifier to a second preset identifier;
the application node comprises a service registration process and a task processing process; the service registration process and the task processing process share the logical operation unit.
Optionally, the method further includes:
and after the task processing process finishes processing the file to be processed, the flag bit of the logic operation unit is switched from the second preset identifier to the first preset identifier.
Optionally, after receiving the registration request, the sending server transmits to-be-processed data to the application node, where the transmitting includes:
and the dispatching server arranges the data to be processed according to the priority of the data to be processed and transmits the data to be processed with higher priority to the application node.
Optionally, the method further includes:
after the task processing process finishes processing the file to be processed, returning a processing result to the distribution server; so that the dispatch server forwards the processing result to the client.
Optionally, the file to be processed is generated by the client.
In a third aspect, the present application provides a server farm for data processing, where the server farm includes any optional system in the first aspect.
According to the technical scheme, the method has the following advantages:
the application provides a data processing system, a method and a server group, wherein the system comprises: an application node and a dispatch server; the application node comprises a service registration process and a task processing process; the service registration process and the task processing process share a logic operation unit; the service registration process is used for sending a registration request to the dispatch server when detecting that the flag bit of the logic operation unit is a first preset identifier; the dispatch server is used for transmitting data to be processed to the application node after receiving the registration request; and the task processing process is used for processing the data to be processed after the application node receives the data to be processed, and switching the flag bit of the logic operation unit from the first preset identifier to a second preset identifier. The service registration process and the task processing process on the application node side share one logic operation unit, the task processing process is responsible for writing the zone bit of the logic operation unit, the service registration process is responsible for reading the zone bit of the logic operation unit, the application node prompts the current state of the application node to the dispatching server through the zone bit, namely whether the application node performs data processing or not, and then the dispatching server determines whether to dispatch the file to be processed to the application node or not. Therefore, according to the technical scheme, the load balancing server is not needed, and the cost of the system is reduced.
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 diagram of a data processing system provided herein;
FIG. 2 is a schematic diagram of yet another data processing system provided herein;
FIG. 3 is a schematic diagram of data processing provided herein;
fig. 4 is a flowchart of a data processing method provided in the present application.
Detailed Description
In the prior art, when a plurality of servers process a large amount of data, one load balancing server is needed to distribute the data to be processed for the processing server. However, the load balancing server is a special server, which is expensive and costly.
In order to solve the above-mentioned problem that the load balancing server is expensive, the present application provides a data processing system including: an application node and a dispatch server; the application node comprises a service registration process and a task processing process; the service registration process and the task processing process share a logic operation unit; the service registration process is used for sending a registration request to the dispatch server when detecting that the flag bit of the logic operation unit is a first preset identifier; the dispatch server is used for transmitting data to be processed to the application node after receiving the registration request; and the task processing process is used for processing the data to be processed after the application node receives the data to be processed, and switching the flag bit of the logic operation unit from the first preset identifier to a second preset identifier. According to the technical scheme, the functions of the load balancing server can be realized only by deploying simple programs on the common server, and the price of the common server is lower than that of the load balancing server, so that the cost is lower.
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, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The first embodiment is as follows:
the first embodiment of the present application provides a data processing system, which is described in detail below with reference to the accompanying drawings.
Referring to FIG. 1, a diagram of a data processing system is provided.
The data processing system includes: application node 101, dispatch server 102, and client 103.
The client 103 is used for generating data to be processed, and the data can be batch deduction texts.
After the client 103 generates the pending data, the client transmits the pending data to the dispatch server 102.
And the dispatching server 102 is used for sending the data to be processed to the application node 101 when the condition is met.
In order to avoid the situation that the idle node is always in an idle state and the second busy node is always processing data in the application node 101, the application node 101 is improved. Please refer to fig. 2, which is a schematic diagram of another data processing system provided in the present application.
The application node 101 comprises a service registration process 201 and a task processing process 202; the service registration process 201 and the task processing process 202 share a logical operation unit. The logical operation unit may be a logical operation unit inside the system chip.
The service registration process 201 is configured to read a flag bit of the logical operation unit; the task processing process 202 writes the flag bit of the logical operation unit.
Since the service registration process 201 and the task processing process 202 share one logical operation unit, the service registration process 201 and the task processing process 202 can share a flag bit of the logical operation unit.
The sharing logic operation unit obtains or creates an IPC sharing logic operation unit area through the shmlet and returns a corresponding identifier.
The sharing of logical operation unit pseudo code is as follows:
when the service registration process 201 detects that the flag bit of the logical operation unit is the first preset identifier, it sends a registration request to the dispatch server 102.
The flag bit may be "busy", and the first preset flag may be "0", which indicates that the application node is currently in an idle state.
The sending, by the application node 101, the registration request to the dispatch server 102 may be:
a Socket client in the application node 101 sends an application node registration request to a Socket server in the dispatch server 102.
The dispatch server 102 is configured to transmit the to-be-processed data to the application node 101 after receiving the registration request.
Specifically, the data to be processed can be delivered to the application node 101 in an idle state, that is, the application node of "busy" or "0" by way of dispatching the file.
After the application node 101 receives the data to be processed, the task processing process 202 processes the data to be processed, and switches the flag bit of the logical operation unit from the first preset identifier to a second preset identifier.
The second preset identifier may be "1", and switching the flag bit of the logical operation unit from the first preset identifier to the second preset identifier specifically includes: changing "busy" to "0" indicates that the application node is busy when the application node is processing data. And only when the application node is in an idle state, namely the service registration process reads that the busy is equal to 0, the registration request is sent to the dispatch server. However, at this time, the application node is busy, and the service registration process reads "busy" as "1" and does not send a registration request to the dispatch server. The dispatching server only dispatches the file to the application node after receiving the registration request of the application node, namely, transmits the data to be processed.
In a possible implementation manner, after the task processing process 202 completes processing of the file to be processed, the flag bit of the logical operation unit is switched from the second preset identifier to the first preset identifier. That is to say, after the file to be processed is completed, the application node does not perform data processing, and then enters an idle state, so that when a subsequent service registration process reads that the flag bit "busy" is equal to "0", the subsequent service registration process continues to send a registration request to the dispatch server, and the dispatch server transmits the data to be processed to the application node.
The above describes the conditions for transmitting the data to be processed between the dispatch server and the application node, and the following describes the detailed process for transmitting the data to be processed.
Referring to fig. 3, a schematic diagram of data processing provided in the present application is shown.
As shown in the figure, after the client generates the data to be processed, the data to be processed is sent to the dispatch server, the FILE in the figure is the data to be processed, and the FILE details of the FILE, including the FILE size and the FILE theme, are displayed in the dispatch server.
The dispatch server may further select an application node according to the registration request of the application node, and send the FILE to the corresponding application node, so that the application node processes the FILE, and the specific processing process is shown in fig. 3. It should be noted that the application node is not unique, and at least two application nodes exist in the system.
As an optional implementation manner, the dispatch server is specifically configured to, after receiving the registration request, rank the to-be-processed data according to the priority of the to-be-processed data, and transmit the to-be-processed data with a higher priority to the application node.
For example, for different to-be-processed data, priorities are marked, the to-be-processed data with higher priority is arranged at the front end of the queue, the to-be-processed data with lower priority is arranged at the rear end of the queue, and when the dispatch server transmits the to-be-processed data to the application node, the to-be-processed data at the front end of the queue is transmitted to the application node, so that the to-be-processed data with higher priority can be processed preferentially.
As a possible implementation manner, the task processing process is configured to return a processing result to the serving server after the processing of the file to be processed is completed; the dispatch server is further configured to forward the processing result to the client.
And after the application node finishes processing the data to be processed, returning a processing result to the client.
The application provides a data processing system, including: an application node and a dispatch server; the application node comprises a service registration process and a task processing process; the service registration process and the task processing process share a logic operation unit; the service registration process is used for sending a registration request to the dispatch server when detecting that the flag bit of the logic operation unit is a first preset identifier; the dispatch server is used for transmitting data to be processed to the application node after receiving the registration request; and the task processing process is used for processing the data to be processed after the application node receives the data to be processed, and switching the flag bit of the logic operation unit from the first preset identifier to a second preset identifier. The service registration process and the task processing process on the application node side share one logic operation unit, the task processing process is responsible for writing the zone bit of the logic operation unit, the service registration process is responsible for reading the zone bit of the logic operation unit, the application node prompts the current state of the application node to the dispatching server through the zone bit, namely whether the application node performs data processing or not, and then the dispatching server determines whether to dispatch the file to be processed to the application node or not. Therefore, according to the technical scheme, the load balancing server is not needed, and the cost of the system is reduced.
Example two:
the second embodiment of the present application provides a flowchart of a data processing method, which is specifically described below with reference to the accompanying drawings.
Referring to fig. 4, the figure is a flowchart of a data processing method provided in the present application.
The data processing method comprises the following steps:
step 401: and when the service registration process detects that the flag bit of the logic operation unit is the first preset identifier, sending a registration request to the dispatch server.
Step 402: and the dispatching server transmits the data to be processed to the application node after receiving the registration request.
Step 403: and after the application node receives the data to be processed, the task processing process processes the data to be processed and switches the flag bit of the logic operation unit from the first preset identifier to a second preset identifier.
The application node comprises a service registration process and a task processing process; the service registration process and the task processing process share the logical operation unit.
Optionally, the method further includes:
and after the task processing process finishes processing the file to be processed, the flag bit of the logic operation unit is switched from the second preset identifier to the first preset identifier.
Optionally, after receiving the registration request, the sending server transmits to-be-processed data to the application node, where the transmitting includes:
and the dispatching server arranges the data to be processed according to the priority of the data to be processed and transmits the data to be processed with higher priority to the application node.
Optionally, the method further includes:
after the task processing process finishes processing the file to be processed, returning a processing result to the distribution server; so that the dispatch server forwards the processing result to the client.
Optionally, the file to be processed is generated by the client.
The application provides a data processing method, which comprises the following steps: when the service registration process detects that the flag bit of the logic operation unit is a first preset identifier, a registration request is sent to a distribution server; after receiving the registration request, the dispatch server transmits data to be processed to the application node; after the application node receives the data to be processed, a task processing process processes the data to be processed, and switches the flag bit of the logic operation unit from the first preset identifier to a second preset identifier; the application node comprises a service registration process and a task processing process; the service registration process and the task processing process share the logical operation unit. The service registration process and the task processing process on the application node side share one logic operation unit, the task processing process is responsible for writing the zone bit of the logic operation unit, the service registration process is responsible for reading the zone bit of the logic operation unit, the application node prompts the current state of the application node to the dispatching server through the zone bit, namely whether the application node performs data processing or not, and then the dispatching server determines whether to dispatch the file to be processed to the application node or not. Therefore, according to the technical scheme, the load balancing server is not needed, and the cost of the system is reduced.
Example three:
the application provides a server farm for data processing, wherein the server farm comprises the system introduced in the first embodiment.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for system embodiments, since they are substantially similar to method embodiments, they are described in a relatively simple manner, and reference may be made to some descriptions of method embodiments for relevant points. The above-described system embodiments are merely illustrative, and the units and modules described as separate components may or may not be physically separate. In addition, some or all of the units and modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
It should be understood that in the present application, "at least one" means one or more, "a plurality" means two or more. "and/or" for describing an association relationship of associated objects, indicating that there may be three relationships, e.g., "a and/or B" may indicate: only A, only B and both A and B are present, wherein A and B may be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of single item(s) or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", wherein a, b, c may be single or plural.
The foregoing is merely a preferred embodiment of the present application and is not intended to limit the present application in any way. Although the present application has been described with reference to the preferred embodiments, it is not intended to limit the present application. Those skilled in the art can now make numerous possible variations and modifications to the disclosed embodiments, or modify equivalent embodiments, using the methods and techniques disclosed above, without departing from the scope of the claimed embodiments. Therefore, any simple modification, equivalent change and modification made to the above embodiments according to the technical essence of the present application still fall within the protection scope of the technical solution of the present application without departing from the content of the technical solution of the present application.
Claims (11)
1. A data processing system, comprising: an application node and a dispatch server;
the application node comprises a service registration process and a task processing process; the service registration process and the task processing process share a logic operation unit;
the service registration process is used for sending a registration request to the dispatch server when detecting that the flag bit of the logic operation unit is a first preset identifier;
the dispatch server is used for transmitting data to be processed to the application node after receiving the registration request;
and the task processing process is used for processing the data to be processed after the application node receives the data to be processed, and switching the flag bit of the logic operation unit from the first preset identifier to a second preset identifier.
2. The system according to claim 1, wherein the task processing process is further configured to switch the flag bit of the logical operation unit from the second preset identifier to the first preset identifier after the to-be-processed file is processed.
3. The system according to claim 2, wherein the dispatch server is specifically configured to, after receiving the registration request, rank the to-be-processed data according to the priority of the to-be-processed data, and transmit the to-be-processed data with higher priority to the application node.
4. The system according to claim 3, wherein the task processing process is configured to return a processing result to the serving server after completing the processing of the file to be processed;
the dispatch server is further configured to forward the processing result to the client.
5. The system according to any one of claims 1 to 4, wherein the file to be processed is generated by a client.
6. A method of data processing, comprising:
when the service registration process detects that the flag bit of the logic operation unit is a first preset identifier, a registration request is sent to a distribution server;
after receiving the registration request, the dispatch server transmits data to be processed to the application node;
after the application node receives the data to be processed, a task processing process processes the data to be processed, and switches the flag bit of the logic operation unit from the first preset identifier to a second preset identifier;
the application node comprises a service registration process and a task processing process; the service registration process and the task processing process share the logical operation unit.
7. The method of claim 6, further comprising:
and after the task processing process finishes processing the file to be processed, the flag bit of the logic operation unit is switched from the second preset identifier to the first preset identifier.
8. The method of claim 7, wherein the dispatch server transmitting pending data to the application node after receiving the registration request comprises:
and the dispatching server arranges the data to be processed according to the priority of the data to be processed and transmits the data to be processed with higher priority to the application node.
9. The method of claim 8, further comprising:
after the task processing process finishes processing the file to be processed, returning a processing result to the distribution server; so that the dispatch server forwards the processing result to the client.
10. The method according to any of claims 6-9, wherein the pending file is generated by a client.
11. A server farm for data processing, the server farm comprising the apparatus of any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010903806.7A CN112035231A (en) | 2020-09-01 | 2020-09-01 | Data processing system, method and server group |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010903806.7A CN112035231A (en) | 2020-09-01 | 2020-09-01 | Data processing system, method and server group |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112035231A true CN112035231A (en) | 2020-12-04 |
Family
ID=73590988
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010903806.7A Pending CN112035231A (en) | 2020-09-01 | 2020-09-01 | Data processing system, method and server group |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112035231A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115934031A (en) * | 2023-03-15 | 2023-04-07 | 紫光同芯微电子有限公司 | Calculation engine, data processing method, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1787588A (en) * | 2005-12-01 | 2006-06-14 | 大唐软件技术有限责任公司 | Method for processing multiprogress message and method for processing multiprogress talk ticket |
| CN103929441A (en) * | 2014-05-09 | 2014-07-16 | 中国银行股份有限公司 | Task allocation method and device |
| CN107085542A (en) * | 2017-05-05 | 2017-08-22 | 深圳慧昱教育科技有限公司 | IPC communication means and server |
| CN109800120A (en) * | 2017-11-17 | 2019-05-24 | 深圳市鹰硕技术有限公司 | A kind of monitoring system of the server zone of long-distance educational system |
| CN110928704A (en) * | 2018-09-20 | 2020-03-27 | 广州虎牙信息科技有限公司 | Message processing method, message processing system, server, and computer storage medium |
-
2020
- 2020-09-01 CN CN202010903806.7A patent/CN112035231A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1787588A (en) * | 2005-12-01 | 2006-06-14 | 大唐软件技术有限责任公司 | Method for processing multiprogress message and method for processing multiprogress talk ticket |
| CN103929441A (en) * | 2014-05-09 | 2014-07-16 | 中国银行股份有限公司 | Task allocation method and device |
| CN107085542A (en) * | 2017-05-05 | 2017-08-22 | 深圳慧昱教育科技有限公司 | IPC communication means and server |
| CN109800120A (en) * | 2017-11-17 | 2019-05-24 | 深圳市鹰硕技术有限公司 | A kind of monitoring system of the server zone of long-distance educational system |
| CN110928704A (en) * | 2018-09-20 | 2020-03-27 | 广州虎牙信息科技有限公司 | Message processing method, message processing system, server, and computer storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115934031A (en) * | 2023-03-15 | 2023-04-07 | 紫光同芯微电子有限公司 | Calculation engine, data processing method, equipment and storage medium |
| CN115934031B (en) * | 2023-03-15 | 2023-09-01 | 紫光同芯微电子有限公司 | Computing engine, data processing method, device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101095126B (en) | Methods and apparatus for accessing presence information | |
| CN101616083B (en) | Message forwarding method and device | |
| CN104572974B (en) | service request processing method and device | |
| CN114281521B (en) | Method, system, equipment and medium for optimizing deep learning heterogeneous resource communication efficiency | |
| CN108063813A (en) | The method and system of cryptographic service network parallelization under a kind of cluster environment | |
| CN102957594A (en) | Message queue-based message processing method, related device and system | |
| CN112286688B (en) | Memory management and use method, device, equipment and medium | |
| CN112035231A (en) | Data processing system, method and server group | |
| CN110471947B (en) | Query method based on distributed search engine, server and storage medium | |
| CN107294911B (en) | Data packet monitoring method and device, remote procedure call system and equipment | |
| CN114285906B (en) | Message processing method and device, electronic equipment and storage medium | |
| CN110290009A (en) | A kind of data dispatching method, device and computer readable storage medium | |
| CN112035259A (en) | Data processing system, method and server group | |
| CN103299298A (en) | Service processing method and system | |
| CN113259266A (en) | Message pushing method and device of message queue, server and storage medium | |
| CN114697400B (en) | Service scheduling method, system and VTEP | |
| CN112291325A (en) | Message processing method and device and computer system | |
| CN111722916A (en) | Method for processing MSI-X interruption by mapping table | |
| CN107395765B (en) | Distributed file system, network communication method, platform and creation method thereof | |
| KR20120128013A (en) | System and method for providing push service | |
| CN108306926B (en) | Method and device for pushing gateway service data of Internet of vehicles equipment | |
| CN106209676A (en) | The data processing method of cloud host computer systems based on many equipment and device | |
| CN115860617A (en) | Logistics supply chain management method and system based on block chain | |
| EP3940536A1 (en) | Event stream processing method and event stream processing program | |
| CN110247808B (en) | Information transmission method, device, equipment and readable 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: 20201204 |
|
| RJ01 | Rejection of invention patent application after publication |