K-nomial tree construction method and system based on transmission environment perception

Abstract

The invention discloses a k-nomial tree construction method and system based on transmission environment perception, and the method comprises the steps: dividing a plurality of communication levels according to the communication delay between nodes participating in communication operation, and determining the communication level to which each node belongs when communicating with other nodes; calculating to obtain a branch factor of each round of expansion based on the level communication concurrency of each communication level; the nodes are expanded round by round based on the branch factor of each round of expansion to construct a k-nomial tree, in the constructed k-nomial tree, if the communication level of any node and the father node of the node is met, the communication level of the node and the child node of the node is met, and if the communication level of the node and the child node of the node is still the same. The overall communication efficiency of the cluster nodes can be improved, and the utilization rate of communication resources is improved.

Description

Technical Field

[0001] This invention relates to the field of collective communication performance optimization technology, specifically to a method and system for constructing a k-nomial tree based on transmission environment awareness. Background Technology

[0002] In the field of High Performance Computing (HPC), the performance of Message Passing Interface (MPI) communication operations is crucial to the efficiency of parallel computing. Taking the broadcast operation MPI_Bcast as an example, its core objective is to efficiently transmit root node data to all processes. Current mainstream MPI implementations (such as OpenMPI and MVAPICH2) generally employ a k-nomial tree algorithm based on a static branch factor. However, this algorithm has a key flaw in constructing the k-nomial tree: it assumes all nodes are in the same communication environment, forcing all nodes to use a uniform and fixed branch factor when selecting child nodes to establish connections, i.e., selecting the same number of child nodes (see [link to relevant documentation]). Figure 1 In each round of node expansion, each node selects only two child nodes, completely ignoring the significant communication latency differences caused by the differences in transmission environment due to topological location between different nodes. This design can lead to multiple chain reactions in actual distributed clusters: The objective difference in communication latency between nodes exists. For example, a node with extremely low communication latency with its child nodes in the same rack could potentially handle more data forwarding tasks from these low-latency child nodes to fully leverage its communication advantages. However, the constraint of the static branch factor prevents this node from flexibly increasing the number of low-latency child node connections to utilize redundant communication capabilities. It may also be forced to establish connections with high-latency child nodes. Typically, a node may have low communication latency with its parent node, but its selected child nodes have extremely high communication latency. In this case, not only does the node need to spend more time completing data transmission with its child nodes, but its parent node also needs to wait for the node to complete the transmission before continuing to propagate data to the next round of nodes, directly slowing down the overall broadcast efficiency. Simultaneously, because the node needs to handle a large amount of data interaction with high-latency child nodes, it is prone to overload, leading to bandwidth congestion or memory bottlenecks, further exacerbating resource waste and communication efficiency loss. Summary of the Invention

[0003] The technical problem to be solved by this invention is to provide a k-nomial tree construction method and system based on transmission environment awareness, which addresses the above-mentioned problems in the prior art. This invention aims to solve the problem that the existing k-nomial tree algorithm based on static branching factors cannot consider the differences in transmission environment between different nodes, which easily leads to waste of communication resources and poor communication efficiency. This invention can improve the overall communication efficiency of cluster nodes and improve the utilization rate of communication resources.

[0004] To solve the above-mentioned technical problems, the technical solution adopted by the present invention is as follows: A method for constructing a k-nomial tree based on transmission environment awareness includes the following steps: S101, based on the communication delay between the nodes participating in the communication operation. Each node has a communication layer, which defines the communication layer to which each node belongs when communicating with other nodes. ,in, Indicates the first Each communication layer , No. Communication layers The communication delay between nodes is greater than that of the first node. Communication layers Inter-node communication latency; S102, for each communication layer The corresponding level of communication concurrency is calculated based on its level of communication parameters, and based on each communication level... The hierarchical communication concurrency is calculated to obtain the branching factor of each round of k-nomial tree expansion; S103, Based on the branching factor of each round of expansion of the k-nomial tree, the nodes are expanded round by round to construct the k-nomial tree. In the completed k-nomial tree, the communication level between any node and its parent node is... satisfy Then the communication layer between this node and its child nodes satisfy If satisfied Then the communication level between this node and its child nodes remains the same. .

