Efficiency of some parallel numerical algorithms on distributed systems
type: Item
instance of: scholarly article
title: Efficiency of some parallel numerical algorithms on distributed systems
zbMATH Open document ID: 0681.65110
DOI: 10.1016/0167-8191(89)90004-5
author: Luigi Brochard
published in: Parallel Computing
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 4115914
zbMATH Keywords: parallel computers
zbMATH Keywords: parallel algorithms
zbMATH Keywords: nearest neighbor networks
zbMATH Keywords: speedup
zbMATH Keywords: network complexity
zbMATH Keywords: matrix operations
zbMATH Keywords: multicolor domain decomposition iteration
zbMATH Keywords: multigrid method
zbMATH Keywords: message passing systems
MaRDI profile type: Publication
full work available at URL: 0167-8191(89)90004-5
OpenAlex ID: W2008747215
Recommended article: Efficient parallel algorithms for numerical simulation
Recommended article: On increasing the parallelism in numerical algorithms
Recommended article: Q4313993
Recommended article: Q3805745
Recommended article: Q4023517
Recommended article: Q5457683
Recommended article: Q3777446
Recommended article: Parallel efficiency of domain decomposition methods
description: scientific article; zbMATH DE number 4115914