ACM Home Page
Please provide us with feedback. Feedback
PSBLAS: a library for parallel linear algebra computation on sparse matrices
Full text PdfPdf (140 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 26 ,  Issue 4  (December 2000) table of contents
Pages: 527 - 550  
Year of Publication: 2000
ISSN:0098-3500
Authors
Salvatore Filippone  Univ. di Roma Tor Vergata, Rome, Italy
Michele Colajanni  Univ. di Modena e Reggio Emilia, Modena, Italy
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 45,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/365723.365732
What is a DOI?

ABSTRACT

Many computationally intensive problems in engineering and science give rise to the solution of large, sparse, linear systems of equations. Fast and efficient methods for their soltion are very important because these systems usually occur in the innermost loop of the computational scheme. Parallelization is often necessary to achieve an acceptable level of performance. This paper presents the design, implementation, and interface of a library of Basic Linear Algebra Subroutines for sparse matrices (PSBLAS) which is specifically tailored to distributed-memory computers. PSBLAS enables easy, efficient, and portable implementations of parallel iterative solvers for linear systems. The interface keeps in view a Single Program Multiple Data programming model on distributed-memory machines. However, the architecture of the library does not exclude an implementation in different paradigms, such as those based on the shared-memory model.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
BALAY, S., GROPP, W., MCINNES,L.C.,AND SMITH, B. 1995. PETSc 2.0 user manual. ANL-95/11 - Revision 2.0.22. Argonne National Laboratory, Argonne, IL.
 
3
BARRETT, R., BERRY, M., CHAN, T., DEMMEL, J., DONAT, J., DONGARRA, J., EIJKHOUT, V., POZO, R., ROMINE, C., AND VORST,H.V. D. 1994. Templates for the Solution of Linear Systems. SIAM, Philadelphia, PA.
4
 
5
CARNEY, S., HEROUX,M.A.,LI, G., AND WU, K. 1994. A revised proposal for a sparse BLAS toolkit. Tech. Rep. 94-034. Army High Performance Computing Research Center, Minneapolis, MN.
 
6
CERIONI, F., COLAJANNI, M., FILIPPONE, S., AND MAIOLATESI, S. 1996. PSBLAS user's guide. RI.96.11 (April). Univ. of Rome-Tor Vergata, Rome, Italy.
 
7
 
8
9
10
11
 
12
 
13
FILIPPONE, S., MARRONE, M., AND RADICATI DI BROZOLO, G. 1992. Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures. Inter. J. Comput. Math. 40, 159-167.
 
14
 
15
 
16
 
17
HUTCHINSON, S., PREVOST, L., SHADID, J., TONG, C., AND TUMINARO, R. 1998. Aztec user's guide: Version 2.0. Sandia National Laboratories, Livermore, CA.
 
18
KARYPIS,G.AND KUMAR, V. 1995. METIS: Unstructured graph partitioning and sparse matrix ordering system. Computer Science Department, Univ. of Minnesota, Minneapolis, MN. http://www.cs.umn.edu/ karypis
 
19
KELLEY, C. T. 1995. Iterative Methods for Linear and Nonlinear Equations. SIAM Frontiers in Applied Mathematics Series. SIAM, Philadelphia, PA.
20
21
 
22
 
23



REVIEW

"Maurice W. Benson : Reviewer"

A Fortran 77 Parallel Sparse Basic Linear Algebra Subroutine (PSBLAS) library for sparse matrix operations on distributed-memory computers is presented along with a Fortran 90 object oriented user interface to this library. The focus is on ope  more...

Collaborative Colleagues:
Salvatore Filippone: colleagues
Michele Colajanni: colleagues