Method and device for parallel processing and calculation of time delay information of multiple server nodes

Abstract

The invention relates to the technical field of software development, and discloses a method and device for parallel processing and calculation of time delay information of multiple server nodes, and the method comprises the steps: creating a plurality of communication instances for a target server through a transit server node information set deployed by a rear-end server, the target server being a plurality of servers having communication requirements, the transit server node information set comprises a plurality of pieces of transit server node information, and each communication instance corresponds to one piece of transit server node information; matching the communication examples of all the target servers according to the transit server node information corresponding to all the communication examples of all the target servers to obtain one or more communication example matching groups; the time delay information of the server node corresponding to each communication instance matching group is calculated by obtaining the timestamp information of each communication instance matching group. Therefore, by implementing the method, the calculation of the time delay information of the server node can be accelerated through a multi-communication instance mode.

Description

Technical Field

[0001] This invention relates to the field of software development technology, and in particular to a method and apparatus for parallel processing and computation of latency information of multiple server nodes. Background Technology

[0002] As cloud computing and distributed systems expand in scale and the number of server nodes surges, it becomes necessary to obtain latency information for each server node in order to calculate the response speed and service quality of the communication system.

[0003] Currently, using centralized or serial processing to calculate the latency information of each server is a common method for calculating server node latency information.

[0004] However, practice has shown that existing latency information calculation methods simply involve a single management node sequentially collecting status data from each server and calculating latency accordingly, or each server calculating latency independently and then reporting it to the management node. This approach tends to result in slow latency information calculation speeds, leading to long latency information acquisition cycles and poor real-time performance, which fails to meet the need for rapid node performance awareness in dynamic network environments. Therefore, proposing a technical solution to accelerate the calculation of server node latency information is particularly important. Summary of the Invention This invention provides a method and apparatus for parallel processing and computing latency information of multiple server nodes, which can accelerate the computing of server node latency information, meet the need for rapid perception of node performance in dynamic network environments, and improve the speed and efficiency of computing communication system response and service quality.

[0005] To address the aforementioned technical problems, the first aspect of this invention discloses a method for parallel processing and computation of latency information of multiple server nodes, the method comprising: Multiple communication instances are created for the target server by using the relay server node information set deployed on the backend server. The target server consists of multiple servers with communication requirements. The relay server node information set includes multiple relay server node information, and each communication instance corresponds to one of the relay server node information. Based on the relay server node information corresponding to all communication instances of all the target servers, the communication instances of all the target servers are matched to obtain one or more communication instance matching groups; By obtaining the timestamp information of each communication instance matching group, the latency information of the server node corresponding to each communication instance matching group is calculated.

[0006] As an optional implementation, in the first aspect of the present invention, all the target servers include at least a first server and a second server, all the communication instances of the first server are denoted as first communication instances, and all the communication instances of the second server are denoted as second communication instances; The relay server node information includes the node identifier of the relay server node and the key-value pairs of the relay server node; And, the step of matching all communication instances of all target servers based on the relay server node information corresponding to all communication instances of all target servers to obtain one or more communication instance matching groups includes: Based on the node identifiers of the relay server nodes corresponding to all the first communication instances and the node identifiers of all the second communication instances, all the first communication instances and all the second communication instances are integrated to obtain one or more communication instance similarity groups. All communication instances in the same communication instance similarity group correspond to the same node identifier. Based on the key-value pairs corresponding to all communication instances in all the communication instance similarity groups, all communication instance similarity groups that meet the preset matching conditions are selected from all the communication instance similarity groups and used as communication instance matching groups.

[0007] As an optional implementation, in the first aspect of the present invention, the step of filtering out all communication instance similarity groups that satisfy preset matching conditions from all the communication instance similarity groups based on the key-value pairs corresponding to all communication instances in all the communication instance similarity groups, as communication instance matching groups, includes: For each communication instance similarity group, based on the key-value pairs corresponding to the communication instance similarity group, it is determined whether the first communication instance and the second communication instance within the communication instance similarity group meet the preset matching conditions; When it is determined that the first and second communication instances in the communication instance similarity group do not meet the matching conditions, the communication instance similarity group is excluded. When it is determined that the first and second communication instances within the communication instance similarity group meet the matching conditions, the communication instance similarity group is determined as the communication instance matching group.

[0008] As an optional implementation, in the first aspect of the present invention, the key-value pairs include domain name key-value pairs and / or channel key-value pairs; And, for each communication instance similarity group, determining whether the first and second communication instances within the communication instance similarity group meet preset matching conditions based on the key-value pairs corresponding to the communication instance similarity group includes: For each communication instance similarity group, based on the domain name key-value pair corresponding to the communication instance similarity group, it is determined whether the domain name key-value pair of the first communication instance and the domain name key-value pair of the second communication instance within the communication instance similarity are the same, which is recorded as the first condition; For each communication instance similarity group, based on the channel key-value pair corresponding to the communication instance similarity group, it is determined whether the channel key-value pair of the first communication instance and the channel key-value pair of the second communication instance within the communication instance similarity are the same, which is recorded as the second condition; Specifically, if at least one of the first condition and the second condition is not met, it is determined that the first communication instance and the second communication instance in the similarity group of the communication instances do not meet the preset matching conditions.

[0009] As an optional implementation, in the first aspect of the present invention, the step of obtaining the timestamp information of each communication instance matching group and calculating the latency information of the server node corresponding to each communication instance matching group includes: Based on the communication requirements of all the target servers, a sending server for sending and a receiving server for receiving are determined from each of the target servers. According to each of the communication instance matching groups, a communication connection is established between the sending server and the receiving server regarding the communication instance matching group; By obtaining the timestamp information of the sending server and the receiving server when establishing a communication connection for each communication instance matching group, the latency information of the server node corresponding to each communication instance matching group is calculated.

[0010] As an optional implementation, in the first aspect of the present invention, the step of calculating the latency information of the server node corresponding to each communication instance matching group by obtaining the timestamp information of the sending server and the receiving server when establishing the communication connection of each communication instance matching group includes: For each of the communication instance matching groups, obtain the first timestamp of the heartbeat message sent by the sending server to the receiving server from the communication instance in the communication instance matching group; Obtain the second timestamp of the communication instance within the communication instance matching group that the receiving server sends a response message to the sending server after receiving the heartbeat message; The difference between the first timestamp and the second timestamp is calculated to obtain the latency information of the server node corresponding to the matching group of the communication instance.

