On Some Resources Placement Schemes in the 4-Dimensional Soft Degradable Hypercube Processors Network

In the paper some properties of the perfect resources placement in the 4-dimensional hypercube processors network with soft degradation are investigated. The two types of network processors (resource processors - I/O ports and working processors) are taken into consideration. In the work the notion of (m,d|G)- perfect resources placement in a structure G of the hypercube type is extended to (k|G) - perfect placement concept, that is a such allocation of G resources which minimizes the average distances between the working processors and resource processors in the structure G Two algorithms for determining (m,d|G) - perfect resources placement and the (k|G) - resources perfect placement in a structure G of the hypercube network was given. The average number of working processors in the degraded 4-dimensional network with a given order (degree of degradation) for the (1,1|G) resource placement is determined. This value characterizes the loss of the network computing capabilities resulting from the increase of the degree of network degradation