Parallel Cholesky factorization on a hypercube multiprocessor
George A. Geist, Michael T. Heath · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1985
Two types of message-passing parallel algorithms are developed for solving symmetric systems of linear equations on a hypercube multiprocessor. One type involves broadcast communication among processors, and the other involves communication along a ring of processors. Details are provided in the form of C programs that implement the algorithms on a hypercube simulator and which should run with little modification on real hypercube hardware. Performance of the various algorithms is demonstrated by means of processor utilization graphs and parallel speedup curves.