[0011] As an optional implementation, in the first aspect of the invention, the creation of multiple communication instances for the target server through the relay server node information set deployed by the backend server includes: The backend server deploys a set of relay server node information and sends the set of relay server node information to the target server; The target server receives the relay server node information set sent by the backend server, and creates multiple target subtasks of the target server's main target task based on the relay server node information set. The target server allocates at least one of the relay server node information from the relay server node information set for each target subtask; The target server creates all communication instances corresponding to each target subtask based on the relay server node information allocated to each target subtask.

[0012] A second aspect of the present invention discloses an apparatus for parallel processing and computation of latency information of multiple server nodes, the apparatus comprising: A creation module is used to create multiple communication instances for a target server using a set of relay server node information deployed on a backend server. The target server consists of multiple servers with communication requirements. The set of relay server node information includes multiple relay server node information, and each communication instance corresponds to one of the relay server node information. The matching module is used to match the communication instances of all the target servers based on the relay server node information corresponding to all the communication instances of all the target servers, and obtain one or more communication instance matching groups. The calculation module is used to calculate the latency information of the server node corresponding to each communication instance matching group by obtaining the timestamp information of each communication instance matching group.

[0013] As an optional implementation, in the second aspect of the present invention, all the target servers include at least a first server and a second server, all the communication instances of the first server are denoted as first communication instances, and all the communication instances of the second server are denoted as second communication instances; The relay server node information includes the node identifier of the relay server node and the key-value pairs of the relay server node; Furthermore, the specific method by which the matching module matches the communication instances of all the target servers based on the relay server node information corresponding to all the communication instances of all the target servers to obtain one or more communication instance matching groups includes: Based on the node identifiers of the relay server nodes corresponding to all the first communication instances and the node identifiers of all the second communication instances, all the first communication instances and all the second communication instances are integrated to obtain one or more communication instance similarity groups. All communication instances in the same communication instance similarity group correspond to the same node identifier. Based on the key-value pairs corresponding to all communication instances in all the communication instance similarity groups, all communication instance similarity groups that meet the preset matching conditions are selected from all the communication instance similarity groups and used as communication instance matching groups.

[0014] As an optional implementation, in a second aspect of the present invention, the matching module filters out all communication instance similarity groups that satisfy preset matching conditions from all the communication instance similarity groups based on the key-value pairs corresponding to all communication instances in all the communication instance similarity groups. Specific methods for selecting communication instance matching groups include: For each communication instance similarity group, based on the key-value pairs corresponding to the communication instance similarity group, it is determined whether the first communication instance and the second communication instance within the communication instance similarity group meet the preset matching conditions; When it is determined that the first and second communication instances in the communication instance similarity group do not meet the matching conditions, the communication instance similarity group is excluded. When it is determined that the first and second communication instances within the communication instance similarity group meet the matching conditions, the communication instance similarity group is determined as the communication instance matching group.

[0015] As an optional implementation, in a second aspect of the invention, the key-value pairs include domain name key-value pairs and / or channel key-value pairs; Furthermore, the specific method by which the matching module determines whether the first and second communication instances within each communication instance similarity group meet the preset matching conditions based on the key-value pairs corresponding to that communication instance similarity group includes: For each communication instance similarity group, based on the domain name key-value pair corresponding to the communication instance similarity group, it is determined whether the domain name key-value pair of the first communication instance and the domain name key-value pair of the second communication instance within the communication instance similarity are the same, which is recorded as the first condition; For each communication instance similarity group, based on the channel key-value pair corresponding to the communication instance similarity group, it is determined whether the channel key-value pair of the first communication instance and the channel key-value pair of the second communication instance within the communication instance similarity are the same, which is recorded as the second condition; Specifically, if at least one of the first condition and the second condition is not met, it is determined that the first communication instance and the second communication instance in the similarity group of the communication instances do not meet the preset matching conditions.

[0016] As an optional implementation, in the second aspect of the present invention, the specific method by which the calculation module calculates the latency information of the server node corresponding to each communication instance matching group by obtaining the timestamp information of each communication instance matching group includes: Based on the communication requirements of all the target servers, a sending server for sending and a receiving server for receiving are determined from each of the target servers. According to each of the communication instance matching groups, a communication connection is established between the sending server and the receiving server regarding the communication instance matching group; By obtaining the timestamp information of the sending server and the receiving server when establishing a communication connection for each communication instance matching group, the latency information of the server node corresponding to each communication instance matching group is calculated.

[0017] As an optional implementation, in a second aspect of the present invention, the specific method by which the calculation module calculates the latency information of the server node corresponding to each communication instance matching group by obtaining the timestamp information of the sending server and the receiving server when establishing the communication connection for each communication instance matching group includes: For each of the communication instance matching groups, obtain the first timestamp of the heartbeat message sent by the sending server to the receiving server from the communication instance in the communication instance matching group; Obtain the second timestamp of the communication instance within the communication instance matching group that the receiving server sends a response message to the sending server after receiving the heartbeat message; The difference between the first timestamp and the second timestamp is calculated to obtain the latency information of the server node corresponding to the matching group of the communication instance.

[0018] As an optional implementation, in the second aspect of the present invention, the specific method by which the creation module creates multiple communication instances for the target server through the relay server node information set deployed on the backend server includes: The backend server deploys a set of relay server node information and sends the set of relay server node information to the target server; The target server receives the relay server node information set sent by the backend server, and creates multiple target subtasks of the target server's main target task based on the relay server node information set. The target server allocates at least one of the relay server node information from the relay server node information set for each target subtask; The target server creates all communication instances corresponding to each target subtask based on the relay server node information allocated to each target subtask.

[0019] A third aspect of the present invention discloses another apparatus for parallel processing and computing latency information of multiple server nodes, the apparatus comprising: Memory containing executable program code; A processor coupled to the memory; The processor calls the executable program code stored in the memory to execute the method for parallel processing and calculating latency information of multiple server nodes disclosed in the first aspect of the present invention.

[0020] The fourth aspect of the present invention discloses a computer storage medium storing computer instructions, which, when invoked, are used to execute the method for parallel processing and calculation of latency information of multiple server nodes disclosed in the first aspect of the present invention.

