Parallel QR factorization for hybrid message passing/shared memory operation

Authors
Dunn, IN Meyer, GGL
Citation
In. Dunn et Ggl. Meyer, Parallel QR factorization for hybrid message passing/shared memory operation, J FRANKL I, 338(5), 2001, pp. 601-613
Citations number
10
Categorie Soggetti
Engineering Management /General
Journal title
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS
ISSN journal
00160032 → ACNP
Volume
338
Issue
5
Year of publication
2001
Pages
601 - 613
Database
ISI
SICI code
0016-0032(200108)338:5<601:PQFFHM>2.0.ZU;2-F
Abstract
The capability to blend the message passing and shared memory programming e nvironments is a common feature of many high performance computer architect ures. To probe the performance benefits of this feature on a 64-processor H P 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. (C) 20 01 The Franklin Institute. Published by Elsevier Science Ltd. All rights re served.