article · 2019
Parallel approach of algorithms
Cited by 8Abstract and details only
Abstract
Nowadays the parallelization of various computations becomes more and more important. In this book the theoretical models of parallel computing are presented. Problems that can be solved and problems that cannot be solved in these models are described. The parallel extensions of the traditional computing models, formal languages and automata are presented, as well as properties and semi-automatic verifications and generations of parallel programs. The concepts of theory of parallel algorithms and their complexity measures are introduced by the help of the (parallel) Super Turing-machine. The parallel extensions of context-free grammars, such as L-systems, CD and PC grammar systems; multihead automata (including various Watson-Crick automata), traces and trace languages are described. The theory and applications of Petri nets are presented by their basic concepts, special and extended models. From the practical, programming point of view, parallelization of (sequential) programs is investigated based on discovering of dependencies.
Cite this paper
Tamás, H., & Benedek, N. (2019). Parallel approach of algorithms.
Tamás, Herendi, and Nagy Benedek. “Parallel approach of algorithms.” 2019.
Tamás, Herendi, and Nagy Benedek. 2019. “Parallel approach of algorithms.”
Tamás, H. and Benedek, N. (2019) ‘Parallel approach of algorithms’.
@article{tamas2019parallel,
title = {{Parallel approach of algorithms}},
author = {Tamás, Herendi and Benedek, Nagy},
year = {2019}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.