[0021] Compared with the prior art, the embodiments of the present invention have the following beneficial effects: In this embodiment of the invention, multiple communication instances are created for the target server using a set of relay server node information deployed on the backend server. The target server consists of multiple servers with communication requirements. The set of relay server node information includes multiple relay server node information, and each communication instance corresponds to one relay server node information. Based on the relay server node information corresponding to all communication instances of all target servers, the communication instances of all target servers are matched to obtain one or more communication instance matching groups. By obtaining the timestamp information of each communication instance matching group, the latency information of the server node corresponding to each communication instance matching group is calculated. As can be seen, implementing this invention can create multiple communication instances for target servers by using the relay server node information set deployed on the backend server. This allows for the matching of communication instances of all target servers based on the relay server node information corresponding to all communication instances of all target servers, improving the accuracy and efficiency of matching communication instances between each target server. Furthermore, by obtaining the timestamp information of each matched communication instance group, the latency information of the server node corresponding to each matched communication instance group can be calculated. This multi-communication instance approach accelerates the calculation of server node latency information, which is beneficial for meeting the need for rapid perception of node performance in dynamic network environments and for improving the speed and efficiency of the computing communication system's response speed and service quality. Attached Figure Description

[0022] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0023] Figure 1 This is a flowchart illustrating a method for parallel processing and calculating latency information of multiple server nodes, as disclosed in an embodiment of the present invention. Figure 2 This is a flowchart illustrating another method for parallel processing and calculating latency information of multiple server nodes disclosed in an embodiment of the present invention. Figure 3 This is a schematic diagram of relay server node information disclosed in an embodiment of the present invention; Figure 4 This is a schematic diagram of a framework for establishing a communication connection with a target server, as disclosed in an embodiment of the present invention. Figure 5 This is a schematic diagram of a processing flow for calculating latency information on a target server, as disclosed in an embodiment of the present invention. Figure 6 This is a schematic diagram of the structure of a device for parallel processing and computing latency information of multiple server nodes disclosed in an embodiment of the present invention; Figure 7 This is a schematic diagram of another device for parallel processing and computing latency information of multiple server nodes disclosed in an embodiment of the present invention. Detailed Implementation

[0024] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0025] The terms "first," "second," etc., used in the specification, claims, and accompanying drawings of this invention are used to distinguish different objects, not to describe a specific order. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, apparatus, product, or end that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or ends.

[0026] In this document, the term "embodiment" means that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of the invention. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a separate or alternative embodiment mutually exclusive with other embodiments. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0027] This invention discloses a method and apparatus for parallel processing and computing latency information of multiple server nodes. It can create multiple communication instances for a target server by using a set of relay server node information deployed on a backend server. Based on the relay server node information corresponding to all communication instances of all target servers, it matches the communication instances of all target servers, improving the accuracy and efficiency of matching communication instances between each target server. Furthermore, by obtaining the timestamp information of each matched communication instance group, it calculates the server node latency information corresponding to each matching group. This multi-communication instance approach accelerates the calculation of server node latency information, which is beneficial for meeting the need for rapid node performance perception in dynamic network environments and improving the speed and efficiency of the computing communication system's response speed and quality of service. Detailed descriptions follow.

[0028] Example 1 Please see Figure 1 , Figure 1 This is a flowchart illustrating a method for parallel processing and calculating latency information of multiple server nodes, as disclosed in an embodiment of the present invention. Figure 1 The described method for parallel processing and computation of latency information of multiple server nodes can be applied to an apparatus for parallel processing and computation of latency information of multiple server nodes. This apparatus may include a computing device or a computing system, and the embodiments of the present invention are not limited thereto. Figure 1 As shown, the method for parallel processing and calculating latency information of multiple server nodes may include the following operations: 101. Create multiple communication instances for the target server by using the relay server node information set deployed on the backend server.

[0029] In this embodiment of the invention, the target server is multiple servers with communication requirements, and the relay server node information set includes multiple relay server node information, with each communication instance corresponding to one of the relay server node information.

[0030] Among them, all the target servers include at least a first server and a second server, all the communication instances of the first server are denoted as the first communication instance, and all the communication instances of the second server are denoted as the second communication instance.

[0031] Optionally, the relay server node information includes the node identifier of the relay server node and the key-value pairs of the relay server node, which is not limited in this embodiment of the invention.

[0032] 102. Based on the relay server node information corresponding to all communication instances of all the target servers, match the communication instances of all the target servers to obtain one or more communication instance matching groups.

[0033] In this embodiment of the invention, specifically, based on the relay server node information corresponding to the communication instances of all target servers, the relay server node information corresponding to all communication instances of all target servers is searched. If the same relay server node information is found in all target servers, then all communication instances in all target servers that have the same relay server node information are determined as a group of communication instance matching groups corresponding to that same relay server node information. In this way, the method of searching for relay server node information can achieve accurate matching of communication instance matching groups.

[0034] 103. By obtaining the timestamp information of each of the communication instance matching groups, calculate the latency information of the server node corresponding to each of the communication instance matching groups.

[0035] In this embodiment of the invention, the timestamp information of each communication instance matching group may include the first timestamp of the first communication instance in the communication instance matching group and the second timestamp of the second communication instance in the communication instance matching group.

[0036] It is evident that implementation Figure 1 The described method for parallel processing and computing latency information of multiple server nodes can create multiple communication instances for target servers by using the relay server node information set deployed on the backend server. Based on the relay server node information corresponding to all communication instances of all target servers, the method matches communication instances of all target servers, improving the accuracy and efficiency of matching communication instances between each target server. Furthermore, by obtaining the timestamp information of each matched communication instance group, the method calculates the server node latency information corresponding to each matching communication instance group. This multi-communication instance approach accelerates the computation of server node latency information, which is beneficial for meeting the need for rapid node performance perception in dynamic network environments and for improving the speed and efficiency of the computing communication system's response speed and service quality.

[0037] In an optional embodiment, step 102 above, which involves matching the communication instances of all the target servers based on the relay server node information corresponding to all the communication instances of all the target servers to obtain one or more communication instance matching groups, may include: Based on the node identifiers of the relay server nodes corresponding to all the first communication instances and the node identifiers of all the second communication instances, all the first communication instances and all the second communication instances are integrated to obtain one or more communication instance similarity groups. All communication instances in the same communication instance similarity group correspond to the same node identifier. Based on the key-value pairs corresponding to all communication instances in all the communication instance similarity groups, all communication instance similarity groups that meet the preset matching conditions are selected from all the communication instance similarity groups and used as communication instance matching groups.

