Developing and Optimizing Parallel Programs with Algebra-Algorithmic and Term Rewriting Tools

Automated Program Design – an Example Solving a Weather Forecasting Problem

“…Our approach to an automated design of programs is based on a method which ensures the syntactical regularity of algorithm schemes [1,3,4]. The method consists of unfolding the design of schemes by superposition of predefined SAA language constructs (such as presented above in previous subsections), which are considered as reusable components and are stored in the database.…”

“…The mapping of SAA operators to a text in a programming language is defined in the form of code templates in the database. We implemented the aforementioned approach in the IDS toolkit [1,3,4] and its alternative version, called the Synthesis framework [5]. The IDS toolkit is intended for automated design of algorithm schemes and generation of programs in target programming languages (Java, C++).…”

“…In previous works [1][2][3][4][5], we have been developing a theory, methodology and software tools for automated parallel program design, based on the algebra of algorithms. The algebra is applied for formalization, substantiation of correctness and transformation of algorithms.…”

“…The algebra is applied for formalization, substantiation of correctness and transformation of algorithms. The developed algebra-algorithmic tools include the Integrated toolkit for Design and Synthesis of programs (IDS) [1,3,4] and its alternative version, the Syn-thesis framework [5], which is based on usage of Web technologies. The IDS toolkit is intended for automated design and generation of serial and parallel programs on the basis of high-level specifications of algorithms (schemes).…”

“…Another advantage of our tools is the method of automated design of syntactically correct algorithm specifications [1,3,4], which eliminates syntax errors during construction of algorithm schemes.…”