Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Multisplitting of a symmetric positive definite matrix
SIAM Journal on Matrix Analysis and Applications
An implicit-explicit approach for atmospheric transport-chemistry problems
Applied Numerical Mathematics
Asynchronous iterative algorithms with flexible communication for nonlinear network flow problems
Journal of Parallel and Distributed Computing
Recent advances in direct methods for solving unsymmetric sparse systems of linear equations
ACM Transactions on Mathematical Software (TOMS)
Partitioning an Array onto a Mesh of Processors
PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
A new scheduling algorithm for parallel sparse LU factorization with static pivoting
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
ACM Transactions on Mathematical Software (TOMS)
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
A Decentralized Convergence Detection Algorithm for Asynchronous Parallel Iterative Algorithms
IEEE Transactions on Parallel and Distributed Systems
A Load Balancing Method for a Parallel Application Based on a Domain Decomposition
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Parallelization of Direct Algorithms using Multisplitting Methods in Grid Environments
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14
Asynchronous iterations with flexible communication: contracting operators
Journal of Computational and Applied Mathematics
Static LU Decomposition on Heterogeneous Platforms
International Journal of High Performance Computing Applications
Performance Comparison of Parallel Programming Environments for Implementing AIAC Algorithms
The Journal of Supercomputing
Hybrid scheduling for the parallel solution of linear systems
Parallel Computing - Parallel matrix algorithms and applications (PMAA'04)
Choice of initial guess in iterative solution of series of systems arising in fluid flow simulations
Journal of Computational Physics
Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed
International Journal of High Performance Computing Applications
Super-Scalable algorithms for computing on 100,000 processors
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Fast iterative solution of large sparse linear systems on geographically separated clusters
International Journal of High Performance Computing Applications
The Journal of Supercomputing
A parallel solution of large-scale heat equation based on distributed memory hierarchy system
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
| Hi-index | 0.00 |
Traditional large sparse linear solvers are not suited in a grid computing environment as they require a large amount of synchronization and communication penalizing the performance on this architecture. This paper presents some features of the solver designed during the current GREMLINS (GRid Efficient Method for LINear Systems) project. The GREMLINS solver limits the amount of communication as it is based on a coarse grained iterative method called multisplitting method. Moreover, the solver can be executed either in a synchronous or an asynchronous mode. In the latter case, iterations are desynchronized and there is no more synchronization at all. It may result in a faster execution time compared to the synchronous case. Some experiments presented in this paper with the GRID'5000 architecture, a nation wide experimental grid in France, allowed us to highlight interesting features of this solver.