Parallel implementation of multifrontal schemes
Parallel Computing
Computer
Sparse Cholesky factorization on a local-memory multiprocessor
SIAM Journal on Scientific and Statistical Computing
A graph partitioning algorithm by node separators
ACM Transactions on Mathematical Software (TOMS)
A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
The role of elimination trees in sparse factorization
SIAM Journal on Matrix Analysis and Applications
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Geometry based mapping strategies for PDE computations
ICS '91 Proceedings of the 5th international conference on Supercomputing
Highly parallel sparse Cholesky factorization
SIAM Journal on Scientific and Statistical Computing
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Performance Analysis of Parallelizing Compilers on the Perfect Benchmarks Programs
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
An integrated approach for the parallel solution of large sparse systems arisen in finite element computations is presented. The approach includes a three-phase preprocessor and a macro dataflow execution scheme. The three phases of the preprocessor are: (1) Extracting parallelism by means of an automatic domain decomposer; (2) Building the distributed data structure and (partial) scheduling for parallel computation during symbolic factorization; (3) Assigning processes (tasks) onto processors. The proposed approach has been implemented in the finite element analysis software package DIANA. Experimental results show that this integrated approach is an efficient method for both shared-and distributed-memory parallel systems.