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.
Original language | English (US) |
---|---|
Title of host publication | Applied Parallel Computing |
Subtitle of host publication | Large Scale Scientific and Industrial Problems - 4th International Workshop, PARA 1998, Proceedings |
Editors | Bo Kagstrom, Erik Elmroth, Jack Dongarra, Jerzy Wasniewski |
Publisher | Springer Verlag |
Pages | 182-194 |
Number of pages | 13 |
ISBN (Print) | 3540654143, 9783540654148 |
DOIs | |
State | Published - 1998 |
Event | 4th International Workshop on Applied Parallel Computing, PARA 1998 - Umea, Sweden Duration: Jun 14 1998 → Jun 17 1998 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 1541 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Other
Other | 4th International Workshop on Applied Parallel Computing, PARA 1998 |
---|---|
Country/Territory | Sweden |
City | Umea |
Period | 6/14/98 → 6/17/98 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1998.