[0005] Optionally, in step S102, the hierarchical communication parameters include hierarchical communication delay. and hierarchical message rate ,in Indicates the first Hierarchical communication latency at each communication level Indicates the first Hierarchical message rate of each communication level; For each communication layer The calculation of the corresponding hierarchical communication concurrency based on its hierarchical communication parameters includes the following steps: S201, Calculate the average reception time of the hierarchical information receiving nodes. : , Calculate the average transmission time of the hierarchical information sending node. : , in, Indicates the first Average reception time of each communication layer information receiving node Indicates the first The level of communication concurrency at each communication level. Indicates the first Average transmission time of each communication layer information sending node; S202, based on the requirement that the characteristic average reception time of the hierarchical information sending node and the characteristic average transmission time of the hierarchical information receiving node are equal, the following relationship is constructed:

[0006] And obtain the first [unclear] based on this relation. Hierarchical communication concurrency at each communication level , Indicates to Perform a floor operation.

[0007] Optionally, the formula for calculating the branching factor of the k-nomial tree in each round of expansion based on the hierarchical communication concurrency in step S103 is as follows: , in, Indicates the first Branching factor of round expansion.

[0008] Optionally, the step S103 of expanding the nodes round by round based on the branching factor of the k-nomial tree to construct the k-nomial tree includes the following steps: S301, place the root node at the top level of the k-nomial tree structure and mark the root node as a level 0 communication node; S302, perform multiple rounds of k-nomial tree expansion according to the following node expansion rules until all nodes participating in communication are included in the k-nomial tree: In each round of node expansion, the nodes to be expanded are all nodes in the current k-nomial tree structure. For the k-nomial node... Each node to be expanded in the round expansion performs the following operations: If the node to be expanded is marked as the first... Level communication node, and Then, the communication level when communicating with the node to be expanded is... Select from the nodes The nodes that were not selected for inclusion in the k-nomial tree structure are treated as child nodes of the nodes to be expanded, and these newly connected child nodes are marked as the first child node. Level communication nodes, among which Show the first The branching factor of the round expansion; if the node to be expanded is marked as the first... Level communication node, and Then, the communication level when communicating with the node to be expanded is... Select from the nodes Nodes that were not selected for inclusion in the k-nomial tree structure are considered as child nodes of the nodes to be expanded.

[0009] Optionally, in the During the round node expansion, the following operations are performed for each node to be expanded: if the node to be expanded is marked as the first... Level communication node, and If the communication level is when communicating with the node to be expanded, The number of nodes not selected for inclusion in the k-nomial tree structure is less than Then, after selecting the nodes to be expanded for communication, the communication level is... After a node becomes a child node of the root node, it prioritizes communicating with nodes at the same communication level as the node to be expanded. The number of nodes not selected for inclusion in the k-nomial tree structure is increased by selecting nodes from the selected nodes. If the number of selected nodes is still insufficient, the communication level is increased when communicating with the nodes to be expanded. After the nodes not selected for inclusion in the k-nomial tree structure are designated as child nodes of the node to be expanded, the nodes are sequentially selected from those whose communication hierarchy with the node to be expanded is... L ( n +3) L ( n +4), ... Lm In the process of selecting nodes that were not selected for inclusion in the k-nomial tree structure, the remaining nodes are chosen as child nodes of the node to be expanded, until the number of selected child nodes equals the number of child nodes. For each child node connected to the node to be expanded, the communication level between the child node and the node to be expanded is determined. Mark the child node as the first Level communication node.

[0010] Optionally, step S101 further includes: dividing the nodes into groups based on their physical topological locations. A hierarchical nested unit system, each of the first... Hierarchical units include multiple first-order units. Hierarchical units, Each node belongs to a first Hierarchical units, belonging to the same level Hierarchical units and belonging to different levels When two nodes in a hierarchical unit communicate, the communication level between the two nodes belongs to the [missing information - likely a specific level or hierarchy]. Communication layers Belonging to the same category When two nodes in a hierarchical unit communicate, the communication level of the two nodes belongs to the [missing information - likely a specific level or hierarchy]. Communication layers .

