Paper Info
Title
Modelling an Asynchronous Parallel Modified Cholesky Factorization for Sparse Matrices
Abstract
This paper presents a parallel algorithm for the modifiedCholesky factorization of sparse matrices on adistributed memory system. The parallel strategy isbased on an asynchronous scheme. This is to obtainthe maximum performance by taking advantage of thesparse nature of the matrices. The matrix entries havea BCS distribution. We carried out an analysis of thecommunication overhead and the computational loadbalance in order to model the efficiency of the algorithmand predict the...
Year
Venue
Keywords
1997
Euro-PDS
sparse matrices,parallel algorithm,cholesky factorization
Field
DocType
Citations 
Asynchronous communication,Incomplete Cholesky factorization,Computer science,Minimum degree algorithm,Parallel computing,Incomplete LU factorization,Sparse matrix,Cholesky decomposition
Conference
0
PageRank 
References 
Authors
0.34
2
2
Name
Order
Citations
PageRank
María J. Martín117427.68
Francisco F. Rivera217726.17