COMPUTER SYSTEMS AND NETWORKS

Graph!analytical solution of distributed process execution time problems

P. A. Pavlov

Polesskiy State University, Pinsk, Belarus

Abstract: The aim of the article is the conceptual development of mathematical models and methods for organizing parallel computations in the mode of synchronous interaction of locally distributed processes competing for the use of a limited number of copies of a structured software resource under conditions of unlimited and limited parallelism by the number of processors of a multiprocessor system. For this mode, using the mathematical apparatus of scheduling theory, linear diagrams, and arc-weighted graphs, the problems of determining the minimum total implementation time of a set of heterogeneous parallel distributed interacting competing processes are solved.

Keywords: multiprocessor system, process, software resource, structuring, pipelining, unlimited (limited) parallelism, linear diagram, arc-weighted graph.

DOI: 10.14357/20718632250306

Bibliographic databases:

•