Impact Factor: ISRA (India) = 1.344 ISI (Dubai, UAE) = 0.829 GIF (Australia) = 0.564 JIF = 1.500 SIS (USA) = 0.912 РИНЦ (Russia) = 0.179 ESJI (KZ) = 1.042 SJIF (Morocco) = 2.031 ICV (Poland) = 6.630 PIF (India) = 1.940 ISPC Technological advances, Lancaster, USA 122Abstract: We research the potential parallelism of hypercubic computing systems, which is limited by the maximal allowable distance between processors, which are adjacent on data. Functions of a upper limitation on parallelism and of a topological scalability of such systems in case of solving tasks with complete graph on data, and also of tasks with ring and star topology on data are formalized. The corresponding diagrams are given and their analysis is given.

The aspects of topological compatibility of parallel computing systems and tasks are investigated in the present contribution. Based on the original topological model of parallel computations and on the unconventional graph description by its projections, the introduction of appropriate indexes is proposed and elucidated. On the example of hypercubic computing system (CS) and tasks with ring and star information topologies, we demonstrate the determination of indexes and their use in a comparative analysis of the applicability of interconnect with a given topology to solve the tasks with the same and different types of information topologies.

Aspects of compatibility of topologies of parallel computing systems and tasks are investigated. The introduction of appropriate indexes based on the original topological model of parallel computations and on the nontraditional description of a graph by its projections is proposed and elucidated. On the example of hypercubic computing system (CS) and tasks with ring and star information topologies, we demonstrate determining the indexes and their use in a comparative analysis of the applicability of interconnect with a given topology for solving tasks with the same and different types of information topologies.