Abstract
The Watson Symmetric Sparse Matrix Package, WSSMP, is a high-performance, robust, and easy to use software package for solving large sparse symmetric systems of linear equations. It can can be used as a serial package, or in a shared-memory multiprocessor environment, or as a scalable parallel solver in a message-passing environment, where each node can either be a uniprocessor or a shared-memory multiprocessor. WSSMP uses scalable parallel multifrontal algorithms for sparse symmetric factorization and triangular solves. Sparse symmetric factorization in WSSMP has been clocked at up to 210 MFLOPS on an RS6000/590, 500 MFLOPS on an RS6000/397 and in excess of 20 GFLOPS on a 64-node SP with RS6000/397 nodes. This paper gives an overview of the algorithms, implementation aspects, performance results, and the user interface of WSSMP.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. Ashcraft and J. W.-H. Liu. Robust ordering of sparse matrices using multisection. Technical Report CS 96-01, Department of Computer Sciences, York University, Ontario, Canada, 1996.
E. Chu et al. Users guide for SPARSPAK-A: Waterloo sparse linear equations package. Technical Report CS-84-36, University of Waterloo, Waterloo, IA, 1984.
A. Gupta, Fast and effective algorithms for graph partitioning and sparse matrix ordering. IBM Journal of Research and Development, 41 (1/2):171–183, 1997.
A. Gupta, M. Joshi, and V. Kumar. WSSMP: Watson symmetric sparse matrix package: The user interface. RC 20923 (92669), IBM T. J. Watson Research Center, Yorktown Heights, NY, July 17, 1997.
A. Gupta, G. Karypis, and V. Kumar. Highly scalable parallel algorithms for sparse matrix factorization. IEEE Transactions on Parallel and Distributed Systems, 8(5):502–520, May 1997.
B. Hendrickson and E. Rothberg. Improving the runtime and quality of nested dissection ordering. SAND96-0868J, Sandia National Laboratories, Albuquerque, NM, 1996.
M. Joshi, A. Gupta, G. Karypis, and V. Kumar. Two dimensional scalable parallel algorithms for solution of triangular systems. TR 97-024, Department of Computer Science, Univeristy of Minnesota, Minneapolis, MN, July 1997.
G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. TR 95-035, Department of Computer Science, University of Minnesota, 1995.
G. Karypis and V. Kumar. Parmetis: Parallel graph partitioning and sparse matrix ordering library. Tr 97-060, Department of Computer Science, University of Minnesota, 1997.
J. W.-H. Liu. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Review, 34:82–109, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, A., Joshi, M., Kumar, V. (1998). WSSMP: A high-performance serial and parallel symmetric sparse linear solver. In: Kågström, B., Dongarra, J., Elmroth, E., Waśniewski, J. (eds) Applied Parallel Computing Large Scale Scientific and Industrial Problems. PARA 1998. Lecture Notes in Computer Science, vol 1541. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095336
Download citation
DOI: https://doi.org/10.1007/BFb0095336
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65414-8
Online ISBN: 978-3-540-49261-0
eBook Packages: Springer Book Archive