Skip to main content
Log in

Development of algorithmic algebra tools to design parallel programs using heuristics

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The paper proposes a new approach and a system to develop parallel algorithms based on the joint use of the algebraic-algorithmic methodology of specification and development of programs and non-algorithmic (heuristic) techniques for code generation. The algebraic part of the methodology provides the formalized process of parallel program design through high-level algebraic-algorithmic specifications and automating transformations up to program code in a standard programming language. The heuristic part of the system is the dynamic adjustment of program code to a target platform and its optimization using self-learning code generation and heuristic technologies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Algebraic Methodology to Software Technology, http://www.amast.org.

  2. P. Naudin and C. Quitté, Algoritmique algébrique, avec exercices corrigés, Masson, Paris (1992).

    Google Scholar 

  3. F. I. Andon, A. E. Doroshenko, G. E. Tseitlin, and E. A. Yatsenko, Algebraic-Algorithmic Models and Methods of Parallel Programming [in Russian], Akademperiodika, Kyiv (2007).

    Google Scholar 

  4. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra. Languages. Programming [in Russian], 3rd ed., Naukova Dumka, Kyiv (1989).

    Google Scholar 

  5. K. Czarnecki and U. W. Eisenecker, Generative Programming: Methods, Tools, and Applications, ACM Press/Addison-Wesley Publishing Co., New York (2000).

    Google Scholar 

  6. O. A. Yatsenko, “Algebras of hyperschemes and integrated tools for synthesis of programs in modern object-oriented environments,” Cybern. Syst. Analysis, 40, No. 1, 38–42 (2004).

    Article  MATH  MathSciNet  Google Scholar 

  7. A. E. Doroshenko, K. A. Zhereb, and E. A. Yatsenko, “Formalized design of efficient multithread programs,” Problemy Program., No. 1, 17–30 (2007).

  8. A. Yu. Doroshenko, M. V. Kotyk, and S. S. Nikolaev, “A program platform for scientific studies,” Problemy Program., No. 4, 49–59 (2007).

  9. A. Doroshenko, G. Tseytlin, O. Yatsenko, and L. Zachariya, “A theory of clones and formalized design of programs,” in: Proc. Int. Conf. “Concurrency, Specification, and Programming,” (2006), pp. 328–339.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. E. Doroshenko.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 151–158, July–August 2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Doroshenko, A.E., Kotyuk, N.V., Nikolayev, S.S. et al. Development of algorithmic algebra tools to design parallel programs using heuristics. Cybern Syst Anal 46, 653–659 (2010). https://doi.org/10.1007/s10559-010-9241-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-010-9241-y

Keywords

Navigation