[0011] Optionally, in the During the round node expansion, the following operations are performed for each node to be expanded: If the node to be expanded is marked as the first... Level communication node, and When communicating with the node to be expanded, the communication level is When selecting a node as a child node of the node to be expanded from the nodes of the node to be expanded, the child node is selected from the nodes that belong to the same node group as the node to be expanded. n +1 level unit, but belonging to different levels Select a node as its child node from the nodes in the hierarchical unit.

[0012] Furthermore, the present invention also provides a transmission environment-aware k-nomial tree construction system, including an interconnected microprocessor and a memory, wherein the microprocessor is programmed or configured to execute the transmission environment-aware k-nomial tree construction method.

[0013] Furthermore, the present invention also provides a computer-readable storage medium storing a computer program or instructions that are programmed or configured to execute the transmission context-aware k-nomial tree construction method by a processor.

[0014] Furthermore, the present invention also provides a computer program product, including a computer program or instructions that are programmed or configured to execute the transmission environment-aware k-nomial tree construction method via a processor.

[0015] Compared with the prior art, the present invention has the following main advantages: This invention divides the communication based on the communication delay between the nodes participating in the communication operation. The k-nomial tree, with its multiple communication layers, takes into account the differences in transmission environments between nodes. In this constructed tree, the communication layer between any node and its parent node is less than or equal to the communication layer between its child nodes. Only when the communication layer between the node and its parent node is the one with the lowest latency will the communication layer between the node and its child nodes be the same as the communication layer between the node and its parent node. In other words, if the communication latency between the node and its parent node is greater than or equal to the communication latency between the node and its child nodes, the parent node can reduce the time it takes to wait for the node to transmit data to its child nodes. This allows the parent node to quickly move on to the next round of communication, thereby improving the overall communication efficiency and resource utilization of the cluster nodes. Attached Figure Description

[0016] Figure 1 This diagram illustrates the process of constructing a k-nomial tree using the existing k-nomial tree algorithm based on static branching factors.

[0017] Figure 2 This is a flowchart illustrating the k-nomial tree construction method based on transmission environment awareness of the present invention.

[0018] Figure 3 This is a schematic diagram illustrating the process of constructing a k-nomial tree according to the present invention. Detailed Implementation

[0019] The following will be combined with the appendix Figure 2 The technical solution of the present invention will be further described in detail below.

[0020] A method for constructing a k-nomial tree based on transmission environment awareness includes the following steps: S101, based on the communication delay between the nodes participating in the communication operation. Each node has a communication layer, which defines the communication layer to which each node belongs when communicating with other nodes. ,in, Indicates the first Each communication layer , No. Communication layers The communication delay between nodes is greater than that of the first node. Communication layers Inter-node communication latency; S102, for each communication layer The corresponding level of communication concurrency is calculated based on its level of communication parameters, and based on each communication level... The hierarchical communication concurrency is calculated to obtain the branching factor of each round of k-nomial tree expansion; S103, Based on the branching factor of each round of expansion of the k-nomial tree, the nodes are expanded round by round to construct the k-nomial tree. In the completed k-nomial tree, the communication level between any node and its parent node is... satisfy Then the communication layer between this node and its child nodes satisfy If satisfied Then the communication level between this node and its child nodes remains the same. .

[0021] This embodiment uses a k-nomial tree construction method based on the transmission environment awareness to divide the tree according to the communication latency between the nodes participating in the communication operation. The k-nomial tree, with its multiple communication layers, takes into account the differences in transmission environments between nodes. In this constructed tree, the communication layer between any node and its parent node is less than or equal to the communication layer between its child nodes. Only when the communication layer between the node and its parent node is the one with the lowest latency will the communication layer between the node and its child nodes be the same as the communication layer between the node and its parent node. In other words, if the communication latency between the node and its parent node is greater than or equal to the communication latency between the node and its child nodes, the parent node can reduce the time it takes to wait for the node to transmit data to its child nodes. This allows the parent node to quickly move on to the next round of communication, thereby improving the overall communication efficiency and resource utilization of the cluster nodes.

