Pipelining the Givens linear solver on distributed memory machines

J. Papay, M. J. Zemerly, G. R. Nudd

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Pipelining is normally associated with shared memory and vector computers and rarely used as an algorithm design technique for distributed memory architectures. In this paper we show how pipelining enables communication and computation to be overlapped on a distributed memory parallel computer (128-processor T800 Parsytec SuperCluster) yielding a significant speedup. A linear solver based on Givens rotations is selected and parallelized using two different techniques. A non-overlapping algorithm using collective communication, such as optimized broadcast and collection, is compared with a pipelined (overlapping) algorithm using only simple point-to-point communications between neighbouring processors. Both algorithms use the same computational modules which have been identified and extracted from the sequential code.

Original languageBritish English
Pages (from-to)37-42
Number of pages6
JournalSupercomputer
Volume12
Issue number3
StatePublished - Aug 1996

Fingerprint

Dive into the research topics of 'Pipelining the Givens linear solver on distributed memory machines'. Together they form a unique fingerprint.

Cite this