Paper Info
Title
Data distribution strategies for domain decomposition applications in grid environments
Abstract
In this paper, we evaluate message-passing applications in Grid environments using domain decomposition technique. We compare two domain decomposition strategies: a balanced and unbalanced one. The balanced strategy is commonly strategy used in homogenous computing environment. This strategy presents some problems related with the larger communication latency in Grid environments. We propose an unbalanced domain decomposition strategy in order to overlap communication latency with useful computation. This idea consists in assigning less workload to processors responsible for sending updates outside the host. We compare the results obtained with the classical balanced strategy. We show that the unbalanced distribution pattern improves the execution times of domain decomposition applications in Grid environments. We considered two kinds of meshes, which define the most typical cases. We show that the expected execution time can be reduced up to 53%. We also analyze the influence of the communication patterns on execution times using the Dimemas simulator.
Year
DOI
Venue
2005
10.1007/11564621_24
ICA3PP
Keywords
Field
DocType
data distribution strategy,domain decomposition application,domain decomposition strategy,execution time,unbalanced domain decomposition strategy,domain decomposition technique,balanced strategy,classical balanced strategy,communication pattern,grid environment,communication latency,message passing,domain decomposition
Polygon mesh,Workload,Computer science,Latency (engineering),Parallel computing,Message Passing Interface,Grid,Message passing,Domain decomposition methods,Computation,Distributed computing
Conference
Volume
ISSN
ISBN
3719
0302-9743
3-540-29235-7
Citations 
PageRank 
References 
0
0.34
6
Authors
4
Name
Order
Citations
PageRank
Beatriz Otero154.72
José M. Cela27312.56
Rosa M. Badia32234160.45
Jesús Labarta41862165.09