Efficiency of some parallel numerical algorithms on distributed systems (Q1823643): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-8191(89)90004-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008747215 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:13, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiency of some parallel numerical algorithms on distributed systems |
scientific article |
Statements
Efficiency of some parallel numerical algorithms on distributed systems (English)
0 references
1989
0 references
Excellent paper. Author: ``The present study is an attempt for a better understanding of the relations between parallel algorithms and architecture.'' Discussion and analysis of: speedup, network complexity, matrix operations, multicolor domain decomposition iteration, multigrid method. Especially nearest neighbor one- and two-dimensional networks are discussed for message passing systems.
0 references
parallel computers
0 references
parallel algorithms
0 references
nearest neighbor networks
0 references
speedup
0 references
network complexity
0 references
matrix operations
0 references
multicolor domain decomposition iteration
0 references
multigrid method
0 references
message passing systems
0 references
