Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Formalized Algorithm Design and Auto-Tuning of Programs

Formalized Algorithm Design and Auto-Tuning of Programs
View Sample PDF
Copyright: 2021
Pages: 40
Source title: Formal and Adaptive Methods for Automation of Parallel Programs Construction: Emerging Research and Opportunities
Source Author(s)/Editor(s): Anatoliy Doroshenko (Institute of Software Systems, Ukraine) and Olena Yatsenko (Institute of Software Systems, Ukraine)
DOI: 10.4018/978-1-5225-9384-3.ch002


View Formalized Algorithm Design and Auto-Tuning of Programs on the publisher's website for pricing and purchasing information.


This chapter deals with the process of formalized design of sequential and parallel algorithms based on algorithm algebras. It gives the main concepts associated with metarules of schemes design (convolution, involution, reinterpretation, transformation). The SAA/1 language focused on natural linguistic algorithm representation and based on Glushkov's algebras is described. The algebra-grammatical models for parameter-driven generation of algorithm specifications based on higher-level schemes (hyperschemes) are then constructed. The authors propose the extension of the well-known PRAM model that is the basis of program auto-tuning. The hyperschemes and the auto-tuning are the means of increasing the adaptability of algorithms and programs to specific conditions of their use (for example, target computing platform). Some examples of formalized design of parallel sorting algorithm schemes using operations of Glushkov's algebras are given.

Related Content

. © 2021. 35 pages.
. © 2021. 30 pages.
. © 2021. 101 pages.
. © 2021. 25 pages.
. © 2021. 36 pages.
. © 2021. 28 pages.
. © 2021. 25 pages.
Body Bottom