Parallel algorithms in linear algebra
Description
This paper provides an introduction to algorithms for fundamental linear algebra problems on various parallel computer architectures, with the emphasis on distributed-memory MIMD machines. To illustrate the basic concepts and key issues, we consider the problem of parallel solution of a nonsingular linear system by Gaussian elimination with partial pivoting. This problem has come to be regarded as a benchmark for the performance of parallel machines. We consider its appropriateness as a...[Show more]
dc.contributor.author | Brent, Richard P | |
---|---|---|
dc.date.accessioned | 2003-07-11 | |
dc.date.accessioned | 2004-05-19T12:57:39Z | |
dc.date.accessioned | 2011-01-05T08:52:38Z | |
dc.date.available | 2004-05-19T12:57:39Z | |
dc.date.available | 2011-01-05T08:52:38Z | |
dc.date.created | 1991 | |
dc.identifier.uri | http://hdl.handle.net/1885/40806 | |
dc.identifier.uri | http://digitalcollections.anu.edu.au/handle/1885/40806 | |
dc.description.abstract | This paper provides an introduction to algorithms for fundamental linear algebra problems on various parallel computer architectures, with the emphasis on distributed-memory MIMD machines. To illustrate the basic concepts and key issues, we consider the problem of parallel solution of a nonsingular linear system by Gaussian elimination with partial pivoting. This problem has come to be regarded as a benchmark for the performance of parallel machines. We consider its appropriateness as a benchmark, its communication requirements, and schemes for data distribution to facilitate communication and load balancing. In addition, we describe some parallel algorithms for orthogonal (QR) factorization and the singular value decomposition (SVD). | |
dc.format.extent | 166298 bytes | |
dc.format.extent | 356 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/octet-stream | |
dc.language.iso | en_AU | |
dc.subject | MIMD machines | |
dc.subject | Gaussian elimination | |
dc.subject | orthogonal factorization | |
dc.subject | singular value decomposition | |
dc.subject | Amdahl's Law | |
dc.subject | parallel architectures | |
dc.subject | data movement | |
dc.subject | data distribution | |
dc.subject | linear systems | |
dc.subject | symmetric eigenvalue problems | |
dc.subject | Hestenes method | |
dc.title | Parallel algorithms in linear algebra | |
dc.type | Working/Technical Paper | |
local.description.refereed | no | |
local.identifier.citationmonth | sep | |
local.identifier.citationyear | 1991 | |
local.identifier.eprintid | 1663 | |
local.rights.ispublished | yes | |
dc.date.issued | 1991 | |
local.contributor.affiliation | ANU | |
local.contributor.affiliation | Department of Computer Science, FEIT | |
local.citation | TR-CS-91-06 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
TR-CS-91-06.pdf | 162.4 kB | Adobe PDF |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator