Support tools for creation and transformation of functional-dataflow parallel programs
Автор: Legalov A.I., Vasilyev V.S., Matkovskii I.V., Ushakova M.S.
Журнал: Труды Института системного программирования РАН @trudy-isp-ran
Статья в выпуске: 5 т.29, 2017 года.
Бесплатный доступ
In the article, a novel approach to the development, analysis and transformation of parallel programs is considered. A functional dataflow parallel programming language is used. It supports writing programs independently of any resource limitations. This allows to develop algorithms with maximal level of parallelism. Support tools for translation, execution, debugging, optimization and verification of functional dataflow parallel programs are developed. The translator transforms source code of a program to an intermediate representation, in which each function is defined by its dataflow graph. A dataflow graph describes data dependencies in the function and allows to construct the control graph, which defines the organization of computations by specifying the order of the operators execution. The optimization and verification of the program is carried out on their dataflow and control graphs. In order to execute a program the maximal parallelism is to be «compressed» according to particular computing systems' resource limitations. A computation process is considered as a juxtaposition of the control graph and the dataflow graph. It is possible to employ different control strategies by means of control graphs modification. The developed support tools allow to change computation control strategies adapting them to the peculiarities of a computational environment. The suggested tools provide generation of intermediate representation, which could be used as a basis for the following transformations of a program to the program for existed parallel computing systems architecture.
Architecture-independent parallel programming, transformation of programs, software development tools, control graph, functional-dataflow parallel programming, dataflow graph
Короткий адрес: https://sciup.org/14916471
IDR: 14916471 | DOI: 10.15514/ISPRAS-2017-29(5)-10