No abstract available.
Cited By
- Smelyanskiy M, Lee V, Kim D, Nguyen A and Dubey P Scaling performance of interior-point method on large-scale chip multiprocessor system Proceedings of the 2007 ACM/IEEE conference on Supercomputing, (1-11)
- Buttari A, Eijkhout V, Langou J and Filippone S (2007). Performance Optimization and Modeling of Blocked Sparse Kernels, International Journal of High Performance Computing Applications, 21:4, (467-484), Online publication date: 1-Nov-2007.
- Shen K Parallel sparse LU factorization on second-class message passing platforms Proceedings of the 19th annual international conference on Supercomputing, (351-360)
- Hénon P, Ramet P and Roman J On using an hybrid MPI-Thread programming for the implementation of a parallel sparse direct solver on a network of SMP nodes Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics, (1050-1057)
- Dongarra J, Foster I, Fox G, Gropp W, Kennedy K, Torczon L and White A References Sourcebook of parallel computing, (729-789)
- Hénon P, Ramet P and Roman J (2002). PASTIX, Parallel Computing, 28:2, (301-321), Online publication date: 1-Feb-2002.
- Shen K, Jiao X and Yang T Elimination forest guided 2D sparse LU factorization Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, (5-15)
- Yang T and Fu C (1998). Space/time-efficient scheduling and execution of parallel irregular computations, ACM Transactions on Programming Languages and Systems (TOPLAS), 20:6, (1195-1222), Online publication date: 1-Nov-1998.
- Fu C and Yang T Space and time efficient execution of parallel irregular computations Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming, (57-68)
- Fu C and Yang T (1997). Space and time efficient execution of parallel irregular computations, ACM SIGPLAN Notices, 32:7, (57-68), Online publication date: 1-Jul-1997.
Recommendations
Performance modeling and analysis of parallel Gaussian elimination on multi-core computers
Gaussian elimination is used in many applications and in particular in the solution of systems of linear equations. This paper presents mathematical performance models and analysis of four parallel Gaussian Elimination methods (precisely the Original ...
Multiple Gaussian graphical estimation with jointly sparse penalty
In this paper, we consider estimating multiple Gaussian graphs with a similar sparsity structure. Most related solving methods, such as GGL (Group graphical lasso) and FMGL (Fused multiple graphical lasso), focus on the information of the edge values, ...
High performance sparse multifrontal solvers on modern GPUs
AbstractWe have ported the numerical factorization and triangular solve phases of the sparse direct solver STRUMPACK to GPU. STRUMPACK implements sparse LU factorization using the multifrontal algorithm, which performs most of its operations ...
Highlights- Ported the numerical factorization and triangular solve phases of the sparse direct multifrontal solver STRUMPACK to GPU.