10 search results - page 1 / 2 » Minimizing communication in sparse matrix solvers |
SC
2009
ACM
13 years 11 months ago
2009
ACM
PARLE
1994
13 years 8 months ago
1994
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
ISCIS
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We show a two-phase approach for minimizing various communication-cost metrics in fine-grain partitioning of sparse matrices for parallel processing. In the first phase...
FCCM
2007
IEEE
13 years 6 months ago
2007
IEEE
Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver ...
HPCN
1997
Springer
13 years 8 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...