[0022] Specifically, in this embodiment, step S101 further includes: dividing the nodes into groups based on their physical topology location (which can be obtained from the cluster resource management system, including node ID, NUMA domain partitioning, and system topology connection relationships). A hierarchical nested unit system, each of the first... Hierarchical units include multiple first-order units. Hierarchical units, Each node belongs to a first Hierarchical units, belonging to the same level Hierarchical units and belonging to different levels When two nodes in a hierarchical unit communicate, the communication level between the two nodes belongs to the [missing information - likely a specific level or hierarchy]. Communication layers Belonging to the same category When two nodes in a hierarchical unit communicate, the communication level of the two nodes belongs to the [missing information - likely a specific level or hierarchy]. Communication layers .

[0023] Corresponding to the previous paragraph, to more clearly explain how to divide nodes into... In this nested unit architecture, let's take a specific example. The nodes participating in the communication operation come from 8 racks. Each rack contains 4 chassis, and each chassis contains 8 nodes. Each chassis is considered a third-level unit, and the communication level between any two nodes within the same chassis belongs to the third communication level. L 3. Each rack is considered a second-level unit. Communication between any two nodes located in different chassis within the same rack belongs to the second communication level. L 2. All server racks constitute the first-level unit. The communication level between any two nodes on different server racks belongs to the first communication level. L 1.

[0024] Furthermore, in this embodiment, in step S102, the hierarchical communication parameters include hierarchical communication delay. and hierarchical message rate ,in Indicates the first The hierarchical communication latency of each communication level (specifically, the average communication latency of all node pairs that meet the latency criteria of that level among the participating nodes). Indicates the first The hierarchical message rate of a communication level (specifically, the average message rate of all node pairs that meet the latency standard of that level among the nodes participating in the communication; of course, it can also be the minimum message rate in other embodiments). For each communication layer The calculation of the corresponding hierarchical communication concurrency based on its hierarchical communication parameters includes the following steps: S201, Calculate the average reception time of the hierarchical information receiving nodes. : , Calculate the average transmission time of the hierarchical information sending node. : , in, Indicates the first Average reception time of each communication layer information receiving node Indicates the first The level of communication concurrency at each communication level. Indicates the first Average transmission time of each communication layer information sending node; S202, based on the requirement that the characteristic average reception time of the hierarchical information sending node and the characteristic average transmission time of the hierarchical information receiving node are equal, the following relationship is constructed:

[0025] And obtain the first [unclear] based on this relation. Hierarchical communication concurrency at each communication level , Indicates to Perform a floor operation.

[0026] Furthermore, in this embodiment, the formula for calculating the branching factor of the k-nomial tree in each round of expansion based on the hierarchical communication concurrency in step S103 is as follows: , in, Indicates the first Branching factor of round expansion.

