CN117389941A - Fault tolerance upper bound solving method and device for interconnection network structure - Google Patents
Fault tolerance upper bound solving method and device for interconnection network structure Download PDFInfo
- Publication number
- CN117389941A CN117389941A CN202311394598.2A CN202311394598A CN117389941A CN 117389941 A CN117389941 A CN 117389941A CN 202311394598 A CN202311394598 A CN 202311394598A CN 117389941 A CN117389941 A CN 117389941A
- Authority
- CN
- China
- Prior art keywords
- vertex
- neighbor
- upper bound
- fdsc
- fault tolerance
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000010586 diagram Methods 0.000 claims abstract description 67
- 238000005192 partition Methods 0.000 claims abstract description 44
- 239000000203 mixture Substances 0.000 claims description 33
- 239000004744 fabric Substances 0.000 claims description 17
- 230000000295 complement effect Effects 0.000 claims description 12
- 238000003860 storage Methods 0.000 claims description 6
- 238000012545 processing Methods 0.000 abstract description 9
- 238000004891 communication Methods 0.000 abstract description 6
- 230000006870 function Effects 0.000 description 7
- 238000004590 computer program Methods 0.000 description 3
- 238000010276 construction Methods 0.000 description 2
- 229920002430 Fibre-reinforced plastic Polymers 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000005520 cutting process Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 239000011151 fibre-reinforced plastic Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000003208 petroleum Substances 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
- G06F15/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
- G06F15/17356—Indirect interconnection networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
- G06F15/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
- G06F15/17306—Intercommunication techniques
- G06F15/17318—Parallel communications techniques, e.g. gather, scatter, reduce, roadcast, multicast, all to all
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention discloses a fault tolerance upper bound solving method and device of an interconnection network structure, and belongs to the technical field of computers. In the method, K of the exchange diagram is divided for folding 1,1 The structure firstly determines all neighbor vertexes of the currently selected vertexes according to K 1,1 The structure communication characteristics of the folding partition exchange diagram are that different types of sets are determined from all neighbor vertexes and external vertexes, union processing is carried out to obtain the size of the union, and then K of the folding partition exchange diagram is determined according to the size of the union 1,1 The upper boundary of the structural connectivity and the substructure connectivity of the structure uses K 1,1 The upper bound of the structure connectivity and the sub-structure connectivity of the structure determines the structure fault tolerance of the interconnection network, thereby realizing any vertex on a given folding exchange diagram and constructing the folding partition exchange diagram FDSC n K of (n.gtoreq.8) 1，1 The upper bound of the structural connectivity and the sub-structural connectivity of the structure.
Description
Technical Field
The embodiment of the invention relates to the technical field of computers, in particular to a fault tolerance upper bound solving method and device of an interconnection network structure.
Background
High-performance parallel computers play an increasingly important role in related fields such as scientific research, education, petroleum, weather and the like. With the increasing performance of high performance parallel computers, the number of processors (processors) it has become increasingly large. The network in which several processors are connected in a specific manner is called the InternetA network of interconnections (Interconnection Network) can be represented by a simple graph g= (V (G), E (G)), where V (G) represents the vertex set of graph G and E (G) represents the edge set of graph G. The vertices in graph G represent processor nodes in the interconnection network, while the edges represent connection links between processor nodes. Folding partition exchange diagram FDSC n Is a typical interconnection network topology.
For an interconnection network, structural fault tolerance is represented by structural connectivity and sub-structural connectivity. Fabric fault tolerance may be used to measure the reliability of a network when certain fabrics in a network fail. The greater the structural fault tolerance of the network, the greater the reliability of the network when the network fails structurally.
For folding partition exchange diagram FDSC n This interconnection network topology has no upper bound solution for structural fault tolerance in the related art.
Disclosure of Invention
The embodiment of the invention provides a fault tolerance upper bound solving method and device for an interconnection network structure, which are used for solving the problem that the fault tolerance upper bound solving method for the interconnection network structure is difficult in the related art. The technical scheme is as follows:
on one hand, the embodiment of the invention provides an interconnection network structure fault tolerance upper bound solving method, which is suitable for folding partition exchange diagram FDSC n K of (2) 1,1 Fault tolerance upper bound solution of structure, folding partition exchange diagram FDSC n For representing an interconnection network, said folding partition switch diagram FDSC n There is 2 n Vertices u, n=2 d And n is greater than or equal to 8 and d is greater than or equal to 3, the method comprising:
in folding and dividing the exchange diagram FDSC n In determining all neighbor vertices u of said vertex u i The neighbor vertex u i I is equal to or more than 2 and equal to or less than d and is the i neighbor of the vertex u;
neighbor set { u } of vertex u 1 ,u f Composition of 1K 1,1 A structure, denoted as a first set, where u f A complement point denoted as the vertex u;
neighbor set { u } of vertex u d+1 ,u d+1,1 Composition of 1K 1,1 A structure, denoted as a second set;
neighbor set { u } of vertex u i ,u i,d+1 Composition d-1K 1,1 A structure, denoted as a third set;
determining a union of the first set, the second set, and the third set;
determining the folding partition exchange diagram FDSC according to the size of the union n K of (2) 1,1 The upper bound of the structural connectivity and sub-structural connectivity of the structure;
using the K 1,1 The upper bound of the structural connectivity and the sub-structural connectivity of the fabric determines the structural fault tolerance of the interconnect network.
On the other hand, the embodiment of the invention provides an interconnection network structure fault tolerance upper bound solving device, which comprises a folding partition switching diagram FDSC n For representing an interconnection network, said folding partition switch diagram FDSC n There is 2 n Vertices u, n=2 d And n is greater than or equal to 8, d is greater than or equal to 3, the device comprising:
vertex determining module for dividing the switch diagram FDSC in folding n In determining all neighbor vertices u of said vertex u i The neighbor vertex u i I is equal to or more than 2 and equal to or less than d and is the i neighbor of the vertex u;
a first composition module for combining the neighbor set { u } of the vertex u 1 ,u f Composition of 1K 1,1 A structure, denoted as a first set, where u f A complement point denoted as the vertex u;
a second composition module for combining the neighbor set { u } of the vertex u d+1 ,u d+1,1 Composition of 1K 1,1 A structure, denoted as a second set;
a third composition module for combining the neighbor set { u } of the vertex u i ,u i,d+1 Composition d-1K 1,1 A structure, denoted as a third set;
a union determination module configured to determine a union of the first set, the second set, and the third set;
an upper bound determining module, configured to determine, according to the size of the union, the folding partition switch diagram FDSC n K of (2) 1,1 The upper bound of the structural connectivity and sub-structural connectivity of the structure;
fault tolerance determining module for using the K 1,1 The upper bound of the structural connectivity and the sub-structural connectivity of the fabric determines the structural fault tolerance of the interconnect network.
In another aspect, an embodiment of the present invention provides a terminal, where the terminal includes a processor and a memory; the memory stores at least one instruction for execution by the processor to implement the interconnection network structure fault tolerance upper bound solution method of the above aspect.
In another aspect, a computer-readable storage medium is provided that stores at least one instruction for execution by a processor to implement the interconnection network structure fault tolerance upper bound solution method of the above aspect.
In another aspect, a computer program product is provided that stores at least one instruction that is loaded and executed by a processor to implement the interconnection network structure fault tolerance upper bound solution method of the above aspect.
By adopting the method for solving the upper bound of the fault tolerance of the interconnection network structure provided by the embodiment of the invention, aiming at K of the folding partition exchange diagram 1,1 The structure firstly determines all neighbor vertexes of the currently selected vertexes according to K 1,1 The structure communication characteristics of the folding partition exchange diagram are that different types of sets are determined from all neighbor vertexes and external vertexes, union processing is carried out to obtain the size of the union, and then K of the folding partition exchange diagram is determined according to the size of the union 1,1 The upper boundary of the structural connectivity and the substructure connectivity of the structure uses K 1,1 The upper bound of the structure connectivity and the sub-structure connectivity of the structure determines the structure fault tolerance of the interconnection network, thereby realizing any vertex on a given folding exchange diagram and constructing the folding partition exchange diagram FDSC n K of (n.gtoreq.8) 1，1 Knot of structureConstruct the upper bound of connectivity and substructure connectivity.
Drawings
FIG. 1 shows a folding partition switch diagram FDSC provided by an exemplary embodiment of the invention 2 And FDSC 4 Schematic of (2);
FIG. 2 illustrates a schematic diagram of an H-structure cut shown in accordance with an exemplary embodiment of the present invention;
FIG. 3 illustrates a schematic diagram of an H-sub-structure cut shown in accordance with an exemplary embodiment of the present invention;
FIG. 4 shows K 1，m And C 4 Is a structural schematic diagram of (a);
FIG. 5 illustrates a flow chart of a fault tolerance upper bound solution method for an interconnect network structure, as shown in an exemplary embodiment of the invention;
FIG. 6 shows a schematic diagram of the structure of the neighbor vertices of the corresponding vertex u of FIG. 5;
FIG. 7 shows a construction FDSC corresponding to FIG. 5 n K of (2) 1，1 A schematic diagram of a structure cutting process;
FIG. 8 is a block diagram illustrating an interconnection network architecture fault tolerance upper bound solver according to one embodiment of the present invention;
fig. 9 is a block diagram showing the structure of a terminal according to an exemplary embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the embodiments of the present invention will be described in further detail with reference to the accompanying drawings.
References herein to "a plurality" means two or more. "and/or", describes an association relationship of an association object, and indicates that there may be three relationships, for example, a and/or B, and may indicate: a exists alone, A and B exist together, and B exists alone. The character "/" generally indicates that the context-dependent object is an "or" relationship.
The method for solving the fault tolerance upper bound of the interconnection network structure is suitable for folding partition exchange diagram FDSC n K of (2) 1,1 Fault tolerance upper bound solution of structure, folding lineFractional exchange diagram FDSC n For representing an interconnection network.
First, background knowledge related to the folding partition exchange diagram is described as follows.
Folding partition exchange diagram FDSC n There is 2 n (n＝2 d D.gtoreq.1) vertices, each of which may be represented as a binary digit string of n bits, i.e., u=s 1 s 2 …s n . Wherein s is i ＝0，1(1≤i≤n)。
Folding partition exchange diagram FDSC as shown in FIG. 1 2 And FDSC 4 . When n=4, 0101 and 1001 are the labels of two vertices thereof. Dividing the representation of vertex u into 3 parts, i.e. u=s 1 s 2 …s n ＝t 1 t 2 t 3 . Wherein t is 1 Expressed as (formula 1), t 2 Expressed as (formula 2), t 3 Expressed as (formula 3).
Note that if k=1, then t 3 Is an empty string. For FDSC n Is said to be connected to v when v satisfies one of the following conditions.
(1)Wherein (1)>At this time, (u, v) is referred to as the e (1) side.
(2)At this time, (u, v) is called the e (f) side.
(3) If t 1 ＝t 2 ThenIf t 1 ≠t 2 Then v=t 2 t 1 t 3 . At this time, (u, v) is called +.>Edges.
FDSC as shown in FIG. 1 4 Vertex 0000 is connected to vertex 1000, and vertex 0010 is connected to vertex 0110. We will use labels directly to denote vertices later. For any vertex u, there are d+2 vertices connected to it.
Two vertices are connected, and then the two vertices are neighbors of each other. For any vertex u, if (u, v) is an e (1) edge, then v is referred to as the 1 neighbor of u, noted v=u 1 . If (u, v) is the e (f) edge, then v is referred to as the f neighbor of u, denoted v=uw. If (u, v) isEdge, then v is called the d+2-k neighbor of u, denoted v=u i (i=d+2-k). For example, in fig. 1, 1 neighbor of vertex 0010 is 1010, f neighbor is 0110,2 neighbor is 1110. Thus, 1010=0010 1 ，0110＝0010 f ，1110＝0010 2 . In addition, u i，j J neighbors of i neighbors representing vertex u, and so on.
Let f= { F 1 ，F 2 ，…，F t The sub-graph set of figure G is a sub-graph of G for each element in F. If V (F) is deleted such that G is not connected, then F is referred to as a subgraph cut of graph G. Let diagram H be a connected subgraph in diagram G, if each element in F is isomorphic to H, then F is called an H-structure cut. Typically a graph has a number of H-cuts, the size of which is the least elemental cutThe degree of structural connectivity, designated kappa (FDSC) n ；H)。
If each element in F is isomorphic to one connected subgraph of H, then F is called an H-substructure cut (F: an H-substructure-cut). Typically a graph has a number of H-sub-structure cuts, the size of the structure cut with the smallest number of sub-graphs in the structure cut being the sub-structure connectivity, denoted as kappa s (FDSC n The method comprises the steps of carrying out a first treatment on the surface of the H) A. The invention relates to a method for producing a fibre-reinforced plastic composite By definition we have kappa (FDSC) n ；H)≥κ s (FDSC n ；H)。
The H-structure cut schematic shown in FIG. 2, with three triangle structures deleted, can make the graph non-connected. The set of these triangular structures is a structure cut.
The H-substructure shown in FIG. 3 is cut into schematic views, and the three structures are deleted to render the views non-contiguous. Since these three structures are all sub-graphs of a square structure, the set of these structures is a sub-structure.
The structural connectivity and the sub-structural connectivity are collectively referred to as structural fault tolerance. Fabric fault tolerance may be used to measure the reliability of a network when certain fabrics in a network fail. The greater the structural fault tolerance of the network, the greater the reliability of the network when the network fails structurally.
In the related art, the switch diagram FDSC is divided in a folding manner n There is no upper bound solution for structural fault tolerance. The related paper (Structure and substructure connectivity of divide-and-swap cube) discusses a partition switch diagram DSC n Upper K 1，m (2.ltoreq.m.ltoreq.d+1) and C 4 Is not shown in the drawings.
As shown in FIG. 4, K 1，m Is a claw-type structure with a central apex, C 4 Is a graph containing 4 vertices due to FDSC n Compared with DSC n Each vertex has one more edge, so that the structure of the graph is changed, and the structural fault tolerance upper bound solving method of the two is different.
Therefore, the invention provides an interconnection network structure fault tolerance upper bound solving method which is suitable for folding partition exchange diagram FDSC n K of (2) 1,1 The fault tolerance upper bound of the structure is solved, please refer to the description of the embodiments below.
Referring to FIG. 5, a flow chart of a fault tolerance upper bound solution method for an interconnection network architecture according to an exemplary embodiment of the invention is shown. The embodiment is applied to the folding partition exchange diagram FDSC by the method n K of (2) 1,1 The fault tolerance upper bound solution of the structure is illustrated, and the method comprises:
step 501, dividing the switch diagram FDSC in a folding manner n In determining all neighbor vertices u of vertex u i 。
Wherein, folding and dividing the exchange diagram FDSC n For representing interconnected networks, folding partition switch diagram FDSC n There is 2 n Vertices u, n=2 d And n is greater than or equal to 8, d is greater than or equal to 3, neighbor vertex u i I is equal to or more than 2 and equal to or less than d and is the i neighbor of the vertex u.
Step 502, neighbor set { u } of vertex u 1 ,u f Composition of 1K 1,1 The structure is denoted as the first set.
For convenience of representation, the first set is denoted by F1, u f The complement of the vertex u, can also be understood from FIG. 1 f Structural relationship with vertex u. Fig. 6 shows a schematic diagram of the structure of the neighboring vertex of the vertex u corresponding to fig. 5.
In one possible implementation, all neighbor vertices u of vertex u are obtained i Determining a first neighbor vertex u of the vertex u according to the first connection relationship 1 And complement point u f According to the vertex u, the first neighbor vertex u 1 And complement point u f Constitute 1K 1,1 The structure is noted as a first set, i.e., put into the first set.
Step 503, the neighbor set { u } of the vertex u d+1 ,u d+1,1 Composition of 1K 1,1 The structure is denoted as the second set.
For ease of representation, the second set is denoted by F2 and the process of step 503 includes obtaining all neighbor vertices u of vertex u i The method comprises the steps of carrying out a first treatment on the surface of the From the neighbor vertex u i The (d+1) th neighbor vertex u of the obtained vertex u d+1 And, the (d+1) th neighbor vertex u d+1 Is the first of (1)Neighbor vertex, d+1th neighbor vertex u d+1 Is marked as u d+1,1 The method comprises the steps of carrying out a first treatment on the surface of the According to u d+1 And u d+1,1 Constitute 1K 1,1 The structure is noted as a second set, i.e., put into the second set.
Step 504, the neighbor set { u } of the vertex u i ,u i,d+1 Composition d-1K 1,1 The structure is denoted as the third set.
For ease of representation, the third set is denoted by F3, and the process of step 504 includes obtaining all neighbor vertices u of vertex u i The method comprises the steps of carrying out a first treatment on the surface of the Obtaining the remaining neighbor vertices u i And, the remaining neighbor vertices u i External neighbor vertex u of (1) i,d+1 The method comprises the steps of carrying out a first treatment on the surface of the From the remaining neighbor vertices u i And u i,d+1 Constitute 1K 1,1 The structure is noted as the third set, i.e., put into the third set.
Step 505, determining a union of the first set, the second set, and the third set.
In one possible implementation, the results of the first set, the results of the second set, and the results of the third set are obtained, and the union F of the first set F1, the second set F2, and the third set F3 is determined according to a union operation of the union.
Step 506, determining the folding partition exchange diagram FDSC according to the size of the union n K of (2) 1,1 The upper bound of the structural connectivity and the sub-structural connectivity of the structure.
Since the value of the structural connectivity is not smaller than that of the sub-structural connectivity, the value of the structural connectivity is smaller than that of the union. The structural connectivity is the minimum of the structural cuts that render the pattern non-connected, according to the definition of structural connectivity. The presently constructed structure set F is one of many structure sets, which may not be the smallest, so the value of the structure connectivity must be equal to or less than |f|. The size of F is the folding partition exchange diagram FDSC n K of (2) 1，1 Is the upper bound of the structural connectivity of (c).
Step 507, using K 1,1 The upper bound of the fabric connectivity and sub-fabric connectivity of the fabric determines the fabric fault tolerance of the interconnect network.
The structural connectivity and the sub-structural connectivity are collectively referred to as structural fault tolerance. Fabric fault tolerance may be used to measure the reliability of a network when certain fabrics in a network fail. The greater the structural fault tolerance of the network, the greater the reliability of the network when the network fails structurally.
FIG. 7 shows a construction FDSC corresponding to FIG. 5 n K of (2) 1，1 The process schematic of the structure cut, in one example, the algorithm process schematic corresponding to fig. 7 is described in terms of the following program algorithm.
The invention can construct the upper bound of the structural connectivity on the folding partition exchange diagram, and by giving any vertex u, we construct d+1K around the neighbor vertex of u 1，1 Structure such that FDSC n Non-connected to obtain FDSC n K of (2) 1，1 Structural connectivity and sub-structural connectivity.
For K 1，1 Structural connectivity and substructural connectivity, in FDSC 8 For example, let u=00000000, by calling k11_fdsc_connectivity, K can be constructed as follows 1，1 Collection of structures: f= { {10000000,01000000}, {11111111,01111111}, {11000000,00001111}, {11110000,00001111 }. After deleting V (F), FDSC 8 Not connected, the vertex u is an independent branch, so F is the required K 1，1 The structure is cut to 4, so that FDSC can be obtained 8 K of (2) 1，1 The upper limit of the structural connectivity is 4, which is marked as: kappa (kappa) s (FDSC 8 ；K 1，1 )≤κ(FDSC 8 ；K 1，1 )≤4。
In summary, by adopting the method for solving the upper bound of fault tolerance of the interconnection network structure provided by the embodiment of the invention, K of the folding partition exchange diagram is aimed at 1,1 The structure firstly determines all neighbor vertexes of the currently selected vertexes according to K 1,1 The structure communication characteristics of the folding partition exchange diagram are that different types of sets are determined from all neighbor vertexes and external vertexes, union processing is carried out to obtain the size of the union, and then K of the folding partition exchange diagram is determined according to the size of the union 1,1 The upper boundary of the structural connectivity and the substructure connectivity of the structure uses K 1,1 The upper bound of the structure connectivity and the sub-structure connectivity of the structure determines the structure fault tolerance of the interconnection network, thereby realizing any vertex on a given folding exchange diagram and constructing the folding partition exchange diagram FDSC n K of (n.gtoreq.8) 1，1 The upper bound of the structural connectivity and the sub-structural connectivity of the structure.
Referring now to FIG. 8, shown is a block diagram illustrating an apparatus for solving an upper bound fault tolerance of an interconnect network fabric adapted for folding partition switch fabric FDSC in accordance with one embodiment of the present invention n K of (2) 1,1 Fault tolerance upper bound solution of structure, folding partition exchange diagram FDSC n For representing an interconnection network, said folding partition switch diagram FDSC n There is 2 n Vertices u, n=2 d And n is greater than or equal to 8, d is greater than or equal to 3, the device comprising:
vertex determining module 801 for dividing the switch diagram FDSC in folding n In determining all neighbor vertices u of said vertex u i The neighbor vertex u i I is equal to or more than 2 and equal to or less than d and is the i neighbor of the vertex u;
a first composition module 802 for grouping { u } the neighbors of the vertex u 1 ,u f Composition of 1K 1,1 A structure, denoted as a first set, where u f A complement point denoted as the vertex u;
a second composition module 803 for grouping { u } the neighbors of the vertex u d+1 ,u d+1,1 Composition of 1K 1,1 A structure, denoted as a second set;
a third composition module 804, configured to combine the neighbor set { u } of the vertex u i ,u i,d+1 Composition d-1K 1,1 A structure, denoted as a third set;
a union determination module 805 configured to determine a union of the first set, the second set, and the third set;
an upper bound determining module 806, configured to determine the folding partition switch diagram FDSC according to the size of the union n K of (2) 1,1 The upper bound of the structural connectivity and sub-structural connectivity of the structure;
fault tolerance determination module 807 for using the K 1,1 The upper bound of the structural connectivity and the sub-structural connectivity of the fabric determines the structural fault tolerance of the interconnect network.
Optionally, the first composition module 802 includes:
acquiring all neighbor vertexes u of the vertexes u i ；
Determining a first neighbor vertex u of the vertex u according to a first connection relationship 1 And complement point u f ；
According to the vertex u and the first neighbor vertex u 1 And the complement point u f Constitute 1K 1,1 And (3) a structure, namely the first set.
Optionally, the second composition module 803 includes:
acquiring all neighbor vertexes u of the vertexes u i ；
From the neighbor vertex u i The (d+1) th neighbor vertex u of the vertex u is obtained d+1 And, the (d+1) th neighbor vertex u d+1 Is to the first neighbor vertex of the (d+1) th neighbor vertex u d+1 Is marked as u d+1,1 ；
According to said u d+1 And said u d+1,1 Constitute 1K 1,1 And (3) a structure, namely the second set.
Optionally, the third composition module 804 includes:
acquiring all neighbor vertexes u of the vertexes u i ；
Obtaining the remaining neighbor vertices u i And, the remaining neighbor vertices u i External neighbor vertex u of (1) i,d+1 ；
According to the rest neighbor vertexes u i And said u i,d+1 Constitute 1K 1,1 And (3) a structure, namely the third set.
Optionally, the union determining module 805 includes:
acquiring the results of the first set, the results of the second set and the results of the third set;
and determining the union sets of the first set, the second set and the third set according to the combination operation of the union sets.
Optionally, the value of the structural connectivity is not smaller than the value of the sub-structural connectivity, and the value of the structural connectivity is smaller than the value of the union.
Referring to fig. 9, a block diagram illustrating a structure of a terminal 900 according to an exemplary embodiment of the present invention is shown. The terminal 900 may be an electronic device in which an application program is installed and run, such as a smart phone, a tablet computer, an electronic book, a portable personal computer, etc. The terminal 900 of the present invention may include one or more of the following components: processor 910, memory 920, and screen 930.
Processor 910 may include one or more processing cores. The processor 910 connects various parts within the overall terminal 900 using various interfaces and lines, performs various functions of the terminal 900 and processes data by executing or executing instructions, programs, code sets, or instruction sets stored in the memory 920, and invoking data stored in the memory 920. Alternatively, the processor 910 may be implemented in hardware in at least one of digital signal processing (Digital Signal Processing, DSP), field programmable gate array (Field-Programmable Gate Array, FPGA), programmable logic array (Programmable Logic Array, PLA). The processor 910 may integrate one or a combination of several of a central processing unit (Central Processing Unit, CPU), an image processor (Graphics Processing Unit, GPU), and a modem, etc. The CPU mainly processes an operating system, a user interface, an application program and the like; the GPU is responsible for rendering and drawing of the content required to be displayed by the screen 930; the modem is used to handle wireless communications. It will be appreciated that the modem may not be integrated into the processor 910 and may be implemented solely by a single communication chip.
The Memory 920 may include a random access Memory (Random Access Memory, RAM) or a Read-Only Memory (Read-Only Memory). Optionally, the memory 920 includes a non-transitory computer readable medium (non-transitory computer-readable storage medium). Memory 920 may be used to store instructions, programs, code, sets of codes, or instruction sets. The memory 920 may include a stored program area and a stored data area, where the stored program area may store instructions for implementing an operating system, which may be an Android (Android) system (including a system developed based on an Android system), an IOS system developed by apple corporation (including a system developed based on an IOS system depth), or other systems, instructions for implementing at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing the above-described various method embodiments, and so on. The storage data area may also store data created by terminal 1000 in use (e.g., phonebook, audiovisual data, chat log data), and the like.
The screen 930 may be a touch display screen for receiving a touch operation of a user thereon or thereabout using a finger, a touch pen, or any other suitable object, and displaying a user interface of the respective application programs. The touch display screen is typically provided at the front panel of the terminal 900. The touch display screen may be designed as a full screen, a curved screen, or a contoured screen. The touch display screen may also be designed as a combination of a full screen and a curved screen, and the combination of a special-shaped screen and a curved screen, which is not limited in the embodiment of the present invention.
Embodiments of the present invention also provide a computer readable medium storing at least one instruction that is loaded and executed by the processor to implement the fault tolerance upper bound solution method of the interconnection network structure as described in the above embodiments.
Embodiments of the present invention also provide a computer program product storing at least one instruction that is loaded and executed by the processor to implement the fault tolerance upper bound solution method of the interconnection network structure as described in the above embodiments.
Those skilled in the art will appreciate that in one or more of the examples described above, the functions described in the embodiments of the present invention may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, these functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
The foregoing description of the preferred embodiments of the present invention is not intended to limit the invention, but rather, the invention is to be construed as limited to the appended claims.
Claims (9)
1. An interconnection network structure fault tolerance upper bound solving method is characterized in that the method is suitable for folding partition exchange diagram FDSC n K of (2) 1,1 Fault tolerance upper bound solution of structure, folding partition exchange diagram FDSC n For representing an interconnection network, said folding partition switch diagram FDSC n There is 2 n A plurality of vertices, where n=2 d And n is greater than or equal to 8 and d is greater than or equal to 3, the method comprising:
in folding and dividing the exchange diagram FDSC n In determining all neighbor vertices u of said vertex u i The neighbor vertex u i I is equal to or more than 2 and equal to or less than d and is the i neighbor of the vertex u;
neighbor set { u } of vertex u 1 ,u f Composition of 1K 1,1 A structure, denoted as a first set, where u f A complement point denoted as the vertex u;
neighbor set { u } of vertex u d+1 ,u d+1,1 Composition of 1K 1,1 A structure, denoted as a second set;
neighbor of the vertex uResident set { u ] i ,u i,d+1 Composition d-1K 1,1 A structure, denoted as a third set;
determining a union of the first set, the second set, and the third set;
determining the folding partition exchange diagram FDSC according to the size of the union n K of (2) 1,1 The upper bound of the structural connectivity and sub-structural connectivity of the structure;
using the K 1,1 The upper bound of the structural connectivity and the sub-structural connectivity of the fabric determines the structural fault tolerance of the interconnect network.
2. The method of claim 1, wherein the grouping of neighbors { u } of the vertex u 1 ,u f Composition of 1K 1,1 A structure, denoted as a first set, comprising:
acquiring all neighbor vertexes u of the vertexes u i ；
Determining a first neighbor vertex u of the vertex u according to a first connection relationship 1 And complement point u f ；
According to the vertex u and the first neighbor vertex u 1 And the complement point u f Constitute 1K 1,1 And (3) a structure, namely the first set.
3. The method of claim 1, wherein the grouping of neighbors { u } of the vertex u d+1 ,u d+1,1 Composition of 1K 1,1 A structure, denoted as a second set, comprising:
acquiring all neighbor vertexes u of the vertexes u i ；
From the neighbor vertex u i The (d+1) th neighbor vertex u of the vertex u is obtained d+1 And, the (d+1) th neighbor vertex u d +1 Is to the first neighbor vertex of the (d+1) th neighbor vertex u d+1 Is marked as u d+1,1 ；
According to said u d+1 And said u d+1,1 Constitute 1K 1,1 A structure denoted as the second setAnd (5) combining.
4. The method of claim 1, wherein the grouping of neighbors { u } of the vertex u i ,u i,d+1 Composition d-1K 1,1 A structure, denoted as a third set, comprising:
acquiring all neighbor vertexes u of the vertexes u i ；
Obtaining the remaining neighbor vertices u i And, the remaining neighbor vertices u i External neighbor vertex u of (1) i,d+1 ；
According to the rest neighbor vertexes u i And said u i,d+1 Constitute 1K 1,1 And (3) a structure, namely the third set.
5. The method of claim 1, wherein the determining a union of the first set, the second set, and the third set comprises:
acquiring the results of the first set, the results of the second set and the results of the third set;
and determining the union sets of the first set, the second set and the third set according to the combination operation of the union sets.
6. The method of any one of claims 1 to 5, wherein the value of the structural connectivity is not less than the value of the sub-structural connectivity, which is less than the value of the union.
7. An interconnection network structure fault tolerance upper bound solving device, which is characterized in that the device is suitable for folding partition exchange diagram FDSC n K of (2) 1,1 Fault tolerance upper bound solution of structure, folding partition exchange diagram FDSC n For representing an interconnection network, said folding partition switch diagram FDSC n There is 2 n Vertices u, n=2 d And n is greater than or equal to 8, d is greater than or equal to 3, the device comprising:
vertex determining module for dividing the switch graph FD in foldingSC n In determining all neighbor vertices u of said vertex u i The neighbor vertex u i I is equal to or more than 2 and equal to or less than d and is the i neighbor of the vertex u;
a first composition module for combining the neighbor set { u } of the vertex u 1 ,u f Composition of 1K 1,1 A structure, denoted as a first set, where u f A complement point denoted as the vertex u;
a second composition module for combining the neighbor set { u } of the vertex u d+1 ,u d+1,1 Composition of 1K 1,1 A structure, denoted as a second set;
a third composition module for combining the neighbor set { u } of the vertex u i ,u i,d+1 Composition d-1K 1,1 A structure, denoted as a third set;
a union determination module configured to determine a union of the first set, the second set, and the third set;
an upper bound determining module, configured to determine, according to the size of the union, the folding partition switch diagram FDSC n K of (2) 1,1 The upper bound of the structural connectivity and sub-structural connectivity of the structure;
fault tolerance determining module for using the K 1,1 The upper bound of the structural connectivity and the sub-structural connectivity of the fabric determines the structural fault tolerance of the interconnect network.
8. A terminal, the terminal comprising a processor and a memory; the memory stores at least one instruction for execution by the processor to implement the interconnection network structure fault tolerance upper bound solution method of any one of claims 1 to 6.
9. A computer readable storage medium having stored thereon at least one instruction for execution by a processor to implement the fault tolerance upper bound solution method of the interconnection network structure of any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311394598.2A CN117389941B (en) | 2023-10-26 | 2023-10-26 | Fault tolerance upper bound solving method and device for interconnection network structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311394598.2A CN117389941B (en) | 2023-10-26 | 2023-10-26 | Fault tolerance upper bound solving method and device for interconnection network structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117389941A true CN117389941A (en) | 2024-01-12 |
| CN117389941B CN117389941B (en) | 2024-03-22 |
Family
ID=89469864
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311394598.2A Active CN117389941B (en) | 2023-10-26 | 2023-10-26 | Fault tolerance upper bound solving method and device for interconnection network structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117389941B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110888761A (en) * | 2019-11-29 | 2020-03-17 | 北京仿真中心 | Fault-tolerant method based on active backup of key task part and stream processing platform |
| US20200394444A1 (en) * | 2019-06-17 | 2020-12-17 | Tianzhi Yang | Associating spatial point sets with candidate correspondences |
| US20210133246A1 (en) * | 2019-11-01 | 2021-05-06 | Baidu Usa Llc | Transformation for fast inner product search on graph |
| US20210286859A1 (en) * | 2020-02-27 | 2021-09-16 | University Of Virginia Patent Foundation | System, method and computer readable medium for sensitivity of dynamical systems to interaction network topology |
| CN114741217A (en) * | 2022-05-06 | 2022-07-12 | 苏州大学 | Method, device, equipment and storage medium for determining fault tolerance of network structure |
| CN114826931A (en) * | 2022-04-24 | 2022-07-29 | 苏州工业园区服务外包职业学院 | Method, device, equipment and storage medium for determining fault tolerance of alternate group network structure |
| CN116208967A (en) * | 2022-12-27 | 2023-06-02 | 南京航空航天大学 | Efficient and reliable virtual backbone network construction method |
-
2023
- 2023-10-26 CN CN202311394598.2A patent/CN117389941B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200394444A1 (en) * | 2019-06-17 | 2020-12-17 | Tianzhi Yang | Associating spatial point sets with candidate correspondences |
| US20210133246A1 (en) * | 2019-11-01 | 2021-05-06 | Baidu Usa Llc | Transformation for fast inner product search on graph |
| CN110888761A (en) * | 2019-11-29 | 2020-03-17 | 北京仿真中心 | Fault-tolerant method based on active backup of key task part and stream processing platform |
| US20210286859A1 (en) * | 2020-02-27 | 2021-09-16 | University Of Virginia Patent Foundation | System, method and computer readable medium for sensitivity of dynamical systems to interaction network topology |
| CN114826931A (en) * | 2022-04-24 | 2022-07-29 | 苏州工业园区服务外包职业学院 | Method, device, equipment and storage medium for determining fault tolerance of alternate group network structure |
| CN114741217A (en) * | 2022-05-06 | 2022-07-12 | 苏州大学 | Method, device, equipment and storage medium for determining fault tolerance of network structure |
| CN116208967A (en) * | 2022-12-27 | 2023-06-02 | 南京航空航天大学 | Efficient and reliable virtual backbone network construction method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117389941B (en) | 2024-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8497863B2 (en) | Graph scalability | |
| CN117389942B (en) | Fault tolerance upper bound solving method and device for interconnection network structure | |
| CN109783757B (en) | Method, device and system for rendering webpage, storage medium and electronic device | |
| US20150138211A1 (en) | Method and Device for Loading and Unloading Object Hierarchically in Three-Dimensional Virtual Reality Scene | |
| CN109558159B (en) | Method and device for updating user interface in game | |
| CN114741217B (en) | Method, device, equipment and storage medium for determining fault tolerance of network structure | |
| CN111127612A (en) | Game scene node updating method and device, storage medium and electronic equipment | |
| CN111753094A (en) | Method and device for constructing event knowledge graph and method and device for determining event | |
| US11586695B2 (en) | Iterating between a graphical user interface and plain-text code for data visualization | |
| CN114826931B (en) | Method, device, equipment and storage medium for determining fault tolerance of alternate group network structure | |
| CN113079094A (en) | Method, device and storage medium for determining processing path of multiprocessor network | |
| CN117389941B (en) | Fault tolerance upper bound solving method and device for interconnection network structure | |
| CN110297764A (en) | Loophole test model training method and device | |
| CN116820577B (en) | Parallel processing method and device for model, first computing equipment and electronic equipment | |
| CN117742996A (en) | Communication optimization method and device for calculation, electronic equipment and storage medium | |
| CN115795203B (en) | Method and device for constructing menu page, electronic equipment and storage medium | |
| CN105279157B (en) | A kind of method and apparatus of canonical inquiry | |
| CN109343838A (en) | Chat feature development approach and system, terminal and computer readable storage medium | |
| CN111228815B (en) | Method, apparatus, storage medium and system for processing configuration table of game | |
| CN111291884B (en) | Neural network pruning method, device, electronic equipment and computer readable medium | |
| CN104243201A (en) | Method and system for storing topological graph corresponding to network equipment test case | |
| CN111125715A (en) | TCG data processing acceleration method and device based on solid state disk, computer equipment and storage medium | |
| CN114283045B (en) | Data processing method, device, electronic equipment and storage medium | |
| CN114387150B (en) | Processing method, device, equipment and storage medium for artificial intelligence learning | |
| CN117058272A (en) | Image drawing method, device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |