Two-level dynamic scheduling in PARDISO: Improved scalability on shared memory multiprocessing systems
- 1 February 2002
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 28 (2), 187-197
- https://doi.org/10.1016/s0167-8191(01)00135-1
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic SchedulingSIAM Journal on Matrix Analysis and Applications, 2001
- Analysis, tuning and comparison of two general sparse solvers for distributed memory computersPublished by Office of Scientific and Technical Information (OSTI) ,2000
- Multifrontal parallel distributed symmetric and unsymmetric solversComputer Methods in Applied Mechanics and Engineering, 2000
- An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian EliminationSIAM Journal on Matrix Analysis and Applications, 1999
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse MatricesSIAM Journal on Matrix Analysis and Applications, 1999
- A Supernodal Approach to Sparse Partial PivotingSIAM Journal on Matrix Analysis and Applications, 1999
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU FactorizationSIAM Journal on Matrix Analysis and Applications, 1997
- Numerical Methods for Semiconductor Device SimulationSIAM Journal on Scientific and Statistical Computing, 1983
- Algorithm 575: Permutations for a Zero-Free Diagonal [F1]ACM Transactions on Mathematical Software, 1981
- Some stable methods for calculating inertia and solving symmetric linear systemsMathematics of Computation, 1977