Construction method and device for disjoint paths on folding segmentation and exchange cube

By building disintersecting paths on fold segmentation and exchange cubes, the problems of communication congestion and path dependence are solved, and stable communication is achieved.

CN120389977APending Publication Date: 2025-07-29THE FIRST AFFILIATED HOSPITAL OF SOOCHOW UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202510566121.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-04-30
Publication Date
2025-07-29

AI Technical Summary

Technical Problem

In folding segmentation and switching cubes, the prior art cannot effectively avoid communication congestion, and when one path is damaged, it will affect other paths, resulting in communication instability.

Method used

By determining the first target vertex and the second target vertex on the collapsed split and exchange cube, a disintersection path, including an inner and outer neighbor set, is constructed based on the first set and the second set, and finally a third disintersection path is constructed to ensure that the paths do not intersect.

Benefits of technology

It effectively avoids communication congestion between target vertices, and when a problem occurs in one path, it will not affect other paths, improving the stability and efficiency of communication.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120389977A_ABST
    Figure CN120389977A_ABST
Patent Text Reader

Abstract

The invention discloses a construction method, device and equipment for disjoint paths on folding segmentation and exchange cubes and a readable storage medium, and relates to the technical field of interconnection networks. Comprising the following steps: determining a first target vertex and a second target vertex on a folding segmentation and exchange cube; constructing a first disjoint path based on the first set and the second set; the first set comprises a first target vertex and an internal adjacent point of the first target vertex, and the second set comprises a second target vertex and an internal adjacent point of the second target vertex; constructing a second disjoint path based on the external adjacent point sets of the vertexes in the first set and the second set; and constructing a third disjoint path based on the sub-networks where the first target vertex and the second target vertex are located. According to the method, construction of all disjoint paths between the first target vertex and the second target vertex is realized, and influence between communication congestion and paths is avoided.
Need to check novelty before this filing date? Find Prior Art

Claims

1. A construction method for folding, splitting, and swapping non-intersecting paths on a cube, characterized in that The method includes: Determine a first target vertex and a second target vertex on a folded split and exchanged cube; the first target vertex and the second target vertex are in the same sub-network of an interconnection network, but not in the same sub-sub-network of the sub-network, and the interconnection network is composed of several sub-networks, and a sub-network is composed of several sub-sub-networks; Construct a first non-intersecting path based on a first set and a second set; the first set includes the first target vertex and the internal neighbors of the first target vertex, and the second set includes the second target vertex and the internal neighbors of the second target vertex; Construct a second non-intersecting path based on the external neighbor sets of the vertices in the first set and the second set; Construct a third non-intersecting path based on the sub-networks where the first target vertex and the second target vertex are located.

2. The method for constructing non - intersecting paths on a folded, divided, and exchanged cube according to claim 1, wherein, Constructing a first non-intersecting path based on a first set and a second set includes: If there is a first vertex in the first set directly connected to a second vertex in the second set; Then establish the first non-intersecting path based on the first target vertex, the second target vertex, the first vertex, and the second vertex.

3. The method for constructing non - intersecting paths on a folded, divided, and exchanged cube according to claim 2, wherein, Establishing the first non-intersecting path based on the first target vertex, the second target vertex, the first vertex, and the second vertex includes: If the first vertex and the first target vertex are the same vertex, and the second vertex and the second target vertex are also the same vertex, then establish the first non-intersecting path based on the first target vertex and the second target vertex; If the first vertex and the first target vertex are not the same vertex, but the second vertex and the second target vertex are the same vertex, then establish the first non-intersecting path based on the first target vertex, the first vertex, and the second target vertex; If the first vertex and the first target vertex are the same vertex, but the second vertex and the second target vertex are not the same vertex, then establish the first non-intersecting path based on the first target vertex, the second vertex, and the second target vertex; If the first vertex and the first target vertex are not the same vertex, and the second vertex and the second target vertex are not the same vertex either, then establish the first non-intersecting path based on the first target vertex, the first vertex, the second target vertex, and the second vertex; Delete the first vertex from the first set and delete the second vertex from the second set.

