A new domain decomposition approach suited for grid computing

Authors:
Juan A. Acebrón;Raúl Durán;Rafael Rico;Renato Spigler
Affiliations:
Departament d'Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Tarragona, Spain;Departamento de Automática, Escuela Politécnica, Universidad de Alcalá de Henares, Madrid, Spain;Departamento de Automática, Escuela Politécnica, Universidad de Alcalá de Henares, Madrid, Spain;Dipartimento di Matematica, Università "Roma Tre", Rome, Italy
Venue:
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Year:
2006

Citing 10
Cited 0

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Numerical Linear Algebra for High Performance Computers

Numerical Linear Algebra for High Performance Computers
Cross-Site Computations on the TeraGrid

Computing in Science and Engineering
Domain Decomposition Solution of Elliptic Boundary-Value Problems via Monte Carlo and Quasi-Monte Carlo Methods

SIAM Journal on Scientific Computing
Probabilistically induced domain decomposition methods for elliptic boundary-value problems

Journal of Computational Physics
Design and Performance of a Heterogeneous Grid Partitioner

Algorithmica
Supercomputing applications to the numerical modeling of industrial and applied mathematics problems

The Journal of Supercomputing
A survey of load balancing in grid computing

CIS'04 Proceedings of the First international conference on Computational and Information Science
Globus toolkit version 4: software for service-oriented systems

NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Performance analysis of domain decomposition applications using unbalanced strategies in grid environments

GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe a new kind of domain decomposition strategy for solving linear elliptic boundary-value problems. It outperforms the traditional ones in complex and heterogeneous networks like those for grid computing. Such a strategy consists of a hybrid numerical scheme based on a probabilistic method along with a domain decomposition, and full decoupling can be accomplished. While the deterministic approach is strongly affected by intercommunication among the hosts, the probabilistic method is scalable as the number of subdomains, i.e., the number of processors involved, increases. This fact is clearly illustrated by an example, even operating in a grid environment.