Efficiency of some parallel numerical algorithms on distributed systems (Q1823643)

From MaRDI portal
Revision as of 09:51, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    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

    Identifiers