[0038] In this embodiment of the invention, optionally, the key-value pairs include domain name key-value pairs and / or channel key-value pairs. Specifically, each server node has a specific and unique IP domain name and a multi-channel KEY to form two types of key-value pairs. For example, a domain name key-value pair can be represented as {IP:xxxx}, and a channel key-value pair can be represented as {KEY:xxxxxxxxxxxx}. This embodiment of the invention does not impose any limitations.

[0039] In this embodiment of the invention, the preset matching condition can be used to indicate that the domain name key-value pairs and the channel key-value pairs of the corresponding communication instances in all target servers are the same.

[0040] As can be seen, this optional embodiment can first integrate all the first communication instances and all the second communication instances based on the node identifiers of the relay server nodes corresponding to all the first communication instances and the node identifiers of all the second communication instances to obtain one or more communication instance similarity groups. Then, based on the key-value pairs corresponding to all communication instances in all communication instance similarity groups, all communication instance similarity groups that meet the preset matching conditions are selected from all communication instance similarity groups as communication instance matching groups. By first performing preliminary matching through node identifiers and then performing precise matching and filtering through key-value pairs, the matching efficiency, speed and accuracy of communication instances between target servers can be improved, which is conducive to further improving the calculation efficiency, speed and accuracy of latency information of the server nodes corresponding to the communication instances.

[0041] In this optional embodiment, as an optional implementation, the step of filtering out all communication instance similarity groups that meet preset matching conditions from all the communication instance similarity groups based on the key-value pairs corresponding to all communication instances in all the communication instance similarity groups, as communication instance matching groups, includes: For each communication instance similarity group, based on the key-value pairs corresponding to the communication instance similarity group, it is determined whether the first communication instance and the second communication instance within the communication instance similarity group meet the preset matching conditions; When it is determined that the first and second communication instances in the communication instance similarity group do not meet the matching conditions, the communication instance similarity group is excluded. When it is determined that the first and second communication instances within the communication instance similarity group meet the matching conditions, the communication instance similarity group is determined as the communication instance matching group.

[0042] In this optional implementation, optionally, determining whether the first and second communication instances within each communication instance similarity group satisfy preset matching conditions based on the key-value pairs corresponding to the communication instance similarity group includes: For each communication instance similarity group, based on the domain name key-value pair corresponding to the communication instance similarity group, it is determined whether the domain name key-value pair of the first communication instance and the domain name key-value pair of the second communication instance within the communication instance similarity are the same, which is recorded as the first condition; For each communication instance similarity group, based on the channel key-value pair corresponding to the communication instance similarity group, it is determined whether the channel key-value pair of the first communication instance and the channel key-value pair of the second communication instance within the communication instance similarity are the same, which is recorded as the second condition; Specifically, if at least one of the first condition and the second condition is not met, it is determined that the first communication instance and the second communication instance in the similarity group of the communication instances do not meet the preset matching conditions.

[0043] Specifically, if the key-value pair only includes domain name key-value pairs, then when the first condition is met, the first and second communication instances within the corresponding communication instance similarity group are determined to meet the preset matching conditions; if the key-value pair only includes channel key-value pairs, then when the second condition is met, the first and second communication instances within the corresponding communication instance similarity group are determined to meet the preset matching conditions; if the key-value pair includes both domain name key-value pairs and channel key-value pairs, then when both the first and second conditions are met, the first and second communication instances within the corresponding communication instance similarity group are determined to meet the preset matching conditions.

[0044] As can be seen, this optional implementation can filter out all communication instance similarity groups that meet the preset matching conditions from all the communication instance similarity groups based on the domain name key-value pairs and / or channel key-value pairs corresponding to all communication instances in all the communication instance similarity groups, and use them as communication instance matching groups. This can improve the accuracy and reliability of filtering communication instance similarity groups, and is beneficial to improving the matching accuracy and reliability of communication instances between target servers.

[0045] Example 2 Please see Figure 2 , Figure 2This is a flowchart illustrating a method for parallel processing and calculating latency information of multiple server nodes, as disclosed in an embodiment of the present invention. Figure 2 The described method for parallel processing and computation of latency information of multiple server nodes can be applied to an apparatus for parallel processing and computation of latency information of multiple server nodes. This apparatus may include a computing device or a computing system, and the embodiments of the present invention are not limited thereto. Figure 2 As shown, the method for parallel processing and calculating latency information of multiple server nodes may include the following operations: 201. Create multiple communication instances for the target server by using the relay server node information set deployed on the backend server.

[0046] 202. Based on the relay server node information corresponding to all communication instances of all the target servers, match the communication instances of all the target servers to obtain one or more communication instance matching groups.

[0047] In this embodiment of the invention, for other descriptions of steps 201-202, please refer to the detailed description of steps 101-102 in Embodiment 1. These descriptions will not be repeated in this embodiment of the invention.

[0048] 203. Based on the communication requirements of all the target servers, determine from each of the target servers a sending server for sending and a receiving server for receiving.

[0049] 204. Based on each of the communication instance matching groups, establish a communication connection between the sending server and the receiving server regarding the communication instance matching group.

[0050] For example, suppose the sending server is denoted as B, which includes communication instances a1, a2, and a3, and the receiving server is denoted as C, which includes communication instances a1, a2, and a4. Then, communication instance a1 of B corresponds to communication instance a1 of C, and both B and C's communication instances a1 are grouped into communication instance matching group A1. Similarly, communication instance a2 of B corresponds to communication instance a2 of C, and both B and C's communication instances a2 are grouped into communication instance matching group A2. The communication connection established between B and C regarding communication instance matching group A1 can be as follows: B's communication instance a1 sends a heartbeat message to C's communication instance a1; upon receiving this message, C's communication instance a1 sends a response message to B's communication instance a1, thus establishing the communication connection between B and C within communication instance matching group A1.

[0051] 205. By obtaining the timestamp information of the sending server and the receiving server when establishing the communication connection of each communication instance matching group, the delay information of the server node corresponding to each communication instance matching group is calculated.

