CN112948207A - Information transfer method, information transfer device, electronic apparatus, and medium - Google Patents
Information transfer method, information transfer device, electronic apparatus, and medium Download PDFInfo
- Publication number
- CN112948207A CN112948207A CN202110202388.3A CN202110202388A CN112948207A CN 112948207 A CN112948207 A CN 112948207A CN 202110202388 A CN202110202388 A CN 202110202388A CN 112948207 A CN112948207 A CN 112948207A
- Authority
- CN
- China
- Prior art keywords
- node
- link
- information
- service
- asynchronous
- 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
- 238000000034 method Methods 0.000 title claims abstract description 58
- 238000012546 transfer Methods 0.000 title claims abstract description 33
- 230000001360 synchronised effect Effects 0.000 claims abstract description 63
- 230000002159 abnormal effect Effects 0.000 claims abstract description 55
- 238000012545 processing Methods 0.000 claims description 24
- 230000015654 memory Effects 0.000 claims description 15
- 230000004044 response Effects 0.000 claims description 12
- 238000002716 delivery method Methods 0.000 claims description 9
- 238000004422 calculation algorithm Methods 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 13
- 238000004590 computer program Methods 0.000 description 11
- 230000006870 function Effects 0.000 description 10
- 230000008569 process Effects 0.000 description 9
- 238000004891 communication Methods 0.000 description 8
- 230000003044 adaptive effect Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 3
- 230000006866 deterioration Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000004806 packaging method and process Methods 0.000 description 2
- 230000011664 signaling Effects 0.000 description 2
- 239000000758 substrate Substances 0.000 description 2
- 108010001267 Protein Subunits Proteins 0.000 description 1
- 230000005856 abnormality Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
- 238000011144 upstream manufacturing Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
- G06F11/3006—Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system is distributed, e.g. networked systems, clusters, multiprocessor systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3051—Monitoring arrangements for monitoring the configuration of the computing system or of the computing system component, e.g. monitoring the presence of processing resources, peripherals, I/O links, software programs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3409—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment
-
- 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/54—Interprogram communication
- G06F9/547—Remote procedure calls [RPC]; Web services
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Computing Systems (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- Mathematical Physics (AREA)
- Hardware Redundancy (AREA)
Abstract
The present disclosure provides an information transfer method, apparatus, electronic device, and medium, which may be used in the financial field, the computer field, or other fields. The information transmission method comprises the following steps: acquiring service link information of a plurality of nodes and state information of each node in a distributed system; responding to the state information of any node to indicate that the node is an abnormal node, and determining one or more superior nodes of the abnormal node according to the service link information; and for a target service of the plurality of services to be processed by the abnormal node, switching a link between the abnormal node and at least one of the superior nodes from a synchronous link to an asynchronous link for communicating information about the target service.
Description
Technical Field
The present disclosure relates to the field of financial technologies, and in particular, to an information transfer method, apparatus, electronic device, and medium.
Background
With the continuous development of the internet economy, the pressure bearing capacity of a distributed system is continuously examined in the instant massive trading scene. When the received transaction amount in unit time of the system exceeds a certain threshold value, the distributed system can implement system current limiting operation on one hand and directly return failure to the transaction exceeding the threshold value so as to prevent systematic risk; on the other hand, the system can perform online hardware capacity expansion and increase the system performance capacity so as to resist mass transaction access.
In the process of implementing the concept disclosed by the present disclosure, the inventor finds that in the actual operation of a conventional distributed system, due to numerous factors, such as network delay, disk read-write speed, etc., which affect the throughput of the system, the current limit is often not yet effective, the system has performance deterioration, and even the service cannot be provided normally.
Disclosure of Invention
In view of the above, the present disclosure provides an information transfer method, apparatus, electronic device and medium.
An aspect of the present disclosure provides an information transfer method, including: acquiring service link information of a plurality of nodes and state information of each node in a distributed system; responding to the state information of any node to indicate that the node is an abnormal node, and determining one or more superior nodes of the abnormal node according to the service link information; and for a target service of the plurality of services to be processed by the abnormal node, switching a link between the abnormal node and at least one of the superior nodes from a synchronous link to an asynchronous link for communicating information about the target service.
According to an embodiment of the present disclosure, the method further comprises: presetting a synchronous link and an asynchronous link between two adjacent levels of nodes in the plurality of nodes; and pre-storing link control information for each node, the link control information being synchronous link information for indicating that the node transfers information using a synchronous link with a subordinate node of the node or asynchronous link information for indicating that the node transfers information using an asynchronous link with a subordinate node of the node.
According to an embodiment of the present disclosure, the switching a link between the abnormal node and at least one of the superior nodes from a synchronous link to an asynchronous link includes: and modifying the link control information aiming at least one superior node from synchronous link information to asynchronous link information, and sending the link control information to at least one superior node.
According to an embodiment of the present disclosure, the method further comprises: determining a switching proportion through a self-adaptive random gradient descent algorithm according to the service quantity successfully processed by the distributed system in unit time; and determining at least one service as a target service in the plurality of services to be processed aiming at the abnormal node according to the switching proportion.
According to an embodiment of the present disclosure, the method further comprises: after the link between the abnormal node and at least one superior node is switched from the synchronous link to the asynchronous link, in response to the state information of the abnormal node indicating that the abnormal node is recovered to be normal, the link between the node to be recovered to be normal and the at least one superior node is switched from the asynchronous link to the synchronous link.
According to an embodiment of the present disclosure, the state information of the node includes at least one of a CPU usage state, a memory usage state, an input output load, a garbage collection frequency, a thread pool state, and a database connection pool state of the node.
Another aspect of the present disclosure provides an information delivery method, performed by a node in a distributed system, the method including: sending service link information and current state information of the node; receiving link control information for the node, and setting a link between the node and a lower node of the node as a synchronous link or an asynchronous link according to the received link control information; and transferring information on the service to the lower node through the set link.
According to an embodiment of the present disclosure, the setting a link between the node and a lower node of the node as a synchronous link or an asynchronous link according to the received link control information, and transferring information on a service to the lower node through the set link includes: setting a link between the node and a lower node of the node as a synchronous link in response to the received link control information synchronous link information; and setting a link between the node and a lower node of the node as an asynchronous link in response to the received link control information asynchronous link information.
According to an embodiment of the present disclosure, the method further comprises: an operation of determining whether a service times out after setting a link between the node and a lower node of the node as an asynchronous link and before transferring information on the service to the lower node through the asynchronous link, wherein the information on the service is transferred to the lower node through the asynchronous link in a case where the service does not time out.
Another aspect of the present disclosure provides an apparatus for information transfer, comprising: the registration module is used for acquiring service link information of a plurality of nodes in the distributed system and state information of each node; the tracing module is used for responding to the state information of any node to indicate that the node is an abnormal node and determining one or more superior nodes of the abnormal node according to the service link information; a control module for switching a link between the abnormal node and at least one of the upper nodes from a synchronous link to an asynchronous link for a target service among a plurality of services to be processed by the abnormal node, for transferring information on the target service.
Another aspect of the present disclosure provides an apparatus for information transfer, comprising: the information acquisition module is used for sending the service link information and the current state information of the node; a link control module for receiving link control information for the node and setting a link between the node and a lower node of the node as a synchronous link or an asynchronous link according to the received link control information; and a service processing module for transferring information on a service to the lower node through the set link.
Another aspect of the present disclosure provides an electronic device including: one or more processors; a storage device to store one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method as described above.
Another aspect of the present disclosure provides a computer-readable storage medium storing computer-executable instructions for implementing the method as described above when executed.
Another aspect of the disclosure provides a computer program comprising computer executable instructions for implementing the method as described above when executed.
According to embodiments of the present disclosure, the problem of the conventional current limiting method that the current limiting has not yet been effected and the system performance has deteriorated due to node failure can be at least partially solved/mitigated/suppressed/even avoided.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:
fig. 1 schematically illustrates an application scenario of an information delivery method according to an embodiment of the present disclosure;
FIG. 2 schematically illustrates a flow chart of an information delivery method according to an embodiment of the present disclosure;
FIG. 3 schematically illustrates a flow chart of an information delivery method according to an embodiment of the present disclosure;
FIG. 4 schematically illustrates a schematic diagram of a distributed system according to an embodiment of the disclosure;
FIG. 5 schematically illustrates a flow diagram of the operation of a distributed system according to an embodiment of the disclosure;
FIG. 6 schematically illustrates a block diagram of an apparatus for information transfer, in accordance with an embodiment of the present disclosure;
FIG. 7 schematically illustrates a block diagram of an apparatus for information transfer, in accordance with an embodiment of the present disclosure;
FIG. 8 schematically shows a block diagram of an electronic device according to an embodiment of the disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
The embodiment of the disclosure provides an information transfer method and device. By monitoring the state information of each node and switching the link between the abnormal node and the superior node from the synchronous link to the asynchronous link aiming at the target service, the influence of the node fault on the system throughput can be relieved, and the problem that the performance of the system is deteriorated because the current limitation is not effective due to the node fault is relieved and even avoided.
Fig. 1 schematically illustrates an exemplary distributed system architecture 100 that may be applied to the information delivery method according to an embodiment of the disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
As shown in fig. 1, the distributed system architecture 100 according to this embodiment may include a plurality of nodes N1 through N9 and a control center 110.
The nodes N1-N9 may be computers or software modules running in computers, and the nodes N1-N9 may be communicatively connected by various means, such as but not limited to wired connections, wireless connections, signaling connections, connections through the internet, and so forth. Multiple nodes N1-N9 may be used to implement one or more services, such as, but not limited to, financial-related services, each of which may correspond to a transaction. Assuming that service a is accessed from node N1 and processed sequentially through nodes N4 and N7, node N7 returns the processing result to node N1 via node N4. Thus, the service link for service a is N1 → N4 → N7. In a similar manner, the respective services are handled by respective nodes forming respective service links, e.g. service link for service B is N2 → N5 → N7, service link for service C is N3 → N6 → N7, service link for service D is N2 → N5 → N8, and service link for service E is N3 → N6 → N9.
The control center 110 is used to configure and manage the respective nodes N1 through N9. The control center 110 may include one or more computers. The control center 110 may be communicatively connected to the various nodes N1 through N9 in a variety of ways, including but not limited to wired connections, wireless connections, signaling connections, connections through the internet, and so forth.
An information delivery method according to an aspect of an embodiment of the present disclosure may be performed by the control center 110. Accordingly, an apparatus for information transfer according to an aspect of an embodiment of the present disclosure may be provided in the control center 110. An information delivery method according to another aspect of an embodiment of the present disclosure may be performed by any of a plurality of nodes. Accordingly, an apparatus for information transfer according to an aspect of an embodiment of the present disclosure may be provided in any node.
In some embodiments, the information transfer method of the disclosed embodiments may be performed by a computer or cluster of computers different from the control center 110 and capable of communicating with the nodes N1-N9 and/or the control center 110. Accordingly, the apparatus for information transfer provided by the embodiments of the present disclosure may also be disposed in a computer or a computer cluster different from the control center 110 and capable of communicating with the nodes N1 to N9 and/or the control center 110.
It should be understood that the number of nodes and control centers in fig. 1 is merely illustrative. There may be any number of nodes and control centers, as desired for implementation.
Fig. 2 schematically shows a flow chart of an information transfer method according to an embodiment of the present disclosure. The method may be performed by a control center in a distributed system.
In operation S201, service link information of a plurality of nodes and state information of each node in a distributed system are acquired.
In operation S202, in response to the state information of any node indicating that the node is an abnormal node, one or more upper nodes of the abnormal node are determined according to the service link information.
In operation S203, for at least one service to be switched among a plurality of services to be processed by the abnormal node, a link between the abnormal node and at least one of the upper nodes is switched from a synchronous link to an asynchronous link for transferring information on the service to be switched.
Fig. 3 schematically shows a flow chart of an information transfer method according to an embodiment of the present disclosure. The method may be performed by any node in a distributed system.
Transmitting service link information and current state information by the node in operation S301;
receiving link control information for the node and setting a link between the node and a lower node of the node as a synchronous link or an asynchronous link according to the received link control information in operation S302; and
in operation S303, information on a service is transferred to the lower node through the set link.
Fig. 4 schematically illustrates a schematic diagram of a distributed system according to an embodiment of the disclosure.
As shown in fig. 4, the distributed system 400 includes a plurality of nodes N1 through N9 and a control center 410. Assume that the service link for service a is N1 → N4 → N7, where service a is accessed through node N1 and then routed by node N4 to node N7, and service a is handled by node 7. In other words, node N1 is an access node for service a, node N4 is a routing node for service a, and node N7 is a processing node for service a. In the service link N1 → N4 → N7 for service a, the node N4 is a lower node of the node N1, and the node N1 is an upper node of the node N4; node N7 is a subordinate node of node N4, and node N4 is a superordinate node of node N7. Similarly, the service link for service B is N2 → N5 → N7, where node N2 is the access node for service B, node N5 is the routing node for service B, and node N7 is the processing node for service B. The service link for service C is N3 → N6 → N9, where node N3 is the access node for service C, node N6 is the routing node for service C, and node N9 is the processing node for service B.
According to the embodiment of the disclosure, the synchronous link SL and the asynchronous link AL may be preset between two adjacent levels of nodes by each service link. As shown in fig. 4, in the service link N1 → N4 → N7, a synchronous link SL14 and an asynchronous link AL14 are provided between the nodes N1 and N4, and a synchronous link SL47 and an asynchronous link AL47 are provided between the nodes N4 and N7. Similarly, in the service link N2 → N5 → N7, a synchronous link SL25 and an asynchronous link AL25 are provided between the nodes N2 and N5, and a synchronous link SL57 and an asynchronous link AL57 are provided between the nodes N5 and N7; in the service link N3 → N6 → N7, a synchronous link SL36 and an asynchronous link AL36 are provided between the nodes N3 and N6, and a synchronous link SL67 and an asynchronous link AL67 are provided between the nodes N6 and N7. According to an embodiment of the present disclosure, the synchronization link may be a Remote Procedure Call (RPC) link.
The registration server 4101 may maintain the following information for each node: service link information of the node, state information of the node, and link control information of the node.
The service link information of the respective nodes N1 through N9 may be upper link information of a service processed by the node before reaching the node. Each node N1-N9 may register service link information with the registration server 4101 during operation. For example, in the process of processing the service a, the information related to the service a is transferred from the node N1 to the node N4 through the synchronization link SL14, and the node N4 may include the information related to the synchronization link SL14 in the service link information of the node N4 and register the information to the registration server 4102. Similarly, it is assumed that services A, B and C are processed during the operation of node N7, wherein the related information of service a is transferred to node N7 via SL47, the related information of service B is transferred to node N7 via SL57, and the related information of service C is transferred to node N7 via SL 67. In this case, the service link information registered by the node N7 with the registration server 4101 contains information on the synchronized links SL47, SL57, and SL 67. The link control server 4102 can determine an upper node of each node based on the service link information of each node registered in the registration server 4101.
The state information of the nodes N1 to N9 includes, but is not limited to, CPU usage state, memory usage state, Input/Output (IO) load, Garbage Collection (GC) frequency, thread pool state, and database connection pool state of the nodes. Each node N1-N9 may collect (e.g., periodically, at a preset time, or otherwise) its own state information and send it to the registration server 4101. The registration server 4101 may replace the previous state information with the most recently received state information for each node. The link control server 4102 may subscribe to the registration server 4101 for status information of the respective nodes N1 through N9. The registration server 4101 may send the status information of the abnormal node to the link control server 4102 if it finds that the status information of a certain node indicates that the node is abnormal, for example, the CPU usage exceeds a preset threshold (for example, 80%).
The link control information of each of the nodes N1 through N9 may be synchronous link information for indicating that information is transferred between the node and its lower node using a synchronous link or asynchronous link information for indicating that information is transferred between the node and its lower node using an asynchronous link. For example, if the link control information of the node N1 stored in the registration server 4101 is asynchronous link information, the asynchronous link information indicates that information transfer for the service a between the node N1 and its subordinate node N4 is to be performed through the asynchronous link AL 14; if the link control information of the node N1 is the synchronous link information, the synchronous link information indicates that information transfer for the service a between the node N1 and its subordinate node N4 is to be performed through the synchronous link SL 14. Each of the nodes N1 through N9 may subscribe to the registration server 4101 for respective link control information, and the registration server 4101 may transmit the link control information after change to the corresponding node in response to the change in the link control information of the node.
In the initial stage, the registration server 4101 may default that the link control information of the nodes N1 to N9 are all synchronous link information, so as to control the transmission of the service related information between the nodes through the synchronous link SL.
In the process of handling the service, in response to the status information of the node N7 indicating that the node N7 is abnormal, for example, the registration server 4101 may provide the status information of the node N7 where the abnormality occurs to the link control server 4102. The link control server 4102 determines the upper nodes of the node N7 to be N4, N5 and N6 according to the service link information registered in the registration server 4101. The link control server 4102 determines at least one service as a target service among the plurality of services to be processed by the node N7, for example, determines service a, which is processed by the service link N1 → N4 → N7 among the services A, B, C, as the target service, and modifies link control information between the node N4 and the node N7 from synchronous link information to asynchronous link information for the service a. In response to the change of the link control information, the registration server 4101 sends the changed link control information, i.e., asynchronous link information, to the node N4 which has subscribed to the link control information. Node N4 switches the link between node N4 and N7 for service a from the synchronous link SL47 to the asynchronous link AL47 according to the asynchronous link information, and uses the asynchronous link AL47 to convey information about service a to node N7.
In some embodiments, the link control server may also calculate a handover proportion, which may be determined by an adaptive random Gradient descent (SGD) algorithm, for example, according to the number of services successfully processed by the distributed system per unit time. The handover proportion may indicate a number of target services of the plurality of services to be handed over to the asynchronous link for access. The link control server may determine at least one service as a target service among the plurality of services to be processed for the abnormal node according to the calculated handover ratio. Compared with the traditional switching method for switching the service with a fixed proportion to the asynchronous queue link for processing, the method can relieve or even avoid the problem that the service success rate is easy to generate larger fluctuation caused by link switching, and realize more gradual current limiting.
In some embodiments, a state collector and a link controller may be deployed in each node. The state collector and the link controller may be program modules deployed in the nodes. In some embodiments, the state collector and the link controller may also be hardware modules or a combination of software and hardware modules.
The state collector is used for collecting the state information of the node where the state collector is located, and can comprise an initialization unit, a communication unit and a node state collection unit. The initialization unit is responsible for initializing the state collector, the communication unit is responsible for communicating the state collector with the registration server, and the node state collection unit is responsible for collecting the state of the node system. The state collector can obtain key system performance indexes such as CPU (Central processing Unit) use state, memory use state, thread pool, database connection pool and the like in the node in real time, and transmits the collected data to the registration center to finish the node state information report. For example, if the CPU utilization rate of a certain node is increased and exceeds the preset CPU utilization rate threshold value by 80%, the state collector can report the information to the registration center to complete node information collection.
The link controller is used for switching a service link of the node, and may include an initialization unit, a communication unit, a link registration unit, and a link switching unit. The initialization unit is responsible for initializing the transaction link controller, and the communication unit is responsible for communicating with the registration server. And the link registration unit is used for connecting the registration server when the service is normally processed by the RPC link, and finishing the registration of the upstream link information of the node. The link switching unit is responsible for acquiring link control information and switching a service link between the link switching unit and a lower node according to the link control information, so that the service ratio switched to the asynchronous queue is adjusted in real time according to the calculated flow switching ratio.
Although the above embodiments have been described by taking an example in which the control center includes the registration server and the link control server, embodiments of the present disclosure are not limited thereto. The control center may have other configurations as desired, for example, may be implemented to include multiple registration servers and multiple link control servers, or to also include other computing devices, or may be implemented by one computing device having a processor and memory.
The operational flow of the distributed system of the embodiment of the present disclosure will be described below with reference to fig. 5 in conjunction with fig. 4.
Fig. 5 schematically illustrates a flow chart of operation of a distributed system according to an embodiment of the present disclosure.
As the service traverses the synchronization link, the nodes in the link register respective link information with the registration server in operation S501. For example, the service has synchronous access via the RPC link when the distributed system is in an initial state or a normal state. The service link collects the link information of the service through each node and registers the link information to the service link information of the registration server.
In operation S502, the node collects self status information and registers to the registration server. For example, each node in the distributed system collects its own state information in real time, and the state information may be various information capable of reflecting the pressure-bearing condition of the node, including but not limited to performance indexes such as CPU load, IO load, memory usage rate, GC frequency, thread number, and the like. And if the performance index in the state information is normal, reporting that the state of the node of the registration server is normal. And if the performance index in the state information exceeds a threshold value, reporting that the state of the registration server node is abnormal.
In operation S503, the link control server finds an abnormal node according to the state information, traces back a superior node, determines a switching ratio, and modifies the link control information. For example, the link control server may subscribe to individual node state information from the registration server. If the node state is abnormal, according to the service link information, the superior service link of the node is obtained from the registration server, the switching proportion is calculated, and the link control information corresponding to the link in the registration server is changed. When the node state is abnormal, switching the link control information of the superior node into asynchronous link information; when the node is normal, the link control information of the superior node is switched to synchronous link information.
In some embodiments, the link control server may calculate the handover ratio according to an adaptive SGD algorithm. Because the self-adaptive SGD algorithm continuously carries out iterative calculation on the switching proportion, and the switching proportion is continuously adjusted, the link control server can continuously adjust the service proportion switched into the asynchronous queue link so as to optimize the throughput of a distributed system and provide a self-recovery time window for the abnormal node.
The process of calculating the handover ratio according to the adaptive SGD algorithm may include a parameter setting process and an iterative calculation process.
In the parameter setting process, a parameter w to be optimized, an objective function f (x) and an initial learning rate alpha are set.
The parameter w to be optimized is the switching ratio, and the initial value of w is set to 1, that is, the switching ratio is 100%.
The objective function is f (x) ═ tps · m, where tps is the number of transactions processed by the system in unit time, tps is the throughput of the system in unit time, and m is the system success rate of transactions in unit time. Thus, the value of f (x) is the number of transactions successfully processed by the system in unit time, and is used for measuring the effect value of parameter tuning.
The initial learning rate is specified as 0.99 for alpha default. Next iteration parameter value wn+1Is equal to 0.99 times the value w of the parameter of the current iterationn. And 0.01 is the step size of parameter adjustment of each iteration.
After the setting is finished, performing an iterative calculation process to iteratively optimize the switching ratio parameter, wherein each iteration executes the following steps:
calculating the gradient of the objective function relative to the current parameters, namely calculating the gradient of the transaction system success rate and the transaction processing duration under the current switching proportion:
calculating a descending gradient from the calculated gradient and the learning rate α: etat＝α·gt；
Updating parameters according to the gradient of descent: w is at+1＝wt-ηt；
Adjusting the switching ratio to wt+1New parameter value wt+1Into step 1, i.e. wt+1Proportional transactions are switched into the asynchronous queue transaction link processing.
In operation S504, the upper node switches the link to the asynchronous link according to the subscribed link control information. For example, each node may subscribe to link control information with the registration server. When the corresponding link control information generation table is updated, the lower link is switched. Here, there are two cases of link switching: switching from an asynchronous link to a synchronous link, and switching from a synchronous link to an asynchronous link. For any node, if the link control information is changed from synchronous link information to asynchronous link information, pushing one or more services into an asynchronous message queue according to the currently calculated switching proportion to access through an asynchronous link, and enabling the rest services to still access through the synchronous link; if the link control information changes from asynchronous link information to synchronous link information, asynchronous link access is resumed.
Before the abnormal node is recovered to normal, the upper node continuously acquires the switching proportion and adjusts the proportion of switching into the asynchronous link processing service. Among the services to be processed by the abnormal node, one part of the services are provided for the abnormal node through an asynchronous link in an asynchronous queue message pushing mode, and the other part of the services can still be accessed through an RPC synchronous link, so that the service volume borne by the abnormal node is greatly reduced. After the abnormal node acquires the asynchronous queue push message, if the service in the message is overtime, returning a service overtime result to the access node; and if the service is not overtime, normal service processing is carried out.
In operation S505, the link control server modifies the link control information to control the upper node to switch back to the synchronous link in response to the abnormal node returning to normal. For example, since a certain proportion of services have been switched to asynchronous queue links, the abnormal node pressure bearing is reduced, and the node state returns to normal. And the state information of the node in the registration server is changed into normal, and the link control server switches the link control information in the registration server from the asynchronous link back to the RPC synchronous link, so that the corresponding node is switched to the RPC synchronous link for processing.
According to the embodiment of the disclosure, whether performance deterioration trend exists in each node in the distributed system can be monitored in real time, and after a fault node is found, an access request is switched to an asynchronous queue transaction link for processing. By introducing the adaptive SGD algorithm to calculate the switching proportion of the service in an iterative manner, the proportion is switched in real time according to the system processing condition, and more gradual current limiting can be realized. When the pressure of the fault node is relieved, the method can also switch the service to a normal RPC link, and smoothly complete the synchronous and asynchronous switching of the service link. The method of the embodiment of the disclosure can improve the throughput of the system, enable the system to spend a mass service access time period, and also can alleviate or even eliminate severe fluctuation of the service success rate during link switching.
Fig. 6 schematically illustrates a block diagram of an apparatus for information transfer according to an embodiment of the present disclosure. The apparatus for information transfer may implement the method performed by the control center described above.
As shown in fig. 6, the apparatus 600 for information transfer includes a registration module 610, a trace back module 620, and a control module 630.
The registration module 610 may obtain service link information for a plurality of nodes and state information for each node in the distributed system. The trace back module 620 may determine, in response to the state information of any node indicating that the node is an abnormal node, one or more upper nodes of the abnormal node according to the service link information. The control module 730 may switch a link between the abnormal node and at least one of the upper nodes from a synchronous link to an asynchronous link for a target service among a plurality of services to be processed by the abnormal node, for transferring information on the target service.
Fig. 7 schematically illustrates a block diagram of an apparatus for information transfer according to an embodiment of the present disclosure. The apparatus for information transfer may implement the method performed by any of the nodes described above.
As shown in fig. 7, the apparatus 700 for information transfer includes an information collection module 710, a link control module 720, and a service processing module 730.
The information collection module 710 may send service link information and current state information for the node. The link control module 720 may receive link control information for the node and set a link between the node and a lower node of the node as a synchronous link or an asynchronous link according to the received link control information. The service processing module 730 may transfer information on the service to the lower node through the set link.
Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.
For example, any of the registration module 610, the trace back module 620, and the control module 630 may be combined and implemented in one module, or any one of them may be split into multiple modules. Any number of the information collection module 710, the link control module 720, and the service processing module 730 may be combined into one module to be implemented, or any one of the modules may be split into multiple modules. At least part of the functionality of one or more of these modules may be combined with at least part of the functionality of other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the registration module 610, the trace back module 620, and the control module 630 and/or at least one of the information collection module 710, the link control module 720, and the service processing module 730 may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented by hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or implemented by any one of three manners of software, hardware, and firmware, or by a suitable combination of any of them. Alternatively, at least one of the registration module 610, the trace back module 620 and the control module 630 and/or at least one of the information collection module 710, the link control module 720 and the service handling module 73 may be implemented at least in part as computer program modules that, when executed, perform corresponding functions.
FIG. 8 schematically shows a block diagram of an electronic device according to an embodiment of the disclosure. The electronic device shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 8, an electronic device 800 according to an embodiment of the present disclosure includes a processor 801 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. The processor 801 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 801 may also include onboard memory for caching purposes. The processor 801 may include a single processing unit or multiple processing units for performing different actions of the method flows according to embodiments of the present disclosure.
In the RAM 803, various programs and data necessary for the operation of the system 800 are stored. The processor 801, the ROM 802, and the RAM 803 are connected to each other by a bus 804. The processor 801 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 802 and/or RAM 803. Note that the programs may also be stored in one or more memories other than the ROM 802 and RAM 803. The processor 801 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program, when executed by the processor 801, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/electronic device described in the above embodiments; or may exist separately and not be incorporated into the device/electronic apparatus. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include the ROM 802 and/or RAM 803 described above and/or one or more memories other than the ROM 802 and RAM 803.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
It should be noted that the information delivery method and apparatus provided by the embodiments of the present disclosure may be used in the financial field, and may also be used in any field other than the financial field, for example, the computer field, the internet field, and the like.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.
Claims (13)
1. A method of information transfer, the method comprising:
acquiring service link information of a plurality of nodes and state information of each node in a distributed system;
responding to the state information of any node to indicate that the node is an abnormal node, and determining one or more superior nodes of the abnormal node according to the service link information; and
switching a link between the abnormal node and at least one of the superior nodes from a synchronous link to an asynchronous link for a target service among a plurality of services to be processed by the abnormal node, for transferring information on the target service.
2. The method of claim 1, further comprising:
presetting a synchronous link and an asynchronous link between two adjacent levels of nodes in the plurality of nodes; and
link control information is prestored for each node, the link control information being synchronous link information indicating that information is transferred using a synchronous link between the node and a lower node of the node or asynchronous link information indicating that information is transferred using an asynchronous link between the node and a lower node of the node.
3. The method of claim 2, wherein the switching the link between the abnormal node and at least one of the superordinate nodes from a synchronous link to an asynchronous link comprises:
and modifying the link control information aiming at least one superior node from synchronous link information to asynchronous link information, and sending the link control information to at least one superior node.
4. The method of claim 1, further comprising:
determining a switching proportion through a self-adaptive random gradient descent algorithm according to the service quantity successfully processed by the distributed system in unit time; and
and determining at least one service as a target service in the plurality of services to be processed aiming at the abnormal node according to the switching proportion.
5. The method of claim 1, further comprising: after switching the link between the abnormal node and at least one of the upper nodes from the synchronous link to the asynchronous link,
and in response to the state information of the abnormal node indicating that the abnormal node is recovered to be normal, switching the link between the node recovered to be normal and at least one upper node from an asynchronous link to a synchronous link.
6. The method of any of claims 1-5, wherein the state information of the node comprises at least one of a CPU usage state, a memory usage state, an input-output load, a garbage collection frequency, a thread pool state, and a database connection pool state of the node.
7. An information delivery method performed by a node in a distributed system, the method comprising:
sending service link information and current state information of the node;
receiving link control information for the node, and setting a link between the node and a lower node of the node as a synchronous link or an asynchronous link according to the received link control information; and
and transferring information on the service to the lower node through the set link.
8. The method of claim 7, the setting a link between the node and a lower node of the node as a synchronous link or an asynchronous link according to the received link control information, and transferring information on a service to the lower node through the set link comprises:
setting a link between the node and a lower node of the node as a synchronous link in response to the received link control information synchronous link information; and
setting a link between the node and a lower node of the node as an asynchronous link in response to the received link control information asynchronous link information.
9. The method of claim 7, further comprising: determining whether a service times out after setting a link between the node and a lower node of the node as an asynchronous link and before transferring information on the service to the lower node through the asynchronous link,
an operation in which, in a case where the service has not timed out, information on the service is transferred to the lower node through the asynchronous link.
10. An apparatus for information transfer, comprising:
the registration module is used for acquiring service link information of a plurality of nodes in the distributed system and state information of each node;
the tracing module is used for responding to the state information of any node to indicate that the node is an abnormal node and determining one or more superior nodes of the abnormal node according to the service link information;
a control module for switching a link between the abnormal node and at least one of the upper nodes from a synchronous link to an asynchronous link for a target service among a plurality of services to be processed by the abnormal node, for transferring information on the target service.
11. An apparatus for information transfer, comprising:
the information acquisition module is used for sending the service link information and the current state information of the node;
a link control module for receiving link control information for the node and setting a link between the node and a lower node of the node as a synchronous link or an asynchronous link according to the received link control information; and
a service processing module for transferring information on a service to the lower node through the set link.
12. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-9.
13. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method of any one of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110202388.3A CN112948207B (en) | 2021-02-23 | 2021-02-23 | Information transfer method, device, electronic equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110202388.3A CN112948207B (en) | 2021-02-23 | 2021-02-23 | Information transfer method, device, electronic equipment and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112948207A true CN112948207A (en) | 2021-06-11 |
| CN112948207B CN112948207B (en) | 2024-06-18 |
Family
ID=76245619
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110202388.3A Active CN112948207B (en) | 2021-02-23 | 2021-02-23 | Information transfer method, device, electronic equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112948207B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116756044A (en) * | 2023-08-11 | 2023-09-15 | 杭州罗莱迪思科技股份有限公司 | RPC remote debugging method, device and application based on data link tracking |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1333968A (en) * | 1998-11-24 | 2002-01-30 | 艾利森电话股份有限公司 | Multi-media protocol for slot-based communication systems |
| CN101378359A (en) * | 2008-10-06 | 2009-03-04 | 中兴通讯股份有限公司 | Method and apparatus for switching of primary and secondary compulsion links |
| US20100322081A1 (en) * | 2009-06-17 | 2010-12-23 | Fujitsu Limited | Abnormality locating method and apparatus, and computer-readable storage medium |
| CN106600049A (en) * | 2016-12-09 | 2017-04-26 | 国网北京市电力公司 | Path generation method and apparatus thereof |
| CN108024288A (en) * | 2016-11-04 | 2018-05-11 | 电信科学技术研究院 | A kind of information processing method and device |
| CN109324954A (en) * | 2018-11-06 | 2019-02-12 | 阿里巴巴集团控股有限公司 | A kind of large-size screen monitors chain-circuit system detection method, device and equipment |
| CN109981454A (en) * | 2019-03-29 | 2019-07-05 | 中国人民银行清算总中心 | The broadcast controlling method and device of dynamic routing broadcasting packet |
| CN110087215A (en) * | 2019-05-06 | 2019-08-02 | 北京百度网讯科技有限公司 | Information broadcasting method and device based on Bluetooth connection, terminal and storage medium |
| CN110503385A (en) * | 2019-07-15 | 2019-11-26 | 招联消费金融有限公司 | Method for processing business, device, computer equipment and storage medium |
| CN111294784A (en) * | 2020-05-13 | 2020-06-16 | 深圳市汇顶科技股份有限公司 | Data transmission method, device, chip, electronic equipment and storage medium |
| CN111385122A (en) * | 2018-12-29 | 2020-07-07 | 广州市百果园信息技术有限公司 | Distributed system link tracking method and device, computer equipment and storage medium |
| WO2020147419A1 (en) * | 2019-01-18 | 2020-07-23 | 深圳壹账通智能科技有限公司 | Monitoring method and apparatus, computer device and storage medium |
| CN111767194A (en) * | 2020-07-08 | 2020-10-13 | 中国工商银行股份有限公司 | Information processing method, information processing apparatus, electronic device, and medium |
| CN111897878A (en) * | 2020-08-25 | 2020-11-06 | 中国工商银行股份有限公司 | Main and auxiliary data synchronization method and system |
| CN111970168A (en) * | 2020-08-11 | 2020-11-20 | 北京点众科技股份有限公司 | Method and device for monitoring full-link service node and storage medium |
| WO2020233066A1 (en) * | 2019-05-20 | 2020-11-26 | 深圳壹账通智能科技有限公司 | Abnormity processing method based on data computation link, and related device |
-
2021
- 2021-02-23 CN CN202110202388.3A patent/CN112948207B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1333968A (en) * | 1998-11-24 | 2002-01-30 | 艾利森电话股份有限公司 | Multi-media protocol for slot-based communication systems |
| CN101378359A (en) * | 2008-10-06 | 2009-03-04 | 中兴通讯股份有限公司 | Method and apparatus for switching of primary and secondary compulsion links |
| US20100322081A1 (en) * | 2009-06-17 | 2010-12-23 | Fujitsu Limited | Abnormality locating method and apparatus, and computer-readable storage medium |
| CN108024288A (en) * | 2016-11-04 | 2018-05-11 | 电信科学技术研究院 | A kind of information processing method and device |
| CN106600049A (en) * | 2016-12-09 | 2017-04-26 | 国网北京市电力公司 | Path generation method and apparatus thereof |
| CN109324954A (en) * | 2018-11-06 | 2019-02-12 | 阿里巴巴集团控股有限公司 | A kind of large-size screen monitors chain-circuit system detection method, device and equipment |
| CN111385122A (en) * | 2018-12-29 | 2020-07-07 | 广州市百果园信息技术有限公司 | Distributed system link tracking method and device, computer equipment and storage medium |
| WO2020147419A1 (en) * | 2019-01-18 | 2020-07-23 | 深圳壹账通智能科技有限公司 | Monitoring method and apparatus, computer device and storage medium |
| CN109981454A (en) * | 2019-03-29 | 2019-07-05 | 中国人民银行清算总中心 | The broadcast controlling method and device of dynamic routing broadcasting packet |
| CN110087215A (en) * | 2019-05-06 | 2019-08-02 | 北京百度网讯科技有限公司 | Information broadcasting method and device based on Bluetooth connection, terminal and storage medium |
| WO2020233066A1 (en) * | 2019-05-20 | 2020-11-26 | 深圳壹账通智能科技有限公司 | Abnormity processing method based on data computation link, and related device |
| CN110503385A (en) * | 2019-07-15 | 2019-11-26 | 招联消费金融有限公司 | Method for processing business, device, computer equipment and storage medium |
| CN111294784A (en) * | 2020-05-13 | 2020-06-16 | 深圳市汇顶科技股份有限公司 | Data transmission method, device, chip, electronic equipment and storage medium |
| CN111767194A (en) * | 2020-07-08 | 2020-10-13 | 中国工商银行股份有限公司 | Information processing method, information processing apparatus, electronic device, and medium |
| CN111970168A (en) * | 2020-08-11 | 2020-11-20 | 北京点众科技股份有限公司 | Method and device for monitoring full-link service node and storage medium |
| CN111897878A (en) * | 2020-08-25 | 2020-11-06 | 中国工商银行股份有限公司 | Main and auxiliary data synchronization method and system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116756044A (en) * | 2023-08-11 | 2023-09-15 | 杭州罗莱迪思科技股份有限公司 | RPC remote debugging method, device and application based on data link tracking |
| CN116756044B (en) * | 2023-08-11 | 2023-11-21 | 杭州罗莱迪思科技股份有限公司 | RPC remote debugging method, device and application based on data link tracking |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112948207B (en) | 2024-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109218355B (en) | Load balancing engine, client, distributed computing system and load balancing method | |
| CN112069265B (en) | Synchronization method of configuration data, business data system, computer system and medium | |
| US7444459B2 (en) | Methods and systems for load balancing of virtual machines in clustered processors using storage related load information | |
| CN107592345B (en) | Transaction current limiting device, method and transaction system | |
| JP2023025146A (en) | Distributed type training method based on end-to-end self-adaptation, device, and apparatus | |
| US10417062B2 (en) | Method and apparatus of unloading out of memory processing flow to user space | |
| CN110300188B (en) | Data transmission system, method and device | |
| JP2023520057A (en) | METHOD, APPARATUS, ELECTRONIC DEVICE, SYSTEM AND STORAGE MEDIUM FOR MICROSERVICE COMPOSITION | |
| CN112995307B (en) | Log processing method, system, device, electronic equipment and storage medium | |
| CN110490316B (en) | Training processing method and training system based on neural network model training system | |
| CN110784530A (en) | Gray scale publishing method and server | |
| CN111625592A (en) | Load balancing method and device for distributed database | |
| CN112948207B (en) | Information transfer method, device, electronic equipment and medium | |
| CN114691372A (en) | Group intelligent control method of multimedia end edge cloud system | |
| US10616331B1 (en) | Managing remote replication in storage systems | |
| CN116382892B (en) | Load balancing method and device based on multi-cloud fusion and cloud service | |
| WO2023061329A1 (en) | Communication method applied to computer cluster, and communication apparatus | |
| US11106680B2 (en) | System, method of real-time processing under resource constraint at edge | |
| CN110751560B (en) | Transaction processing method and device, electronic equipment and readable storage medium | |
| US11537440B2 (en) | Infrastructure adaptive consistency level mechanism | |
| WO2021214863A1 (en) | Distributed processing system and distributed processing method | |
| US20170289286A1 (en) | Allocating bandwidth between network computing devices for pushing data to a client computing device | |
| CN110018906A (en) | Dispatching method, server and scheduling system | |
| US11695849B2 (en) | Transaction tracking for high availability architecture using a tracking token and middleware instance information | |
| US10459637B2 (en) | Storage device and information processor |
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 |