IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Algebras of Algorithms, Parallel Computing, and Software Auto-Tuning

Algebras of Algorithms, Parallel Computing, and Software Auto-Tuning
View Sample PDF
Copyright: 2021
Pages: 35
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.ch001

Purchase

View Algebras of Algorithms, Parallel Computing, and Software Auto-Tuning on the publisher's website for pricing and purchasing information.

Abstract

This chapter gives an overview of programming methods (algebraic, parallel, adaptive, and other) related to the approach of the program design proposed in the book. Algorithm algebras intended for formalized description of algorithms in the form of high-level schemes are considered: Dijkstra's algebra associated with technology of structured programming; Kaluzhnin's algebra for graphical description of non-structured schemes of algorithms; Glushkov's algebra for description of structured schemes, including the facilities for computation process prediction and design of parallel algorithms; the algebra of algorithmics, which is based on the mentioned algebras. The signature of each algebra consists of predicate and operator constructs conforming to a specific method of algorithm design, that is, structured, non-structured, and other. Basic notions related to software auto-tuning are considered, and the classification of auto-tuners is 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