UNSPECIFIED (2003) Communication-efficient parallel Gaussian elimination. In: 7th International Conference on Parallel Computing Technologies (PaCT 2003), SEP 15-19, 2003, NIZHNII NOVGOROD, RUSSIA.

Full text not available from this repository.

Abstract

The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. In this paper, we consider the parallel complexity of two matrix problems: Gaussian elimination with pairwise pivoting, and orthogonal matrix decomposition by Givens rotations. We define a common framework that unifies both problems, and present a new communication-efficient BSP algorithm for their solution. Apart from being a useful addition to the growing collection of efficient BSP algorithms, our result can be viewed as a refinement of the classical ''parallelism-communication tradeoff''.

Item Type:	Conference Item (UNSPECIFIED)
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name:	LECTURE NOTES IN COMPUTER SCIENCE
Journal or Publication Title:	PARALLEL COMPUTING TECHNOLOGIES, PROCEEDINGS
Publisher:	SPRINGER-VERLAG BERLIN
ISBN:	3-540-40673-5
ISSN:	0302-9743
Editor:	Malyshkin, V
Date:	2003
Volume:	2763
Number of Pages:	15
Page Range:	pp. 369-383
Publication Status:	Published
Title of Event:	7th International Conference on Parallel Computing Technologies (PaCT 2003)
Location of Event:	NIZHNII NOVGOROD, RUSSIA
Date(s) of Event:	SEP 15-19, 2003
URI:	http://wrap.warwick.ac.uk/id/eprint/9221

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item