论文信息 - Parallel Cholesky factorization on orthogonal multiprocessors

Parallel Cholesky factorization on orthogonal multiprocessors

Abstract We present the parallel Cholesky factorization algorithm on orthogonal multiprocessors — an architecture with a simplified busing structure and partially shared memory. We study two data allocation strategies for the algorithm and show their influence on the time complexity. Studying the asymptotic efficiency we show when each of them should be used.

Przemyslaw Stpiczynski | Przemysław Stpiczyński

[1] M. Heath,et al. Matrix factorization on a hypercube multiprocessor , 1985 .

[2] A. George,et al. Parallel Cholesky factorization on a shared-memory multiprocessor. Final report, 1 October 1986-30 September 1987 , 1986 .

[3] Jack J. Dongarra,et al. A collection of parallel linear equations routines for the Denelcor HEP , 1984, Parallel Comput..

[4] G. A. Geist,et al. Parallel Cholesky factorization on a hypercube multiprocessor , 1985 .

[5] Kai Hwang,et al. An Orthogonal Multiprocessor for Parallel Scientific Computations , 1989, IEEE Trans. Computers.

[6] Yiming Ma,et al. Vector computations on an orthogonal memory access multiprocessing system , 1987, 1987 IEEE 8th Symposium on Computer Arithmetic (ARITH).