DD289148A5 - METHOD FOR FORMING A NETWORK STRUCTURE WITH OPTIMUM CONNECTION PROBABILITY - Google Patents

Abstract

The method for forming a network structure with optimal likelihood of connection, waiving the use of additional nodes and lines is a solution that can be applied to structures that are in principle suitable for parallel processing of data. An improved structure is shown in FIG. Fig. 2 {computer network; Multiprocessor system; Multicomputer system; Parallel processing; Associated probability; Reliability}

Description

FIGS. 1 to 2 have the following node numbers η: FIG. 1 2

FIGS. 1 to 2 have the following edge numbers m: FIG. 1 2

FIGS. 1 to 2 show the following degree of knot cycles: Knotengrad Number

Fig.1 Fig. 2 4 1 1 3 2 2 2 7 7

FIGS. 1 to 2 have the following shortest circuit lengths: FIG.

1st shortest circle, formed with el: u1-u7-u8-u9-u10

2nd shortest circle, formed with e2: u1-u2-u3-u7

3rd shortest circle, formed with e3: u1-u2-u3-u7

4th shortest circle, formed with e4: u3-u4-u5-u6-u7

5. shortest circle, formed with o5: u3-u4-u5-u6-u7

6. shortest circle, formed with e6: u3-u4-u5-u6-u7

7. shortest circle, formed with e7: u3-u4-u5-u6-u7

8. shortest circle, formed with e8: u1-u7-u8-u9-u10

9. shortest circle, formed with e9: u1-u7-u8-u9-u10

10. shortest circle, formed with e 10: u1-u7-u8-u9-u10

11. shortest circle, formed with e 11: u1-u2-u3-u7

12th shortest circle, formed with e 12: u1-u2-u3-u7

1st shortest circle, formed with el: u3-u4-u7-u8-u9-u10

2nd shortest circle, formed with e2: u3-u4-u5-u6-u7

3rd shortest circle, formed with e3: u3-u4-u5-u6-u7

4. shortest circle, formed with E4: U3-U4-U5-U6-U7

5. shortest circle, formed with e5: u3-u4-u5-u6-u7

6. shortest circle, formed with e6: u3-u4-u5-u6-u7

7. shortest circle, formed with e7: u1-u2-u7-u8-u9-u10

8. shortest circle, formed with e8: u1-u2-u7-u8-u9-u10

9. shortest circle, formed with e9: u1-u2-u7-u8-u9-u10

10. shortest circle, formed with e 10: u1-u2-u7-u8-u9-u10

(Circle Length: 5) (Circle Length: 4) (Circle Length: 4) (Circle Length: 5) (Circle Length: 5) (Circle Length: 5) (Circle Length: 5) (Circle Length: 5) (Circle Length: 5) (Circle Length: 5) (Circle length: 4) (circle length: 4)

(Circle Length: 6) (Circle Length: 5) (Circle Length: 5) (Circle Length: 5) (Circle Length: 5) (Circle Length: 5) (Circle Length: 6) (Circle Length: 6) (Circle Length: 6) (Circle Length: 6)

11. shortest circle, formed with e 11:

u 1 -u 2-u 7-u 8-u 9-u 10 (circle length: 6)

12. shortest circle, formed with e12:

u 1-u 2-u 7-u 8-u 9-u 10 (circle length: 6)

circle length number Fig. 2 Fig.1 7 6 0 5 5 8th 0 4 4

Figures 1 ... 2 have the following connection probabilities P (U) (All edges e were rated with the following availabilities: ρ = 0.1, 0.5, 0.9, 0.95 and all nodes u have the Availability ρ = 1.):

P (O) P (Fig.1) P (Fig. 2) 0.1 7.0012 E-08 8.5564 E-08 0.5 3,8086 E-02 4,3945 E-02 0.9 8.7867 E-01 8,9727 E-01

0.95 9,6806 E-01 9,7421 E-01

Claims (2)

A method for forming a network structure with optimal likelihood of connection, which is balanced with respect to the knot degree, depending on the application purpose, wherein the nodes of the network structure preferably consist of processors and the nodes in the individual arrangements are interconnected by means of connecting elements, also called edges connected , characterized in that in a network structure with a number of m edges (u) the number of exchangeable edges (e) χ are maintained while maintaining the predetermined knot gradient condition so that the smallest length of the circles becomes maximum. For this 1 page drawings Field of application of the invention The invention relates to a method for forming a network structure with optimal probability of connexion, wherein the nodes that make up the network structure are interconnected by connecting elements, also called edges, and the structure can process data in parallel. An application is expedient wherever optimal network structures have to be formed with regard to the likelihood of connection while adhering to the node sequence condition. Characteristic of the known state of the art The prior art discloses various types of network structures which consist of processors and which can generally serve for the parallel processing of data. Thus, various network structures (DE 3629918 A1) are described, which can basically serve paper processing. A disadvantage of some of these, but also in other network structures that they are not optimal in terms of the probability of connection. Only two methods have been proposed so far, with which such network structures can be optimized with regard to the criterion probability of connection. This is, on the one hand, the "method for improving the likelihood of connection of predetermined multi-node arrangements in network structure" (DD patent application 330785.5) and, on the other hand, the "method for producing optimally reliable network structures from a given basic structure" (DD patent application 333314.1). The disadvantage of this method is that it reaches an optimum for the context selection probability only in a subset of all possible structures. Furthermore, it is well known that a multi-node network-wise-balanced structure has an advantage in relation to the probability-of-probability kernel over a structure with unbalanced nodal-cycling success. As a rule, however, with the balancing of the degree of nodularity, no optimal correlation probability is yet achieved. Object of the invention The aim of the invention is a method for forming a network structure with optimal probability of connection, which is suitable for the parallel processing of data. Explanation of the essence of the invention The object of the invention is a method which optimizes a given network structure with regard to the probability of connection while dispensing with additional nodes and edges. According to the invention, this object is achieved in that, in the network structure to be optimized with respect to the probability of interrelation, which has a node degree sequence balanced in accordance with its application, the edges which have been released by the user of the network structure for the edge interchanges are rearranged such that the smallest ones Circles, circles are formed by knots and edges, maximum. The specified node order must be maintained. The circle length formed by the number of nodes in a circle is a measure of the size of the circle. embodiment The invention will be described below with reference to an embodiment. The accompanying drawings show FIG. 1: structure to be optimized (the edges e1, e2, e3, e4, o5, e10, e11 and e12 are released for exchange.) FIG. 2: optimized structure (Dio shared edges were swapped.)