You are using an outdated browser Internet Explorer. It does not support some functions of the site.

Recommend that you install one of the following browsers: Firefox, Opera or Chrome.


+7 961 270-60-01

Elements of graphical metalanguage for parallel computing


Elements of graphical metalanguage for parallel computing

Zmejev D.N., Klimov A.V., Levchenko N.N., Okunev A.S.

Incoming article date: 16.11.2018

A new parallel programming language is being developed. A feature of this language will be that, based on the developed algorithm for solving any problem, it is possible with minimal effort to generate an effective parallel program code for different computation models. Such a parallel metalanguage is based on the dataflow computing model with a dynamically formed context. The graphic version of the metalanguage has the advantage of a clear presentation of information and is much better suited to the nature of human perception. The concept of graphical programming consists in compiling a program from a set of certain objects and connecting them together according to special rules. In addition, each of the objects and the connection between them in the form of a directional line have a set of properties and attributes, which, when compiled, convert them into an object with the necessary logical load corresponding to the program algorithm being created. The article provides a graphical representation and description of such metalanguage elements as “token”, “standard node” and “single-port node”, “node with three standard inputs” and “group symmetric node”, as well as program structures: “group”, “cycle” and ""module"". A whole series of parallel programs was created using a graphical version of the metalanguage.

Keywords: graphical representation, metalanguage, parallelization of computations, dataflow computing model