The interaction of parallel algorithms
Abstract
The interaction of parallel algorithms
Incoming article date: 24.05.2017In the article, we considered the actual problem of constructing an algorithm based on the interaction of parallel components. The paper contains elements of the methodology developed by the authors for the parallel functioning of algorithms based on graph theory. It is shown that the construction of an algorithm with parallel functioning of components is impossible without taking into account the time, for which the concept of a time axis was introduced, and the sequential algorithm is represented in the form of a bipartite graph by its additional definition. The methods of parallel algorithms represented in the article, realized as dual graphs or matrix predicate form, make it possible to use them in describing complex control and measuring systems. It is concluded that the advantage of such a representation of the parallel functioning of algorithms lies in the fact that it becomes possible to work with parallel hierarchical structures, tracing the changes in each of them by means of input time axes.
Keywords: algorithm, parallel processing, algorithms, parallel operation of objects posledovatelnostyu algorithms, predicative unit, time axis, of the dual graph, the interaction of parallel algorithms, graph-scheme of algorithm, functional-predicate module