A block based, automatic partitioning and scheduling methodology is presented for sparse matrix factorization on distributed memory systems. Using experimental results, this technique is analyzed for communication and load imbalance overhead. To study the performance effects, these overheads were compared with those obtained from a straightforward 'wrap mapped' column assignment scheme. All experimental results were obtained using test sparse matrices from the Harwell-Boeing data set. The results show that there is a communication and load balance tradeoff. The block based method results in lower communication cost whereas the wrap mapped scheme gives better load balance
To minimize the communication in parallel sparse matrix-vector multiplication while maintaining load...
We propose a comprehensive and generic framework to minimize multiple and different volume-based com...
Parallelizing sparse irregular application on distributed memory systems poses serious scalability c...
Compared to the customary column-oriented approaches, block-oriented, distributed-memory sparse Chol...
Problems in the class of unstructured sparse matrix computations are characterized by highly irregul...
Communication requirements of Cholesky factorization of dense and sparse symmetric, positive definit...
We show a two-phase approach for minimizing various communication-cost metrics in fine-grain partiti...
Cataloged from PDF version of article.Thesis (Ph.D.): Bilkent University, Department of Computer Eng...
This extended abstract presents a survey of combinatorial problems encountered in scientific computa...
Given a partitioning of a sparse matrix for parallel matrix–vector multiplication, which determines ...
The problem of Cholesky factorization of a sparse matrix has been very well investigated on sequenti...
Optimal load balancing in sparse matrix decomposition without disturbing the row/column ordering is ...
Given a partitioning of a sparse matrix for parallel matrix–vector multiplication, which determines ...
Sparse matrix partitioning is a common technique used for improving performance of parallel linear i...
This paper addresses the problem of one-dimensional partitioning of structurally unsymmetric square ...
To minimize the communication in parallel sparse matrix-vector multiplication while maintaining load...
We propose a comprehensive and generic framework to minimize multiple and different volume-based com...
Parallelizing sparse irregular application on distributed memory systems poses serious scalability c...
Compared to the customary column-oriented approaches, block-oriented, distributed-memory sparse Chol...
Problems in the class of unstructured sparse matrix computations are characterized by highly irregul...
Communication requirements of Cholesky factorization of dense and sparse symmetric, positive definit...
We show a two-phase approach for minimizing various communication-cost metrics in fine-grain partiti...
Cataloged from PDF version of article.Thesis (Ph.D.): Bilkent University, Department of Computer Eng...
This extended abstract presents a survey of combinatorial problems encountered in scientific computa...
Given a partitioning of a sparse matrix for parallel matrix–vector multiplication, which determines ...
The problem of Cholesky factorization of a sparse matrix has been very well investigated on sequenti...
Optimal load balancing in sparse matrix decomposition without disturbing the row/column ordering is ...
Given a partitioning of a sparse matrix for parallel matrix–vector multiplication, which determines ...
Sparse matrix partitioning is a common technique used for improving performance of parallel linear i...
This paper addresses the problem of one-dimensional partitioning of structurally unsymmetric square ...
To minimize the communication in parallel sparse matrix-vector multiplication while maintaining load...
We propose a comprehensive and generic framework to minimize multiple and different volume-based com...
Parallelizing sparse irregular application on distributed memory systems poses serious scalability c...