Efficiency of some parallel numerical algorithms on distributed systems
From MaRDI portal
Publication:1823643
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.
Recommendations
- Efficient parallel algorithms for numerical simulation
- On increasing the parallelism in numerical algorithms
- scientific article; zbMATH DE number 697775
- scientific article; zbMATH DE number 4074326
- scientific article; zbMATH DE number 107949
- On the speedup of parallel iterative numerical methods
- scientific article; zbMATH DE number 4039280
- Parallel efficiency of domain decomposition methods
Cited in
(6)- On the theory and practice of multisplitting methods in parallel computation
- Parallel finite element fluid analysis on an element-by-element basis
- scientific article; zbMATH DE number 147703 (Why is no real title available?)
- scientific article; zbMATH DE number 697775 (Why is no real title available?)
- Communication analysis of the PIE and QIF algorithms on distributed memory architecture
- Network computing performance evaluation in message passing environment
This page was built for publication: Efficiency of some parallel numerical algorithms on distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823643)