A practical and portable model of programming for iterative solvers on distributed memory machines

Samuel Kortas*, Philippe Angot

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)487-512
Number of pages26
JournalParallel Computing
Volume22
Issue number4
DOIs
StatePublished - Jun 1996
Externally publishedYes

Keywords

  • Distributed memory machines
  • Iterative solvers
  • MIMD/SPMD machines
  • Model of programming
  • Parallel efficiency
  • Parallel implementation
  • Partitioned algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'A practical and portable model of programming for iterative solvers on distributed memory machines'. Together they form a unique fingerprint.

Cite this