QR Factorization with Morton-Ordered Quadtree Matrices for Memory Re-use and Parallelism (2003)
| Venue: | In Proc. 2003 ACM Symp. on Principles and Practice of Parallel Programming |
| Citations: | 11 - 1 self |
BibTeX
@INPROCEEDINGS{Frens03qrfactorization,
author = {Jeremy D. Frens and David S. Wise},
title = {QR Factorization with Morton-Ordered Quadtree Matrices for Memory Re-use and Parallelism},
booktitle = {In Proc. 2003 ACM Symp. on Principles and Practice of Parallel Programming},
year = {2003},
pages = {144--154}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this blocking results in code that honors the memory hierarchy without the need for transforming the code. Furthermore, the divide-and-conquer algorithm breaks problems down into independent computations. These independent computations can be dispatched in parallel for straightforward parallel processing. Proof-of-concept is given by an algorithm for QR factorization based on Givens rotations for quadtree matrices in Morton-order storage. The algorithms deliver positive results, competing with and even beating the LAPACK equivalent. Categories and subject descriptors:
