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 language | English (US) |
|---|---|
| Pages (from-to) | 487-512 |
| Number of pages | 26 |
| Journal | Parallel Computing |
| Volume | 22 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jun 1996 |
| Externally published | Yes |
Keywords
- Distributed memory machines
- Iterative solvers
- MIMD/SPMD machines
- Model of programming
- Parallel efficiency
- Parallel implementation
- Partitioned algorithms
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Computer Graphics and Computer-Aided Design
- Artificial Intelligence