[0052] It is evident that implementation Figure 2 The described method for parallel processing and calculating latency information of multiple server nodes can create multiple communication instances for target servers by utilizing the relay server node information set deployed on the backend servers. Based on the relay server node information corresponding to all communication instances of all target servers, the method matches communication instances of all target servers, improving the accuracy and efficiency of matching communication instances between each target server. Furthermore, by obtaining the timestamp information of each matched communication instance group, the method calculates the latency information of the server nodes corresponding to each matching communication instance group. This multi-communication instance approach accelerates the calculation of server node latency information, which is beneficial for meeting the need for rapid node performance awareness in dynamic network environments and improving the speed and efficiency of the computing communication system's response speed and service quality. In addition, it can accurately determine the sending and receiving servers based on the communication requirements of the target servers, thereby quickly and accurately establishing communication connections for each matching communication instance group. By obtaining the timestamp information when establishing the communication connection for each matching communication instance group, the method calculates the latency information of the server nodes corresponding to each matching communication instance group. This multi-communication connection approach, established through the matching relationships of multiple communication instances, improves the calculation efficiency, speed, and accuracy of latency information for multiple server nodes.

[0053] In an optional embodiment, step 205 above, which involves obtaining the timestamp information of the sending server and the receiving server when establishing a communication connection for each communication instance matching group, and calculating the latency information of the server node corresponding to each communication instance matching group, includes: For each of the communication instance matching groups, obtain the first timestamp of the heartbeat message sent by the sending server to the receiving server from the communication instance in the communication instance matching group; Obtain the second timestamp of the communication instance within the communication instance matching group that the receiving server sends a response message to the sending server after receiving the heartbeat message; The difference between the first timestamp and the second timestamp is calculated to obtain the latency information of the server node corresponding to the matching group of the communication instance.

[0054] For example, communication instance a1 on end B sends a heartbeat message (the format can be customized) to communication instance a1 on end C and records the timestamp time1. Upon receiving the message, communication instance a1 on end C responds with an ACK message to communication instance a1 on end B. Communication instance a1 on end B receives the ACK message and records the timestamp time2. The connection delay to communication instance matching group A1 to which communication instance a1 belongs is calculated as time2 - time1.

[0055] As can be seen, this optional embodiment can obtain the first timestamp of the communication instance in each communication instance matching group that the sending server sends a heartbeat message to the receiving server, and obtain the second timestamp of the communication instance in the communication instance matching group that the receiving server sends a response message to the sending server after receiving the heartbeat message. The difference between the first timestamp and the second timestamp is then calculated to obtain the latency information of the server node corresponding to the communication instance matching group, thereby improving the accuracy and reliability of the latency information calculation for each server node.

[0056] In another optional embodiment, the step 201 above, which involves creating multiple communication instances for the target server using the relay server node information set deployed by the backend server, includes: The backend server deploys a set of relay server node information and sends the set of relay server node information to the target server; The target server receives the relay server node information set sent by the backend server, and creates multiple target subtasks of the target server's main target task based on the relay server node information set. The target server allocates at least one of the relay server node information from the relay server node information set for each target subtask; The target server creates all communication instances corresponding to each target subtask based on the relay server node information allocated to each target subtask.

[0057] In this embodiment of the invention, specifically, the target server determines the number of deployed servers based on the set of relay server nodes, and then creates multiple target sub-tasks for the target server's main target task based on the number of deployed servers. Specifically, when the number of deployed servers is less than or equal to a first preset threshold, a first target sub-task is created; when the number of deployed servers is greater than the first preset threshold and less than or equal to a second preset threshold, a second target sub-task is created; and when the number of deployed servers is greater than the second preset threshold and less than or equal to a third preset threshold, a third target sub-task is created.

[0058] In this embodiment of the invention, specifically, the number of communication instances corresponding to each target subtask corresponds to the number of relay server node information allocated to that target subtask. For example, if a target subtask is allocated four server nodes, then four communication instances are created for that target subtask, each corresponding to one of the allocated server nodes.

[0059] As can be seen, this optional embodiment enables the backend server to deploy a set of relay server node information and send the set of relay server node information to the target server; the target server receives the set of relay server node information sent by the backend server and creates multiple target subtasks of the target server's main task based on the set of relay server node information; the target server allocates at least one set of relay server node information to each target subtask from the set of relay server node information; and the target server creates all communication instances corresponding to each target subtask based on all the relay server node information allocated to each target subtask. This allows the main task of the target server to be accurately created into multiple subtasks through the deployed relay server node information, thereby creating all communication instances corresponding to each subtask. This is beneficial for accelerating the latency information of subsequent computing server nodes through a multi-tasking approach.

[0060] In specific embodiments of the present invention, such as... Figures 3-5 As shown, Figure 3 This is a schematic diagram of relay server node information disclosed in an embodiment of the present invention, wherein, Figure 3 This is relay server node information using node identifiers (i.e., the unique identifiers of server nodes) including "11", "22", "33", "44", "55", and "66" as examples. Figure 4 This is a schematic diagram of a framework for establishing a communication connection with a target server, as disclosed in an embodiment of the present invention. Figure 4 This is a schematic diagram of a framework with the target server including both B-end and C-end, where B-end is the remote end and C-end is the near end. Figure 4 The specific values ​​of the channel key-value pairs are provided as examples and are not intended to limit the value of the channel key-value pairs. Figure 5 This is a schematic diagram of a processing flow for calculating latency information on a target server, as disclosed in an embodiment of the present invention. Figure 5 Taking a backend server (i.e., the backend) with 6 relay server nodes deployed as an example, Figure 5 The processing flow shown applies to each target server.

[0061] Specifically, in combination Figures 3-5 The processing flow for the target server to calculate latency information is as follows: Step 1: N server nodes were deployed in the background.

[0062] Step Two: The backend sends key-value pairs of the server node's IP address and key to the remote B and near C. This is the main task. The key-value pairs can be in JSON string format, such as... Figure 3 As shown.

[0063] For example, "11" indicates a relay server deployed in region A. Its corresponding value is a nested JSON string, where the KEY and IP are a communication instance that can be established on the relay server. The relay server plays the role of transparent relay.

[0064] Step 3: The main task listens on the server side on IP 127.0.0.1 and port 22500.

