Skip to main content
Conference ProceedingsOPEN ACCESS

Optimization of the ScaLAPACK LU factorization routine using communication/computation overlap

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1124 3-10
DOI: 10.1007/bfb0024678
6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents some optimizations based on communications/computations overlap for the ScaLAPACK LU factorization. First a theoretical computation of the optimal block size is given for the block scattered decomposition of the matrix. Two optimizations of this routine are presented that use asynchronous communications to hide the communication overhead and to obtain optimal speed-ups.

Cite

CITATION STYLE

APA

Desprez, F., Domas, S., & Tourancheau, B. (1996). Optimization of the ScaLAPACK LU factorization routine using communication/computation overlap. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1124, pp. 3–10). Springer Verlag. https://doi.org/10.1007/bfb0024678

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free