Parallel Cholesky factorization on orthogonal multiprocessors

From MaRDI portal





The author presents the parallel Cholesky factorization algorithm on orthogonal multiprocessors. Two data allocation strategies --- simple and uniform --- are considered. Three theorems are proved in this context. Studying the asymptotic efficiency, the author shows when each of the strategies should be used.











This page was built for publication: Parallel Cholesky factorization on orthogonal multiprocessors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186181)