A survey of parallel algorithms
Mathematica Applicanda, Tome 6 (1978) no. 12, pp. 43-63
Cet article a éte moissonné depuis la source Annales Societatis Mathematicae Polonae Series
After a description of the basic concepts, a model of a parallel computer is formulated. The main results about complexity of parallel algorithms for the calculation of linear recurrence relations are described. Constant speed-up for the nonlinear case is also mentioned. The parallel algorithms for a system of linear equations with a tridiagonal, triangular and full matrix are discussed. The method of problem- and algorithm-decomposition is demonstrated. Asynchronous algorithms for an MIMD-type computer are defined, and with some numerical examples for linear and nonlinear equations, these ideas are demonstrated.
@article{10_14708_ma_v6i12_1319,
author = {A. Boja\'nczyk},
title = {A survey of parallel algorithms},
journal = {Mathematica Applicanda},
pages = { 43--63},
year = {1978},
volume = {6},
number = {12},
doi = {10.14708/ma.v6i12.1319},
language = {pl},
url = {http://geodesic.mathdoc.fr/articles/10.14708/ma.v6i12.1319/}
}
A. Bojańczyk. A survey of parallel algorithms. Mathematica Applicanda, Tome 6 (1978) no. 12, pp. 43-63. doi: 10.14708/ma.v6i12.1319
Cité par Sources :