Out-of-Core Computation of the QR Factorization on Multi-core Processors
- Cite this paper as:
- Marqués M., Quintana-Ortí G., Quintana-Ortí E.S., van de Geijn R. (2009) Out-of-Core Computation of the QR Factorization on Multi-core Processors. In: Sips H., Epema D., Lin HX. (eds) Euro-Par 2009 Parallel Processing. Euro-Par 2009. Lecture Notes in Computer Science, vol 5704. Springer, Berlin, Heidelberg
We target the development of high-performance algorithms for dense matrix operations where data resides on disk and has to be explicitly moved in and out of the main memory. We provide strong evidence that, even for a complex operation like the QR factorization, the use of a run-time system creates a separation of concerns between the matrix computations and I/O operations with the result that no significant changes need to be introduced to existing in-core algorithms. The library developer can thus focus on the design of algorithms-by-blocks, addressing disk memory as just another level of the memory hierarchy. Experimental results for the out-of-core computation of the QR factorization on a multi-core processor reveal the potential of this approach.
KeywordsDense linear algebra out-of-core computation QR factorization multi-core processors high performance
Unable to display preview. Download preview PDF.