[0065] It's important to note that the B-end and C-end are independent and different devices. You can think of the B-end as one main process and the C-end as another. The B-end and C-end will create their own independent sub-tasks (sub-processes), which need to communicate with the main task (i.e., the main process). The main process creates a TCP server on the local loopback address 127.0.0.1 and port 22500 to listen. Here, 127.0.0.1 is the fixed IP address of the local loopback network card, and port 22500 can be any other fixed value, such as 22600.

[0066] Step 4: Create multiple subtasks for the main task based on the number of servers deployed.

[0067] Specifically, if N ≤ 4, the first subtask is created; if N > 4 and N ≤ 8, the second subtask is created; and if N > 8 and N ≤ 12, the third subtask is created. For example, if N is 6, a total of 2 subtasks are created.

[0068] Step 5: The subtask uses (IP: 127.0.0.1 and port: 22500) to create a tcp.socket to connect to the main task.

[0069] Step Six: If there are two subtasks, the main task will receive two connections, and the main task will assign... Figure 3 The information of the server is given to each subtask, so that each subtask can be allocated a maximum of 4 server node information.

[0070] Step 7: Determine the server nodes assigned to subtask 1 as (11, 22, 33, 44), a total of four, and the server nodes assigned to subtask 2 as (55, 66), a total of two.

[0071] Step 8: Each subtask requests the SDK library file path from the main task.

[0072] Step 9: Subtask 1 loads the SDK library files, and Subtask 2 loads the SDK library files.

[0073] Step 10: In subtask 1, create four communication instances based on the four assigned server nodes; in subtask 2, create two communication instances based on the two assigned server nodes. Step 11: In subtask 1, create four threads to compute the latency information of the four communication instances in parallel; in subtask 2, create two threads to compute the latency information of the two communication instances in parallel. Step 12: For each communication instance, calculate the latency information and return it to the main task in the form of a JSON string: {"11", "18ms"}, where 11 is the unique identifier of the server node and 18ms is the corresponding latency information.

[0074] Step 13: The main task displays the latency information of the corresponding server node on the interface.

[0075] Example 3 Please see Figure 6 , Figure 6 This is a schematic diagram of the structure of a device for parallel processing and calculating latency information of multiple server nodes, as disclosed in an embodiment of the present invention. Figure 6 The described apparatus for parallel processing and computing latency information of multiple server nodes may include computing devices or computing systems, and this embodiment of the invention does not limit this. Figure 6 As shown, the apparatus for parallel processing and calculating latency information of multiple server nodes may include: The creation module 301 is used to create multiple communication instances for a target server through a set of relay server node information deployed on a backend server. The target server consists of multiple servers with communication requirements. The set of relay server node information includes multiple relay server node information, and each communication instance corresponds to one of the relay server node information.

[0076] The matching module 302 is used to match the communication instances of all the target servers according to the relay server node information corresponding to all the communication instances of all the target servers, and obtain one or more communication instance matching groups.

[0077] The calculation module 303 is used to calculate the latency information of the server node corresponding to each communication instance matching group by obtaining the timestamp information of each communication instance matching group.

[0078] It is evident that implementation Figure 6The described parallel processing device for calculating latency information of multiple server nodes can create multiple communication instances for target servers by using the relay server node information set deployed on the backend server. Based on the relay server node information corresponding to all communication instances of all target servers, it matches the communication instances of all target servers, improving the accuracy and efficiency of matching communication instances between each target server. Furthermore, by obtaining the timestamp information of each matched communication instance group, it calculates the server node latency information corresponding to each matching communication instance group. This multi-communication instance approach accelerates the calculation of server node latency information, which is beneficial for meeting the need for rapid node performance perception in dynamic network environments and for improving the speed and efficiency of the computing communication system's response speed and service quality.

[0079] In an optional embodiment, all the target servers include at least a first server and a second server, where all communication instances of the first server are denoted as first communication instances, and all communication instances of the second server are denoted as second communication instances; the relay server node information includes the node identifier of the relay server node and the key-value pairs of the relay server node. Furthermore, the specific method by which the matching module 302 matches the communication instances of all the target servers according to the relay server node information corresponding to all the communication instances of all the target servers to obtain one or more communication instance matching groups includes: Based on the node identifiers of the relay server nodes corresponding to all the first communication instances and the node identifiers of all the second communication instances, all the first communication instances and all the second communication instances are integrated to obtain one or more communication instance similarity groups. All communication instances in the same communication instance similarity group correspond to the same node identifier. Based on the key-value pairs corresponding to all communication instances in all the communication instance similarity groups, all communication instance similarity groups that meet the preset matching conditions are selected from all the communication instance similarity groups and used as communication instance matching groups.

[0080] As can be seen, this optional embodiment can first integrate all the first communication instances and all the second communication instances based on the node identifiers of the relay server nodes corresponding to all the first communication instances and the node identifiers of all the second communication instances to obtain one or more communication instance similarity groups. Then, based on the key-value pairs corresponding to all communication instances in all communication instance similarity groups, all communication instance similarity groups that meet the preset matching conditions are selected from all communication instance similarity groups as communication instance matching groups. By first performing preliminary matching through node identifiers and then performing precise matching and filtering through key-value pairs, the matching efficiency, speed and accuracy of communication instances between target servers can be improved, which is conducive to further improving the calculation efficiency, speed and accuracy of latency information of the server nodes corresponding to the communication instances.

[0081] In this optional embodiment, as an optional implementation, the matching module 302 filters out all communication instance similarity groups that meet preset matching conditions from all the communication instance similarity groups based on the key-value pairs corresponding to all communication instances in all the communication instance similarity groups. Specific methods for selecting communication instance matching groups include: For each communication instance similarity group, based on the key-value pairs corresponding to the communication instance similarity group, it is determined whether the first communication instance and the second communication instance within the communication instance similarity group meet the preset matching conditions; When it is determined that the first and second communication instances in the communication instance similarity group do not meet the matching conditions, the communication instance similarity group is excluded. When it is determined that the first and second communication instances within the communication instance similarity group meet the matching conditions, the communication instance similarity group is determined as the communication instance matching group.