4. The method for constructing non-intersecting paths on a folding, dividing, and swapping cube as claimed in claim 1, wherein Constructing a second non-intersecting path based on the external neighbor sets of the vertices in the first set and the second set includes: If there is any point in the external neighbor set of a third vertex in the first set directly connected to a fourth vertex in the second set, or if there is any point in the external neighbor set of a fifth vertex in the second set directly connected to a sixth vertex in the first set; Then, the second non - intersecting path is constructed based on the first target vertex, the second target vertex, the third vertex, and the fourth vertex, or based on the first target vertex, the second target vertex, the fifth vertex, and the sixth vertex.

5. The method for constructing non - intersecting paths on a folded, divided, and exchanged cube according to claim 4, wherein Constructing the second non - intersecting path based on the first target vertex, the second target vertex, the third vertex, and the fourth vertex includes: If the third vertex and the first target vertex are the same vertex, and the fourth vertex and the second target vertex are also the same vertex, then the second non - intersecting path is established based on the first target vertex and the second target vertex; If the third vertex and the first target vertex are not the same vertex, but the fourth vertex and the second target vertex are the same vertex, then the second non - intersecting path is established based on the first target vertex, the third vertex, and the second target vertex; If the third vertex and the first target vertex are the same vertex, but the fourth vertex and the second target vertex are not the same vertex, then the second non - intersecting path is established based on the first target vertex, the fourth vertex, and the second target vertex; If the third vertex and the first target vertex are not the same vertex, and the fourth vertex and the second target vertex are also not the same vertex, then the first non - intersecting path is established based on the first target vertex, the third vertex, the second target vertex, and the fourth vertex; Delete the third vertex from the first set and delete the fourth vertex from the second set.

6. The construction method of non - intersecting paths on a folding, dividing and swapping cube according to claim 4, characterized in that, Constructing the second non - intersecting path based on the first target vertex, the second target vertex, the fifth vertex, and the sixth vertex includes: If the fifth vertex and the first target vertex are the same vertex, and the sixth vertex and the second target vertex are also the same vertex, then the second non - intersecting path is established based on the first target vertex and the second target vertex; If the fifth vertex and the first target vertex are not the same vertex, but the sixth vertex and the second target vertex are the same vertex, then the second non - intersecting path is established based on the first target vertex, the fifth vertex, and the second target vertex; If the fifth vertex and the first target vertex are the same vertex, but the sixth vertex and the second target vertex are not the same vertex, then the second non - intersecting path is established based on the first target vertex, the sixth vertex, and the second target vertex; If the fifth vertex and the first target vertex are not the same vertex, and the sixth vertex and the second target vertex are also not the same vertex, then the first non - intersecting path is established based on the first target vertex, the fifth vertex, the second target vertex, and the sixth vertex; Delete the fifth vertex from the first set and delete the sixth vertex from the second set.

7. A construction device for folding, splitting, and swapping non-intersecting paths on a cube, characterized in that, The device includes: A target determination module, configured to determine a first target vertex and a second target vertex on a folded split and exchanged cube; the first target vertex and the second target vertex are located in the same sub-network of an interconnection network, but not in the same sub-sub-network of the sub-network, and the interconnection network is composed of a plurality of sub-networks, and a sub-network is composed of a plurality of sub-sub-networks; A first construction module, configured to construct a first non-intersecting path based on a first set and a second set; the first set includes the first target vertex and the internal neighbors of the first target vertex, and the second set includes the second target vertex and the internal neighbors of the second target vertex; A second construction module, configured to construct a second non-intersecting path based on the external neighbor sets of the vertices in the first set and the second set; A third construction model, configured to construct a third non-intersecting path based on the sub-networks where the first target vertex and the second target vertex are located.

8. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the method for constructing non-intersecting paths on a folded split and exchanged cube according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, A computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, it implements the method for constructing non-intersecting paths on a folded split and exchanged cube according to any one of claims 1 to 6.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the method for constructing non-intersecting paths on a folded split and exchanged cube according to any one of claims 1 to 6.