Referenced Items are not available for this document.
This paper describes the design, implementation, and performance of a new parallel QR factorization algorithm based on the Compact WY representation of Householder reflections. In contrast to existing parallel algorithms, the multiprocessor partitioning strategy is not governed by an underlying static data distribution scheme. Rather, a dynamic distribution strategy is employed to exploit the capabilities of message passing architectures to overlap computation with communication. Experiments conducted on a 128-processor SGI Origin 2000 and a 64-processor HP SPP-2000 show that this new algorithm has a lower execution time than available tuned parallel routines installed on the machines including a version of ScaLAPACK's distributed QR factorization algorithm PDGEQRF
Published in:
Performance, Computing, and Communications Conference, 2002. 21st IEEE International
Date of Conference: 2002
- Page(s):
- 17 - 24
- Meeting Date :
- 03 Apr 2002-05 Apr 2002
- Print ISBN:
- 0-7803-7371-5
- INSPEC Accession Number:
- 7342213
- Conference Location :
- Phoenix, AZ
- Digital Object Identifier :
- 10.1109/IPCCC.2002.995132
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
