WSSMP: A high-performance serial and parallel symmetric sparse linear solver. 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.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- González, Francisco; Luaces, Alberto; Lugrís, Urbano; González, Manuel: Non-intrusive parallelization of multibody system dynamic simulations (2009)
- González, Manuel; González, Francisco; Dopico, Daniel; Luaces, Alberto: On the effect of linear algebra implementations in real-time multibody system dynamics (2008)
- Duff, Iain S.: The impact of high-performance computing in the solution of linear systems: Trends and problems (2000)
- Czyzyk, Joseph; Mehrotra, Sanjay; Wagner, Michael; Wright, Stephen J.: PCx: An interior-point code for linear programming (1999)