Parallelization of Direct Algorithms using Multisplitting Methods in Grid Environments

The goal of this paper is to introduce a new approach to the building of efficient distributed linear system solvers. The starting point of the results of this paper lies in the fact that the parallelization of direct algorithms requires frequent synchronizations in order to obtain the solution for a linear problem. 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 method we present consists in solving several linear problems obtained by splitting the original one. Each linear system is solved independently on a cluster by using the direct method. This paper uses the theoretical results of [6] in order to build coarse grained algorithms designed for solving linear systems in the grid computing context.

• Type: Conference
• Year: 2005
• Where: IPPS
• Authors: Jacques M. Bahi, Raphaël Couturier
• Keywords: Distributed And Parallel Computing, Frequent Synchronizations, IPPS 2005, Linear, Linear Problems