Abstract
In this paper we propose a set of parallel interfaces that extends the sparse BLAS presented in [8] to distributed memory parallel machines with message passing programming interfaces. Our main target is the implementation of iterative methods with domain-decomposition based preconditioners in an effective and structured way, while keeping the benefits of the serial sparse BLAS. The structure of our framework has also been influenced by the dense PBLAS proposal [5].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Mario Arioli, Iain Duff, and Daniel Ruiz. Stopping criteria for iterative solvers. SIAM J. Matrix Anal. Appl., 13:138–144, 1992.
Richard Barrett, Michael Berry, Tony Chan, James Demmel, June Donat, Jack Dongarra, Victor Eijkhout, Roldan Pozo, Charles Romine, and Henk van der Vorst. Templates for the solution of linear systems. SIAM, 1993.
F. Cerioni, M. Colajanni, S. Filippone, and S. Maiolatesi. A proposal for parallel sparse BLAS. Technical Report RI.96.05, University of Roma Tor Vergata, Department of Computer Science, Systems and Industrial Engineering, March 1996.
J. Choi, J. Demmel, J. Dhillon, J. Dongarra, S. Ostrouchov, A. Petitet, K. Stanley, D. Walker, and R. C. Whaley. ScaLAPACK: A portable linear algebra library for distributed memory computers. LAPACK Working Note #95, University of Tennessee, 1995.
J. Choi, S. Ostrouchov, A. Petitet, D. Walker, and R. Clint Whaley. A proposal for a set of parallel basic linear algebra subprograms. LAPACK Working Note #100, University of Tennessee, May 1995. http://www.netlib.org/lapack/lawns.
Jack Dongarra, Sven Hammarling, and Susan Ostrouchov. BLAS technical workshop. LAPACK Working Note #109, University of Tennessee, May 1995. http://www.netlib.org/lapack/lawns.
Jack J. Dongarra and R. Clint Whaley. A user's guide to the BLACS v1.0. LAPACK working note #94, University of Tennessee, June 1995. http://www.netlib.org/lapack/lawns.
Iain S. Duff, Michele Marrone, Giuseppe Radicati, and Carlo Vittoli. A set of level 3 basic linear algebra subprograms for sparse matrices. Technical Report RAL-TR-95-049, Computing and Information System Department, Atlas Centre, Rutherford Appleton Laboratory, Oxon OX11 0QX, September 1995. SPARKER Working Note # 1, Ftp address seamus.cc.rl.ac.uk/pub/reports.
Salvatore Filippone, Michele Marrone, and Giuseppe Radicati di Brozolo. Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures. Intern. J. Computer Math., 40:159–167, 1992.
Bruce Hendrickson and Robert Leland. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. Sci. Comput, 16(2):452–469, 1995.
George Karypis and Vipin Kumar. METIS: Unstructured Graph Partitioning and Sparse Matrix Ordering System. University of Minnesota, Department of Computer Science, Minneapolis, MN 55455, August 1995. Internet Address: http://www.cs.umn.edu/∼karypis.
C. T. Kelley. Iterative Methods for Linear and Nonlinear Equations. SIAM, 1995.
Alex Pothen, Horst D. Simon, and Kang-Pu Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11:430–452, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cerioni, F., Colajanni, M., Filippone, S., Maiolatesi, S. (1996). A proposal for parallel sparse BLAS. In: Waśniewski, J., Dongarra, J., Madsen, K., Olesen, D. (eds) Applied Parallel Computing Industrial Computation and Optimization. PARA 1996. Lecture Notes in Computer Science, vol 1184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62095-8_18
Download citation
DOI: https://doi.org/10.1007/3-540-62095-8_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62095-2
Online ISBN: 978-3-540-49643-4
eBook Packages: Springer Book Archive