UNSPECIFIED (1996) Pipelining the Givens linear solver on distributed memory machines. SUPERCOMPUTER, 12 (3). pp. 37-43. ISSN 0168-7875

Full text not available from this repository.

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.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Journal or Publication Title:	SUPERCOMPUTER
Publisher:	ASFRA
ISSN:	0168-7875
Date:	August 1996
Volume:	12
Number:	3
Number of Pages:	7
Page Range:	pp. 37-43
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/18442

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item