[0027] Furthermore, in this embodiment, the step S103 of expanding the nodes round by round based on the branching factor of the k-nomial tree to construct the k-nomial tree includes the following steps: S301, place the root node at the top level of the k-nomial tree structure and mark the root node as a level 0 communication node; S302, perform multiple rounds of k-nomial tree expansion according to the following node expansion rules until all nodes participating in communication are included in the k-nomial tree: In each round of node expansion, the nodes to be expanded are all nodes in the current k-nomial tree structure. For the k-nomial node... Each node to be expanded in the round expansion performs the following operations: If the node to be expanded is marked as the first... Level communication node, and Then, the communication level when communicating with the node to be expanded is... Select from the nodes The nodes that were not selected for inclusion in the k-nomial tree structure are treated as child nodes of the nodes to be expanded, and these newly connected child nodes are marked as the first child node. Level communication nodes, among which Show the first The branching factor in round expansion, if the communication level is [missing information] when communicating with the node to be expanded. The number of nodes not selected for inclusion in the k-nomial tree structure is less than Then, after selecting the nodes to be expanded for communication, the communication level is... After a node becomes a child node of the root node, it prioritizes communicating with nodes at the same communication level as the node to be expanded. The number of nodes not selected for inclusion in the k-nomial tree structure is increased by selecting nodes from the selected nodes. If the number of selected nodes is still insufficient, the communication level is increased when communicating with the nodes to be expanded. After the nodes not selected for inclusion in the k-nomial tree structure are designated as child nodes of the node to be expanded, the nodes are sequentially selected from those whose communication hierarchy with the node to be expanded is... L (n+3) L (n+4), ..., L From the nodes of m, select nodes that were not selected for inclusion in the k-nomial tree structure as child nodes of the node to be expanded, until the number of selected child nodes equals the number of child nodes. For each child node connected to the node to be expanded, the communication level between the child node and the node to be expanded is determined. Mark the child node as the first Level communication node; if the node to be expanded is marked as the first level communication node; Level communication node, and Then, the communication level when communicating with the node to be expanded is... Select from the nodes Nodes that were not selected for inclusion in the k-nomial tree structure are considered as child nodes of the nodes to be expanded.

[0028] Corresponding to the previous paragraph, by using this method of selecting child nodes by the node to be expanded, and by limiting the number of child nodes selected by each child node in each round of expansion, as many nodes to be expanded as possible can bear a communication load commensurate with their communication capacity in each round of communication. This is beneficial for improving communication efficiency and the utilization rate of communication resources. The specific example above will be used as an illustration; see [link to example]. Figure 3 Assuming the expansion factor in the first round Then the root node (corresponding to the appendix) Figure 3 Node 0 in the list will be selected first. When communicating with it, the communication level is full. L The node with 1 is its child node (corresponding to the appendix). Figure 3 Nodes 1-7 in the diagram ensure that the root node's communication capacity is fully utilized during the first round of communication. Assuming the expansion factor for the second round... In the second round of expansion, 7 new child nodes were added (corresponding to the attached...) Figure 3 Nodes 1 through 7 in the list will be selected with priority respectively. When communicating with it, the communication level is full. L The node with number 2 is its child node (it should be noted that the appendix is...) Figure 3 The image only shows the child nodes selected by nodes 1-5 in the second round of expansion; nodes 6 and 7 are not shown due to map size limitations. The root node is still selected first. When communicating with it, the communication level is full. L The node with number 2 is its child node (corresponding to the appendix). Figure 3Nodes 8 and 9 in the original text (i.e., nodes 8 and 9) ensure that the communication capabilities of the seven child nodes from the first round of expansion are fully utilized in the second round of expansion. Similarly, in the third round of expansion, assuming the expansion factor of the third round... Theoretically, the 32 nodes currently incorporated into the k-nomial tree structure will each choose... Each node is designated as a child node, and in the second round, the 21 nodes marked as Level 2 communication nodes will be selected by the respective nodes. When communicating with it, the communication level is full. L The node with number 3 is its child node (it should be noted that, appended) Figure 3 The image only shows the child nodes selected by nodes 11-15 in the third round of expansion; the other nodes are not shown due to map size limitations, fully utilizing the communication capabilities of these 21 nodes.

[0029] Furthermore, in this embodiment, in the first... During the round node expansion, the following operations are performed for each node to be expanded: In the... During the round node expansion, the following operations are performed for each node to be expanded: If the node to be expanded is marked as the first... Level communication node, and When communicating with the node to be expanded, the communication level is When selecting a node as a child node of the node to be expanded from the nodes of the node to be expanded, the child node is selected from the nodes that belong to the same node group as the node to be expanded. n +1 level unit, but belonging to different levels In a hierarchical unit, a node is selected as its child node; within the same hierarchical unit... In a hierarchical unit, only one node is allowed as a child node of the expansion node. Using the specific example above, in the first round of expansion, the root node selects seven nodes from different racks as its child nodes, and the root node does not belong to any of these seven racks. In the second round of expansion, the root node can only select three nodes from the same rack but different chassis as its child nodes, and the root node does not belong to any of these three chassis. This ensures that the root node's communication capabilities are fully utilized in the second round of expansion. This design facilitates rapid information transmission between different levels of the cluster nodes, improving the overall communication efficiency of the cluster nodes and increasing the utilization of communication resources.

