Glushkov’s Algorithmic Algebras and Automated Parallel Computing Design

• Published in: Cybernetics and systems analysis Vol. 59; no. 5; pp. 687 - 697
• Main Authors: Andon, P. I., Doroshenko, A. Yu, Ivanenko, P. A., Yatsenko, O. A.
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.09.2023; Springer; Springer Nature B.V
• Subjects: Algebra; Algorithms; Artificial Intelligence; Computational linguistics; Control; Cybernetics; Digital integrated circuits; Field programmable gate arrays; Graphics processing units; Language processing; Mathematics; Mathematics and Statistics; Microprocessors; Multiprocessing; Natural language interfaces; Platforms; Problem solving; Processor Architectures; Software; Software development; Software Engineering/Programming and Operating Systems; Synthesis; Systems Theory; Technology application; software autotuning; algebra of algorithms; program design and synthesis; parallel computating
• ISSN: 1060-0396; 1573-8337
• DOI: 10.1007/s10559-023-00604-z

An overview of the results obtained within the algebra of algorithms and tools for the automated development of programs for multiprocessor platforms is presented. Algorithmics is based on the theory of algorithmic algebras and is focused on solving a wide range of applied problems and developing software tools for automated design and synthesis of classes of algorithms and programs. The generality of algorithms is based on the variety of interpretations of algorithm schemes and provides the possibility of applying algorithms and their tools for solving problems related to various subject domains. The combination of algorithmics and rule rewriting technique made it possible to develop methods and tools aimed at automated design, transformation, synthesis, and tuning of programs for various platforms (multicore processors, graphics processing units, and field-programmable gate arrays).