A survey of parallel algorithms

• Autorzy: A. Bojańczyk
• Języki publikacji: EN

Abstrakty

EN

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.

PL

Artykuł nie zawiera streszczenia

Słowa kluczowe

EN

Algorithms

• Wydawca: Polish Mathematical Society
• Czasopismo: Mathematica Applicanda
• Rocznik: 1978
• Tom: 6
• Numer: 12

Daty

wydano

1978

online

1978-11-01

Twórcy

autor

A. Bojańczyk

Identyfikatory

DOI

10.14708/ma.v6i12.1319