A Sparse Linear System Solver Used in a Distributed and Heterogenous Grid Computing Environment

Many scientific applications need to solve very large sparse linear systems in order to simulate phenomena close to the reality. Grid computing is an answer to the growing demand of computational power. In a grid computing environment, communication times are significant and the bandwidth is variable, therefore frequent synchronizations slow down performances. Thus it is desirable to reduce the number of synchronizations in a parallel direct algorithm. Inspired from multisplitting techniques, the GREMLINS (GRid Efficient Methods for LINear Systems) solver we developed consists of solving several linear problems obtained by splitting. The principle of the balancing algorithm is presented, and experimental results are given.

[1]  Franck Cappello,et al.  Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed , 2006, Int. J. High Perform. Comput. Appl..

[2]  J. Blom,et al.  An implicit-explicit approach for atmospheric transport-chemistry problems , 1996 .

[3]  Christophe Denis,et al.  Numerical 'health check' for scientific codes: the CADNA approach , 2007, Comput. Phys. Commun..

[4]  Jacques M. Bahi,et al.  Evaluation of the asynchronous iterative algorithms in the context of distant heterogeneous clusters , 2005, Parallel Comput..

[5]  Patrick Amestoy,et al.  A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling , 2001, SIAM J. Matrix Anal. Appl..

[6]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[7]  James Demmel,et al.  SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems , 2003, TOMS.

[8]  J. C. Bruch.  Multisplitting and domain decomposition , 1993 .

[9]  D. O’Leary,et al.  Multi-Splittings of Matrices and Parallel Solution of Linear Systems , 1985 .

[10]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[11]  E. Cuthill,et al.  Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.

[12]  Jennifer A. Scott.  Parallel frontal solvers for large sparse linear systems , 2003, TOMS.

[13]  Jacques M. Bahi,et al.  A decentralized convergence detection algorithm for asynchronous parallel iterative algorithms , 2005, IEEE Transactions on Parallel and Distributed Systems.

[14]  Christophe Denis,et al.  A load balancing method for a parallel application based on a domain decomposition , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.