By Topic

Minimum Completion Time Criterion for 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

2 Author(s)
Wen-Yang Lin ; National Taiwan University, Taiwan ; Chuen-Liang Chen

It is well known that a judicious choice of ordering has great impact on the sparse matrix factorization. Many proposed reordering algorithms attempt to minimize the corresponding elimination tree height, which is, however, not an accurate indication of the actual parallel factorization time. We will illustrate the appalling discrepancy with a contrived example.

Published in:

Parallel Processing, 1993. ICPP 1993. International Conference on  (Volume:3 )

Date of Conference:

16-20 Aug. 1993