An efficient sparse LU factorization algorithm on popular shared memory multiprocessors is presented. Interprocess communication is critically important on these architectures- the algorithm introduces O(n) synchronization events only. No global barrier is
Scalable Parallel Sparse Factorization with Left-Right Looking Strategy on Shared Memory Multiprocessors Olaf Schenk? 1, Klaus Gartner2, and Wolfgang Fichtner1 1
Integrated Systems Laboratory, Swiss Federal Institute of Technology Zurich, ETH Zurich, 8092 Zurich, Switzerland
foschenk, fwg@iis.ee.ethz.ch doc.guandang.net gaertner@wias-berlin.de
2
Weierstrass Institute for Applied Analysis and Stochastics, Mohrenstr. 39, 10117 Berlin, Germany
Abstract. An e cient sparse LU factorization algorithm on popular
shared memory multiprocessors is presented. Interprocess communication is critically important on these architectures - the algorithm introduces O(n) synchronization events only. No global barrier is used and a completely asynchronous scheduling scheme is one central point of the implementation. The algorithm aims at optimizing the single node performance and minimizing the communication overhead. It has been successfully tested on SUN Enterprise, DEC AlphaServer, SGI Origin 2000, Cray T90, J90, and NEC SX-4 parallel computers, delivering up to 2.3 GFlop/s on an eight processor DEC AlphaServer for medium-size semiconductor device simulations and structural engineering problems.
1 Introduction: Semiconductor Device Simulation and Algorithms Numerical semiconductor device and process simulation is based on the solution of a coupled system of non-linear partial di erential equations (PDE's) that can be either stationary, time dep
endent, or even complex depending on the problem considered. The nonlinear nature of the semiconductor transport equations, with exponential relations between variables, leads to discretized equations and the sparse linear systems are typically ill-conditioned. These systems are solved by iterative methods or direct methods. Since robust transient 2-D and 3-D simulations necessitate large computing resources, the choice of architectures, algorithms and their implementations becomes of utmost importance. Sparse direct methods are the most robust methods ?
The work of O. Schenk was supported by a grant from the Cray Research and Development Grant Program and the Swiss Commission of Technology and Innovation under contract number 3975.1.
Highly scalable parallel... 暂无评价 27页 免费 Highly scalable parallel..... Sparse LU factorization with partial pivoting, Message passing performance, ...
S+ Efficient 2D sparse LU factorization on parallel machines Abstract. Static symbolic factorization coupled with supernode partitioning and asynchronous ...
Cholesky Factorization and Sparse Approxi_专业资料。... but its scalable parallel implementation poses ...We start with a good ?ll-reducing strategy such...
parallel sparse LU factorization with partial pivoting on distributed memory ...In the literature 2-D mapping has been shown more scalable than 1-D for...
Highly scalable parallel... 暂无评价 27页 免费 Highly scalable parallel..... Comparing Nested Dissection Orderings for Parallel Sparse Matrix Factorization ...
Highly scalable parallel algorithms for sparse matrix factorization In this paper, we describe a scalable parallel algorithm for sparse matrix factorization, ...
PSPASES An efficient and scalable parallel sparse direct solver Many problems... with the highest performance (51 GFLOPS for Cholesky factorization) ever ...
PSPASES A scalable parallel direct solver for sparse symmetric positive ... symbolic factorization, Cholesky factorization, and triangular systems solution....
PSPASES Scalable Parallel Direct Solver Library for Sparse Symmetric Positive ... symbolic factorization, Cholesky factorization, and triangular systems solution....
On Sparse Matrix Reorder... 暂无评价 8页 免费 Highly scalable parallel.....Keywords: basis pursuit, dictionary learning, matrix factorization, online ...
热门文档