[0030] Furthermore, this embodiment also provides a k-nomial tree construction system based on transmission environment awareness, including a microprocessor and a memory interconnected, wherein the microprocessor is programmed or configured to execute the above-described k-nomial tree construction method based on transmission environment awareness.

[0031] Furthermore, this embodiment also provides a computer-readable storage medium storing a computer program or instructions that are programmed or configured to execute the above-described transmission environment-aware k-nomial tree construction method via a processor.

[0032] Furthermore, this embodiment also provides a computer program product, including a computer program or instructions, which are programmed or configured to execute the above-described transmission environment-aware k-nomial tree construction method via a processor.

[0033] Those skilled in the art will understand that the technical solutions provided by the embodiments of this application may be in the form of a method, system, or computer program product. Therefore, this application may take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application may take the form of a computer program product embodied on one or more computer-readable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code. This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create an implementation for the process. Figure 1 One or more processes and / or boxes Figure 1 The computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The functions specified in one or more boxes. These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable apparatus for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0034] The above description is merely a preferred embodiment of the present invention. The scope of protection of the present invention is not limited to the above embodiments. All technical solutions falling within the scope of the present invention's concept are within the scope of protection of the present invention. It should be noted that for those skilled in the art, any improvements and modifications made without departing from the principles of the present invention should also be considered within the scope of protection of the present invention.

Claims

1. A method for constructing a k-nomial tree based on transmission environment awareness, characterized in that, Includes the following steps: S101, based on the communication delay between the nodes participating in the communication operation. Each node has a communication layer, which defines the communication layer to which each node belongs when communicating with other nodes. ,in, Indicates the first Each communication layer , No. Communication layers The communication delay between nodes is greater than that of the first node. Communication layers Inter-node communication latency; S102, for each communication layer The corresponding level of communication concurrency is calculated based on its level of communication parameters, and based on each communication level... The hierarchical communication concurrency is calculated to obtain the branching factor of each round of k-nomial tree expansion; S103, Based on the branching factor of each round of expansion of the k-nomial tree, the nodes are expanded round by round to construct the k-nomial tree. In the completed k-nomial tree, the communication level between any node and its parent node is... satisfy Then the communication layer between this node and its child nodes satisfy If satisfied Then the communication level between this node and its child nodes remains the same. .

2. The k-nomial tree construction method based on transmission environment awareness according to claim 1, characterized in that, In step S102, the hierarchical communication parameters include hierarchical communication delay. and hierarchical message rate ,in Indicates the first Hierarchical communication latency at each communication level Indicates the first Hierarchical message rate of each communication level; For each communication layer The calculation of the corresponding hierarchical communication concurrency based on its hierarchical communication parameters includes the following steps: S201, Calculate the average reception time of the hierarchical information receiving nodes. : ， Calculate the average transmission time of the hierarchical information sending node. : ， in, Indicates the first Average reception time of each communication layer information receiving node Indicates the first The level of communication concurrency at each communication level. Indicates the first Average transmission time of each communication layer information sending node; S202, based on the requirement that the characteristic average reception time of the hierarchical information sending node and the characteristic average transmission time of the hierarchical information receiving node are equal, the following relationship is constructed: And obtain the first [unclear] based on this relation. Hierarchical communication concurrency at each communication level , Indicates to Perform a floor operation.

3. The k-nomial tree construction method based on transmission environment awareness according to claim 2, characterized in that, In step S103, the formula for calculating the branching factor of the k-nomial tree in each round of expansion based on the hierarchical communication concurrency is as follows: ， in, Indicates the first Branching factor of round expansion.

