J. Papay, M.J. Zemerly and G.R. Nudd, Pipelining the Givens Linear Solver on Distributed Memory Machines (November 1, 1995).
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 T800 Parsytec SuperCluster) yielding a significant speedup. A linear solver based on Givens rotations is selected and parallelised using two different techniques. A non-overlapping algorithm using collective communication, such as optimised 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.