The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
Abstract
Although Gaussian elimination with partial pivoting is a robust algorithm to solve unsymmetric sparse linear systems of equations, it is difficult to implement efficiently on parallel machines because of its dynamic and somewhat unpredictable way of generating work and intermediate results at run time. In this paper, we present an efficient parallel algorithm that overcomes this difficulty. The high performance of our algorithm is achieved through (1) using a graph reduction technique and a supernode-panel computational kernel for high single processor utilization, and (2) scheduling two types of parallel tasks for a high level of concurrency. One such task is factoring the independent panels in the disjoint subtrees of the column elimination tree of A. Another task is updating a panel by previously computed supernodes. A scheduler assigns tasks to free processors dynamically and facilitates the smooth transition between the two types of parallel tasks. No global synchronization is used in the algorithm. The algorithm is well suited for shared memory machines (SMP) with a modest number of processors. We demonstrate 4- to 7-fold speedups on a range of 8 processor SMPs, and more on larger SMPs. One realistic problem arising from a 3-D flow calculation achieves factorization rates of 1.0, 2.5, 0.8, and 0.8 gigaflops on the 12 processor Power Challenge, 8 processor Cray C90, 16 processor Cray J90, and 8 processor AlphaServer 8400.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A set of level 3 basic linear algebra subprograms
Dongarra, J. J., Du Croz, J., Hammarling, S., & Duff, I. S. (1990) · ACM Transactions on Mathematical Software · doi:10.1145/77626.79170 · Cited by 1,821
An extended set of FORTRAN basic linear algebra subprograms
Dongarra, J. J., Du Croz, J., Hammarling, S., & Hanson, R. J. (1988) · ACM Transactions on Mathematical Software · doi:10.1145/42288.42291 · Cited by 887
A Supernodal Approach to Sparse Partial Pivoting
Demmel, J. W., Eisenstat, S. C., Gilbert, J. R., Li, X. S., & Liu, J. W. H. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895291765 · Cited by 840
Self-citationDuff, I. S., Grimes, R. G., & Lewis, J. G. (1989) · ACM Transactions on Mathematical Software · doi:10.1145/62038.62043 · Cited by 650
Sparse Matrices in MATLAB: Design and Implementation
Gilbert, J. R., Moler, C., & Schreiber, R. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613024 · Cited by 591
Self-citationOptimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology
Bilmes, J., Asanovic, K., Chin, C.-W., & Demmel, J. (2014) · 25th Anniversary International Conference on Supercomputing Anniversary Volume - · doi:10.1145/2591635.2667174 · Cited by 453
Self-citationThe influence of relaxed supernode partitions on the multifrontal method
Ashcraft, C., & Grimes, R. G. (1989) · ACM Transactions on Mathematical Software · doi:10.1145/76909.76910 · Cited by 115
Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
George, A. D., & Ng, E. (1987) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0908072 · Cited by 98
A Data Structure for Sparse $QR$ and $LU$ Factorizations
George, A. D., Liu, J. K., & Ng, E. (1988) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0909008 · Cited by 46
Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
Eisenstat, S. C., & Liu, J. W. H. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613017 · Cited by 42
Cited by
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Solving unsymmetric sparse systems of linear equations with PARDISO
Schenk, O., & Gärtner, K. (2004) · Future Generation Computer Systems · doi:10.1016/j.future.2003.07.011 · Cited by 1,467
A Supernodal Approach to Sparse Partial Pivoting
Demmel, J. W., Eisenstat, S. C., Gilbert, J. R., Li, X. S., & Liu, J. W. H. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895291765 · Cited by 840
Self-citationSuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Li, X. S., & Demmel, J. W. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/779359.779361 · Cited by 628
Self-citationAn overview of SuperLU: Algorithms, implementation, and user interface
Li, X. S. (2005) · ACM Transactions on Mathematical Software · doi:10.1145/1089014.1089017 · Cited by 467
Self-citation
Metadata
- Authors
- Demmel, J. W., Gilbert, J. R., & Li, X. S.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 1999-01
- Volume
- 20
- Issue
- 4
- Pages
- 915-952
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2055094346
- Cited by
- 255
- References
- 10
- FWCI
- 10.95
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination. https://app.cochat.ai/papers/10.1137/s0895479897317685
- The paper
- Demmel, J. W., Gilbert, J. R., & Li, X. S. (1999). An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/s0895479897317685
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.