Conference material: "Scientific service & Internet: proceedings of the 21th All-Russian Scientific Conference (September 23-28, 2019, Novorossiysk)"
On the possibility of parallel programs synthesis from algorithm graph specification
To solve the actual problem of automated parallel programming, the UPL language is proposed for specifying the M-graph of the algorithm and a roadmap for generating programs on its basis for various parallel platforms in automatic mode is presented. For this purpose, the user must specify in addition the distribution functions that map calculations to the platform resources. The algorithm for generating a loop nest by the M-graph of the algorithm and the combined distribution function is described, and its operation is demonstrated by a simple example.
parallel programming, dataflow computation model, algorithm graph, graph representation language, distribution function, automated program synthesis