GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
Performance of dynamic load balancing algorithms for unstructured mesh calculations
Concurrency: Practice and Experience
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Journal of Computational Physics
Distributed operating systems
Entropy controlled adaptive finite element simulations for compressible gas flow
Journal of Computational Physics
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Parallel and distributed implementation of large industrial applications
Future Generation Computer Systems - Special issue on distributed and parallel systems
Exploiting Fine-Grained Idle Periods in Networks of Workstations
IEEE Transactions on Parallel and Distributed Systems
A test suite for high-performance parallel Java
Advances in Engineering Software - Special issue on large-scale analysis, design and intelligent synthesis environments
Graph partitioning models for parallel computing
Parallel Computing - Special issue on graph partioning and parallel computing
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Scalable Parallel Implementations of the GMRES Algorithm via Householder Reflections
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Communication Cost Reduction for Krylov Methods on Parallel Computers
HPCN Europe 1994 Proceedings of the nternational Conference and Exhibition on High-Performance Computing and Networking Volume II: Networking and Tools
Finite Element Message-Passing/DSM Simulation Algorithm for Parallel Computers
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Some Investigations of Domain Decomposition Techniques in Parallel CFD
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Parallel Domain Decomposition and Load Balancing Using Space-Filling Curves
HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
Graph partitioning for high-performance scientific simulations
Sourcebook of parallel computing
Agent architecture for mesh based simulation systems
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Hi-index | 0.00 |
In this paper we compare different parallel implementations of the same algorithm for solving nonlinear simulation problems on unstructured meshes. In the first implementation, making use of the message-passing programming model and the PVM system, the domain decomposition of unstructured mesh is implemented, while the second implementation takes advantage of the inherent parallelism of the algorithm by adopting the shared-memory programming model. Both implementations are applied to the preconditioned GMRES method that solves iteratively the system of linear equations. A combined approach, the hybrid programming model suitable for multicomputers with SMP nodes, is introduced. For performance measurements we use compressible fluid flow simulation in which sequences of finite element solutions form time approximations to the Euler equations. The tests are performed on HP SPP1600, HP S2000 and SGI Origin2000 multiprocessors and report wall-clock execution time and speedup for different number of processing nodes and for different meshes. Experimentally, the explicit programming model proves to be more efficient than the implicit model by 20--70%, depends on the mesh and the machine.