Pipelining the Givens linear solver on distributed memory machines
UNSPECIFIED. (1996) Pipelining the Givens linear solver on distributed memory machines. SUPERCOMPUTER, 12 (3). pp. 37-43. ISSN 0168-7875Full text not available from this repository.
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.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Journal or Publication Title:||SUPERCOMPUTER|
|Official Date:||August 1996|
|Number of Pages:||7|
|Page Range:||pp. 37-43|
Actions (login required)
Downloads per month over past year