[0082] In this optional implementation, the key-value pairs may include domain name key-value pairs and / or channel key-value pairs. Furthermore, the specific method by which the matching module 302 determines, for each communication instance similarity group, whether the first and second communication instances within that communication instance similarity group meet preset matching conditions based on the key-value pairs corresponding to that communication instance similarity group includes: For each communication instance similarity group, based on the domain name key-value pair corresponding to the communication instance similarity group, it is determined whether the domain name key-value pair of the first communication instance and the domain name key-value pair of the second communication instance within the communication instance similarity are the same, which is recorded as the first condition; For each communication instance similarity group, based on the channel key-value pair corresponding to the communication instance similarity group, it is determined whether the channel key-value pair of the first communication instance and the channel key-value pair of the second communication instance within the communication instance similarity are the same, which is recorded as the second condition; Specifically, if at least one of the first condition and the second condition is not met, it is determined that the first communication instance and the second communication instance in the similarity group of the communication instances do not meet the preset matching conditions.

[0083] As can be seen, this optional implementation can filter out all communication instance similarity groups that meet the preset matching conditions from all the communication instance similarity groups based on the domain name key-value pairs and / or channel key-value pairs corresponding to all communication instances in all the communication instance similarity groups, and use them as communication instance matching groups. This can improve the accuracy and reliability of filtering communication instance similarity groups, and is beneficial to improving the matching accuracy and reliability of communication instances between target servers.

[0084] In another optional embodiment, the specific method by which the calculation module 303 calculates the latency information of the server node corresponding to each communication instance matching group by obtaining the timestamp information of each communication instance matching group includes: Based on the communication requirements of all the target servers, a sending server for sending and a receiving server for receiving are determined from each of the target servers. According to each of the communication instance matching groups, a communication connection is established between the sending server and the receiving server regarding the communication instance matching group; By obtaining the timestamp information of the sending server and the receiving server when establishing a communication connection for each communication instance matching group, the latency information of the server node corresponding to each communication instance matching group is calculated.

[0085] As can be seen, this optional embodiment can accurately determine the sending server and receiving server based on the communication requirements of the target server, thereby quickly and accurately establishing a communication connection for each communication instance matching group. By obtaining the timestamp information when establishing the communication connection for each communication instance matching group, the latency information of the server node corresponding to each communication instance matching group can be calculated. This can improve the calculation efficiency, speed, and accuracy of latency information of multiple server nodes through multiple communication connections established by the matching relationship of multiple communication instances.

[0086] In this optional embodiment, as an optional implementation, the calculation module 303 calculates the latency information of the server node corresponding to each communication instance matching group by obtaining the timestamp information of the sending server and the receiving server when establishing the communication connection for each communication instance matching group. The specific method includes: For each of the communication instance matching groups, obtain the first timestamp of the heartbeat message sent by the sending server to the receiving server from the communication instance in the communication instance matching group; Obtain the second timestamp of the communication instance within the communication instance matching group that the receiving server sends a response message to the sending server after receiving the heartbeat message; The difference between the first timestamp and the second timestamp is calculated to obtain the latency information of the server node corresponding to the matching group of the communication instance.

[0087] As can be seen, this optional implementation can obtain the first timestamp of the communication instance in each communication instance matching group that the sending server sends a heartbeat message to the receiving server, and obtain the second timestamp of the communication instance in the communication instance matching group that the receiving server sends a response message to the sending server after receiving the heartbeat message. The difference between the first timestamp and the second timestamp is then calculated to obtain the latency information of the server node corresponding to the communication instance matching group, thereby improving the accuracy and reliability of the latency information calculation for each server node.

[0088] In another optional embodiment, the creation module 301 creates multiple communication instances for the target server using the relay server node information set deployed on the backend server, specifically in the following ways: The backend server deploys a set of relay server node information and sends the set of relay server node information to the target server; The target server receives the relay server node information set sent by the backend server, and creates multiple target subtasks of the target server's main target task based on the relay server node information set. The target server allocates at least one of the relay server node information from the relay server node information set for each target subtask; The target server creates all communication instances corresponding to each target subtask based on the relay server node information allocated to each target subtask.

[0089] As can be seen, this optional embodiment enables the backend server to deploy a set of relay server node information and send the set of relay server node information to the target server; the target server receives the set of relay server node information sent by the backend server and creates multiple target subtasks of the target server's main task based on the set of relay server node information; the target server allocates at least one set of relay server node information to each target subtask from the set of relay server node information; and the target server creates all communication instances corresponding to each target subtask based on all the relay server node information allocated to each target subtask. This allows the main task of the target server to be accurately created into multiple subtasks through the deployed relay server node information, thereby creating all communication instances corresponding to each subtask. This is beneficial for accelerating the latency information of subsequent computing server nodes through a multi-tasking approach.

[0090] Example 4 Please see Figure 7 , Figure 7 This is a schematic diagram of the structure of another device for parallel processing and calculating latency information of multiple server nodes disclosed in an embodiment of the present invention. Figure 7 As shown, the apparatus for parallel processing and calculating latency information of multiple server nodes may include: Memory 401 storing executable program code; Processor 402 coupled to memory 401; The processor 402 calls the executable program code stored in the memory 401 to execute the steps in the method for parallel processing and calculating the latency information of multiple server nodes as described in Embodiment 1 or Embodiment 2 of the present invention.

[0091] Example 5 This invention discloses a computer storage medium storing computer instructions. When these computer instructions are invoked, they are used to execute the steps in the method for parallel processing and calculating latency information of multiple server nodes as described in Embodiment 1 or Embodiment 2 of this invention.

[0092] Example 6 This invention discloses a computer program product, which includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to cause a computer to perform the steps of the method for parallel processing and computing multi-server node latency information described in Embodiment 1 or Embodiment 2.

[0093] The device embodiments described above are merely illustrative. The modules described as separate components may or may not be physically separate. The components shown as modules may or may not be physical modules; that is, they may be located in one place or distributed across multiple network modules. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0094] Through the detailed description of the above embodiments, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, including read-only memory (ROM), random access memory (RAM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), one-time programmable read-only memory (OTPROM), electrically-Erasable Programmable Read-Only Memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disc storage, disk storage, magnetic tape storage, or any other computer-readable medium that can be used to carry or store data.

