Algebra-Dynamic Models for CPU- and GPU-Parallel Program Design and the Model of Auto-Tuning

View Sample PDF

Copyright: 2021
Pages: 31
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.ch004

Keywords: Algorithms / Computer Engineering / Computer Science & IT / Information Science Reference

Purchase

View Algebra-Dynamic Models for CPU- and GPU-Parallel Program Design and the Model of Auto-Tuning on the publisher's website for pricing and purchasing information.

Abstract

This chapter considers algebra-dynamic models of parallel programs, which are based on concepts of transition systems theory and algebra of algorithms. The models of sequential and parallel multithreaded programs for multicore processors and program models for graphics processing units are constructed. The authors describe transformations of programs aimed at transition from sequential to parallel versions (parallelization) and improving performance of parallel programs in respect to execution time (optimization). The transformations are based on using rewriting rules technique. The formal model of program auto-tuning as an evolutional extension of transition systems is proposed, and some properties of programs are considered.

The IRMA Community

Research IRM

Algebra-Dynamic Models for CPU- and GPU-Parallel Program Design and the Model of Auto-Tuning

Purchase

Abstract

Related Content

IRMA Sponsors