Paper Info
Title
A practical and portable model of programming for iterative solvers on distributed memory machines
Abstract
A practical and portable model of parallel programming inspired from the systolic handling of array shift on SIMD machines is presented. All the communications are hidden to the user who can code parallel iterative solvers in a more natural way on MIMD machines. Parallel efficiency and speed performance of this model are then discussed on the iPSC/860, IBM SP2 and Cray T3D in four examples of preconditioned conjugate gradient to solve a diffusion problem.
Year
DOI
Venue
1996
10.1016/0167-8191(96)00017-8
Parallel Computing
Keywords
Field
DocType
iterative solvers,model of programming,distributed memory machines,partitioned algorithms,parallel efficiency,mimd/spmd machines,memory machine,parallel implementation,portable model
Conjugate gradient method,IBM,Computer science,Parallel computing,Distributed memory,Theoretical computer science,Parallel programming model,Computational science,Simd machines,MIMD
Journal
Volume
Issue
ISSN
22
4
Parallel Computing
Citations 
PageRank 
References 
1
0.54
7
Authors
2
Name
Order
Citations
PageRank
Samuel Kortas1172.52
Philippe Angot211415.02