Parallel QR factorization for hybrid message passing/shared memory operation

The capability to blend the message passing and shared memory programming environments is a common feature of many high performance computer architectures. To probe the performance benefits of this feature on a 64-processor HP SPP-2000, a 32-processor IBM SP3, and a 128-processor SGI Origin 2000, we...

Full description

Saved in:
Bibliographic Details
Published in:Journal of the Franklin Institute 2001-08, Vol.338 (5), p.601-613
Main Authors: Dunn, Ian N., Meyer, Gerard G.L.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Message passing
Parallel QR
Shared memory
Software
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The capability to blend the message passing and shared memory programming environments is a common feature of many high performance computer architectures. To probe the performance benefits of this feature on a 64-processor HP SPP-2000, a 32-processor IBM SP3, and a 128-processor SGI Origin 2000, we propose a new hybrid parallel fast Givens QR factorization algorithm that can interpolate between pure message passing and pure shared memory.
ISSN:0016-0032
1879-2693
DOI:10.1016/S0016-0032(01)00023-0