[0095] Finally, it should be noted that the method and apparatus for parallel processing and computing latency information of multiple server nodes disclosed in the embodiments of the present invention are merely preferred embodiments of the present invention and are only used to illustrate the technical solutions of the present invention, not to limit it. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for parallel processing and computation of latency information of multiple server nodes, characterized in that, The method includes: Multiple communication instances are created for the target server by using the relay server node information set deployed on the backend server. The target server consists of multiple servers with communication requirements. The relay server node information set includes multiple relay server node information, and each communication instance corresponds to one of the relay server node information. Based on the relay server node information corresponding to all communication instances of all the target servers, the communication instances of all the target servers are matched to obtain one or more communication instance matching groups; By obtaining the timestamp information of each communication instance matching group, the latency information of the server node corresponding to each communication instance matching group is calculated.

2. The method for parallel processing and calculating latency information of multiple server nodes according to claim 1, characterized in that, All the target servers include at least a first server and a second server, and all the communication instances of the first server are denoted as the first communication instance, and all the communication instances of the second server are denoted as the second communication instance; The relay server node information includes the node identifier of the relay server node and the key-value pairs of the relay server node; And, the step of matching all communication instances of all target servers based on the relay server node information corresponding to all communication instances of all target servers to obtain one or more communication instance matching groups includes: Based on the node identifiers of the relay server nodes corresponding to all the first communication instances and the node identifiers of all the second communication instances, all the first communication instances and all the second communication instances are integrated to obtain one or more communication instance similarity groups. All communication instances in the same communication instance similarity group correspond to the same node identifier. Based on the key-value pairs corresponding to all communication instances in all the communication instance similarity groups, all communication instance similarity groups that meet the preset matching conditions are selected from all the communication instance similarity groups and used as communication instance matching groups.

3. The method for parallel processing and calculating latency information of multiple server nodes according to claim 2, characterized in that, The step of selecting all communication instance similarity groups that meet preset matching conditions from all communication instance similarity groups based on the key-value pairs corresponding to all communication instances in all communication instance similarity groups, as communication instance matching groups, includes: For each communication instance similarity group, based on the key-value pairs corresponding to the communication instance similarity group, it is determined whether the first communication instance and the second communication instance within the communication instance similarity group meet the preset matching conditions; When it is determined that the first and second communication instances in the communication instance similarity group do not meet the matching conditions, the communication instance similarity group is excluded. When it is determined that the first and second communication instances within the communication instance similarity group meet the matching conditions, the communication instance similarity group is determined as the communication instance matching group.

4. The method for parallel processing and calculating latency information of multiple server nodes according to claim 3, characterized in that, The key-value pairs include domain key-value pairs and / or channel key-value pairs; And, for each communication instance similarity group, determining whether the first and second communication instances within the communication instance similarity group meet preset matching conditions based on the key-value pairs corresponding to the communication instance similarity group includes: For each communication instance similarity group, based on the domain name key-value pair corresponding to the communication instance similarity group, it is determined whether the domain name key-value pair of the first communication instance and the domain name key-value pair of the second communication instance within the communication instance similarity are the same, which is recorded as the first condition; For each communication instance similarity group, based on the channel key-value pair corresponding to the communication instance similarity group, it is determined whether the channel key-value pair of the first communication instance and the channel key-value pair of the second communication instance within the communication instance similarity are the same, which is recorded as the second condition; Specifically, if at least one of the first condition and the second condition is not met, it is determined that the first communication instance and the second communication instance in the similarity group of the communication instances do not meet the preset matching conditions.

5. The method for parallel processing and calculating latency information of multiple server nodes according to any one of claims 1-4, characterized in that, The step of obtaining the timestamp information of each communication instance matching group and calculating the latency information of the server node corresponding to each communication instance matching group includes: Based on the communication requirements of all the target servers, a sending server for sending and a receiving server for receiving are determined from each of the target servers. According to each of the communication instance matching groups, a communication connection is established between the sending server and the receiving server regarding the communication instance matching group; By obtaining the timestamp information of the sending server and the receiving server when establishing a communication connection for each communication instance matching group, the latency information of the server node corresponding to each communication instance matching group is calculated.

6. The method for parallel processing and calculating latency information of multiple server nodes according to claim 5, characterized in that, The step of obtaining the timestamp information of the sending server and the receiving server when establishing the communication connection for each communication instance matching group, and calculating the latency information of the server node corresponding to each communication instance matching group, includes: For each of the communication instance matching groups, obtain the first timestamp of the heartbeat message sent by the sending server to the receiving server from the communication instance in the communication instance matching group; Obtain the second timestamp of the communication instance within the communication instance matching group that the receiving server sends a response message to the sending server after receiving the heartbeat message; The difference between the first timestamp and the second timestamp is calculated to obtain the latency information of the server node corresponding to the matching group of the communication instance.

7. The method for parallel processing and calculating latency information of multiple server nodes according to any one of claims 1, 2, 3, 4, and 6, characterized in that, The set of relay server node information deployed through the backend server creates multiple communication instances for the target server, including: The backend server deploys a set of relay server node information and sends the set of relay server node information to the target server; The target server receives the relay server node information set sent by the backend server, and creates multiple target subtasks of the target server's main target task based on the relay server node information set. The target server allocates at least one of the relay server node information from the relay server node information set for each target subtask; The target server creates all communication instances corresponding to each target subtask based on the relay server node information allocated to each target subtask.

8. An apparatus for parallel processing and computation of latency information of multiple server nodes, characterized in that, The device includes: A creation module is used to create multiple communication instances for a target server using a set of relay server node information deployed on a backend server. The target server consists of multiple servers with communication requirements. The set of relay server node information includes multiple relay server node information, and each communication instance corresponds to one of the relay server node information. The matching module is used to match the communication instances of all the target servers based on the relay server node information corresponding to all the communication instances of all the target servers, and obtain one or more communication instance matching groups. The calculation module is used to calculate the latency information of the server node corresponding to each communication instance matching group by obtaining the timestamp information of each communication instance matching group.

9. An apparatus for parallel processing and computation of latency information of multiple server nodes, characterized in that, The device includes: Memory containing executable program code; A processor coupled to the memory; The processor calls the executable program code stored in the memory to execute the method for parallel processing and calculating the latency information of multiple server nodes as described in any one of claims 1-7.

10. A computer storage medium, characterized in that, The computer storage medium stores computer instructions, which, when invoked, are used to execute the method for parallel processing and calculating latency information of multiple server nodes as described in any one of claims 1-7.

Images