Sciweavers

112 search results - page 1 / 23
» High performance LU factorization for non-dedicated clusters
Sort
View
ANSS
2002
IEEE
15 years 2 months ago
Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations
Clusters of workstations have emerged as a costeffective solution to high performance computing problem. To take advantage of any opportunities, however, effective scheduling tech...
Helen D. Karatza
CCGRID
2004
IEEE
15 years 1 months ago
High performance LU factorization for non-dedicated clusters
This paper describes an implementation of parallel LU factorization. The focus is to achieve high performance on non-dedicated clusters, where the number of available computing re...
Toshio Endo, Kenji Kaneda, Kenjiro Taura, Akinori ...
ICS
2005
Tsinghua U.
15 years 3 months ago
Parallel sparse LU factorization on second-class message passing platforms
Several message passing-based parallel solvers have been developed for general (non-symmetric) sparse LU factorization with partial pivoting. Due to the fine-grain synchronizatio...
Kai Shen
TOMS
2008
80views more  TOMS 2008»
14 years 9 months ago
Updating an LU Factorization with Pivoting
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...
Enrique S. Quintana-Ortí, Robert A. van de ...
TOMS
2011
84views more  TOMS 2011»
14 years 4 months ago
A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting
We present a new supernode-based incomplete LU factorization method to construct a preconditioner for solving sparse linear systems with iterative methods. The new algorithm is pr...
Xiaoye S. Li, Meiyue Shao