Abstract | ||
---|---|---|
We present a dynamic distributed load balancing algorithm for parallel, adaptive finite element simulations using preconditioned conjugate gradient solvers based on domain-decomposition. The load balancer is designed to maintain good partition aspect ratios. It can calculate a balancing flow using different versions of diffusion and a variant of breadth first search. Elements to be migrated are chosen according to a cost function aiming at the optimization of subdomain shapes. We show how to use information from the second step to guide the first. Experimental results using Bramble's preconditioner and comparisons to existing state-ot-the-art load balancers show the benefits of the construction. |
Year | DOI | Venue |
---|---|---|
1998 | 10.1007/BFb0018537 | IRREGULAR |
Keywords | Field | DocType |
quality balancing,parallel adaptive fem,cost function,load balance,breadth first search,aspect ratio,domain decomposition | Conjugate gradient method,Preconditioner,Load balancing (computing),Computer science,Breadth-first search,Parallel computing,Algorithm,Finite element method,Distributed algorithm,Adaptive algorithm,Domain decomposition methods,Distributed computing | Conference |
ISBN | Citations | PageRank |
3-540-64809-7 | 10 | 1.16 |
References | Authors | |
15 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ralf Diekmann | 1 | 281 | 28.99 |
Frank Schlimbach | 2 | 88 | 6.13 |
Chris Walshaw | 3 | 289 | 31.25 |