arrow
Return

Highly scalable parallel algorithms for sparse matrix factorization

delete1997-05-01
delete124
PRE
AI
A
Anshul Gupta *
G
George Karypis
K
Kumar, V
DOI:10.1109/71.598277delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, we describe scalable parallel algorithms for symmetric sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1,024 processors on a Gray T3D parallel computer. Through our analysis and experimental results, we demonstrate that our algorithms substantially improve the state of the art in parallel direct solution of sparse linear systems-both in terms of scalability and overall performance. It is a well known fact that dense matrix factorization scales well and can be implemented efficiently on parallel computers. In this paper, we present the first algorithms to factor a wide class of sparse matrices (including those arising from two- and three-dimensional finite element problems) that are asymptotically as scalable as dense matrix factorization algorithms on a variety of parallel architectures. Our algorithms incur less communication overhead and are more scalable than any previously known parallel formulation of sparse matrix factorization. Although, in this paper, we discuss Cholesky factorization of symmetric positive definite matrices the algorithms can be adapted for solving sparse linear least squares problems and for Gaussian elimination of diagonally dominant matrices that are almost symmetric in structure. An implementation of one of our sparse Cholesky factorization algorithms delivers up to 20 GFlops on a Gray T3D for medium-size structural engineering and linear programming problems. To the best of our knowledge, this is the highest performance ever obtained for sparse Cholesky factorization on any supercomputer.
Keywords:
parallel processing
sparse matrices
Cholesky factorization
sparse linear systems
scalability analysis
high performance computing
parallel scientific computing
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Parallel and Distributed Systems cover
IEEE Transactions on Parallel and Distributed Systems
IF:
6
Papers:
5.2K
Citations:
1.1W

Organization

No organization information available
Cited Papers

Cited Papers

Establishing a Symbiotic Interface between Cultured Ectomycorrhizal Fungi and Plants to Follow Fungal Phosphate Metabolism
err2017-01-01
err0
errOAAI
errAdeline Becquer; Margarita Torres-Aquino; Christine Le Guernevé; Laurie Amenc; Carlos Trives-Segura; Siobhan Staunton; Hervé Quiquampoix; Claude Plassard
errShare
errSave
Special glasses as energy detectors for fission fragments
err1974-04-01
err0
PREAI
errJ. Aschenbach; G. Fiedler; H. Schreck-Köllner; G. Siegert
errShare
errSave
Antenna-coupled niobium bolometers for millimeter-wave imaging arrays
err1999-11-12
err0
PREAI
errShalva Nolen; Jonathan A. Koch; Nicholas G. Paulter; Carl D. Reintsema; Erich N. Grossman
errShare
errSave
Familial syndromes associated with neuroendocrine tumours
err2015-01-01
err0
errOAAI
errPaweł Gut; Hanna Komarowska; Agata Czarnywojtek; Joanna Waligórska-Stachura; Maciej Bączyk; Katarzyna Ziemnicka; Jakub Fischbach; Elżbieta Wrotkowska; Marek Ruchała
errShare
errSave
Investigating Antibacterial Efficiency and Mechanism of Oligo-thiophenes under White Light and Specific Biocidal Activity against E. coli in Dark
err2021-03-15
err0
PREAI
errJing Wang; Xia Yang; Peng Zhao; Hao Deng; Lian-Gang Zhuo; Guanquan Wang; Yuchuan Yang; Hongyuan Wei; Zhijun Zhou; Wei Liao
errShare
errSave
researcher View more