By Topic

Memory-adaptive parallel sparse Cholesky factorization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
K. Eswar ; Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA ; Chua-Huang Huang ; P. Sadayappan

The problem of Cholesky factorization of sparse positive-definite matrices on distributed-memory multiprocessors is considered. A column-based algorithm with the ability to adapt to the amount of memory available on each processor is presented. Exploiting the available memory allows the local computation on each processor to be ordered so that good local efficiencies and dynamic load balance are achieved. A proof that this distributed algorithm is deadlock-free is given. Experimental results of an implementation of this algorithm on an Intel iPSC/860 multiprocessor system are reported

Published in:

Scalable High-Performance Computing Conference, 1994., Proceedings of the

Date of Conference:

23-25 May 1994