The Community for Technology Leaders
Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2002)
Phoenix, AZ, USA
Apr. 3, 2002 to Apr. 5, 2002
ISBN: 0-7803-7371-5
pp: 17-24
I.N. Dunn , Wireless Comput. Group, Mercury Comput. Syst. Inc., Chelmsford, MA, USA
ABSTRACT
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.
INDEX TERMS
CITATION
G.G.L. Meyer, I.N. Dunn, "Parallel compact WY QR factorization for asynchronous message passing", Performance, Computing, and Communications Conference, 2002. 21st IEEE International, vol. 00, no. , pp. 17-24, 2002, doi:10.1109/IPCCC.2002.995132
95 ms
(Ver 3.3 (11022016))