Efficiency of some parallel numerical algorithms on distributed systems (Q1823643)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficiency of some parallel numerical algorithms on distributed systems |
scientific article; zbMATH DE number 4115914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiency of some parallel numerical algorithms on distributed systems |
scientific article; zbMATH DE number 4115914 |
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
0.90335083
0 references
0.9028722
0 references
0.89538586
0 references
0.8943306
0 references