4. The k-nomial tree construction method based on transmission environment awareness according to claim 1, characterized in that, Step S103, which involves expanding the k-nomial tree by branching the nodes in each round based on the branching factor of the k-nomial tree, includes the following steps: S301, place the root node at the top level of the k-nomial tree structure and mark the root node as a level 0 communication node; S302, perform multiple rounds of k-nomial tree expansion according to the following node expansion rules until all nodes participating in communication are included in the k-nomial tree: In each round of node expansion, the nodes to be expanded are all nodes in the current k-nomial tree structure. For the k-nomial node... Each node to be expanded in the round expansion performs the following operations: If the node to be expanded is marked as the first... Level communication node, and Then, the communication level when communicating with the node to be expanded is... Select from the nodes The nodes that were not selected for inclusion in the k-nomial tree structure are treated as child nodes of the nodes to be expanded, and these newly connected child nodes are marked as the first child node. Level communication nodes, among which Show the first The branching factor of the round expansion; if the node to be expanded is marked as the first... Level communication node, and Then, the communication level when communicating with the node to be expanded is... Select from the nodes Nodes that were not selected for inclusion in the k-nomial tree structure are considered as child nodes of the nodes to be expanded.

5. The k-nomial tree construction method based on transmission environment awareness according to claim 4, characterized in that, In the During the round node expansion, the following operations are performed for each node to be expanded: if the node to be expanded is marked as the first... Level communication node, and If the communication level is when communicating with the node to be expanded, The number of nodes not selected for inclusion in the k-nomial tree structure is less than Then, after selecting the nodes to be expanded for communication, the communication level is... After a node becomes a child node of the root node, it prioritizes communicating with nodes at the same communication level as the node to be expanded. The number of nodes not selected for inclusion in the k-nomial tree structure is increased by selecting nodes from the selected nodes. If the number of selected nodes is still insufficient, the communication level is increased when communicating with the nodes to be expanded. After the nodes not selected for inclusion in the k-nomial tree structure are designated as child nodes of the node to be expanded, the nodes are sequentially selected from those whose communication hierarchy with the node to be expanded is... L ( n +3) L ( n +4), ... Lm In the process of selecting nodes that were not selected for inclusion in the k-nomial tree structure, the remaining nodes are chosen as child nodes of the node to be expanded, until the number of selected child nodes equals the number of child nodes. For each child node connected to the node to be expanded, the communication level between the child node and the node to be expanded is determined. Mark the child node as the first Level communication node.

6. The k-nomial tree construction method based on transmission environment awareness according to claim 5, characterized in that, Step S101 further includes: dividing the nodes into groups based on their physical topological locations. A hierarchical nested unit system, each of the first... Hierarchical units include multiple first-order units. Hierarchical units, Each node belongs to a first Hierarchical units, belonging to the same level Hierarchical units and belonging to different levels When two nodes in a hierarchical unit communicate, the communication level between the two nodes belongs to the [missing information - likely a specific level or hierarchy]. Communication layers Belonging to the same category When two nodes in a hierarchical unit communicate, the communication level of the two nodes belongs to the [missing information - likely a specific level or hierarchy]. Communication layers .

7. The k-nomial tree construction method based on transmission environment awareness according to claim 6, characterized in that, In the During the round node expansion, the following operations are performed for each node to be expanded: If the node to be expanded is marked as the first... Level communication node, and When communicating with the node to be expanded, the communication level is When selecting a node as a child node of the node to be expanded from the nodes of the node to be expanded, the child node is selected from the nodes that belong to the same node group as the node to be expanded. n +1 level unit, but belonging to different levels Select a node as its child node from the nodes in the hierarchical unit.

8. A k-nomial tree construction system based on transmission environment awareness, comprising interconnected microprocessors and memory, characterized in that, The microprocessor is programmed or configured to execute the k-nomial tree construction method based on any one of claims 1 to 7.

9. A computer-readable storage medium storing a computer program or instructions, characterized in that, The computer program or instructions are programmed or configured to execute the k-nomial tree construction method based on any one of claims 1 to 7 via a processor.

10. A computer program product, comprising a computer program or instructions, characterized in that, The computer program or instructions are programmed or configured to execute the k-nomial tree construction method based on any one of claims 1 to 7 via a processor.

Images