A new procedure for dynamic adaption of three-dimensional unstructured grids
Applied Numerical Mathematics
Fast and parallel mapping algorithms for irregular problems
The Journal of Supercomputing
Parallel dynamic graph partitioning for adaptive unstructured meshes
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Multilevel diffusion schemes for repartitioning of adaptive meshes
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Parallel structures and dynamic load balancing for adaptive finite element computation
Proceedings of international centre for mathematical sciences on Grid adaptation in computational PDES : theory and applications: theory and applications
PLUM: parallel load balancing for adaptive unstructured meshes
Journal of Parallel and Distributed Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Design of dynamic load-balancing tools for parallel applications
Proceedings of the 14th international conference on Supercomputing
Parallel incremental graph partitioning using linear programming
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
DRAMA: A Library for Parallel Dynamic Load Balancing of Finite Element Applications
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Repartitioning Unstructured Adaptive Meshes
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Distributed dynamic hash tables using IBM LAPI
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Sourcebook of parallel computing
A Parallel Multilevel Metaheuristic for Graph Partitioning
Journal of Heuristics
ATOP-space and time adaptation for parallel and grid applications via flexible data partitioning
ARM '04 Proceedings of the 3rd workshop on Adaptive and reflective middleware
Performance Evaluation of Task Pools Based on Hardware Synchronization
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Towards autonomic application-sensitive partitioning for SAMR applications
Journal of Parallel and Distributed Computing
Dynamic data migration for structured AMR solvers
International Journal of Parallel Programming
A repartitioning hypergraph model for dynamic load balancing
Journal of Parallel and Distributed Computing
Graph partitioning and disturbed diffusion
Parallel Computing
Reducing data migration in the context of adaptive partitioning for AMR
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Parallel adaptation of general three-dimensional hybrid meshes
Journal of Computational Physics
Geographical locality and dynamic data migration for OpenMP implementations of adaptive PDE solvers
IWOMP'05/IWOMP'06 Proceedings of the 2005 and 2006 international conference on OpenMP shared memory parallel programming
Factorization-Based graph repartitionings
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
Quantifying the effectiveness of load balance algorithms
Proceedings of the 26th ACM international conference on Supercomputing
Load-balancing spatially located computations using rectangular partitions
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Adaptive scientific simulations require that periodic repartitioning occur dynamically throughout the course of the computation. The repartitionings should be computed so as to minimize both the inter-processor communications incurred during the iterative mesh-based computation and the data redistribution costs required to balance the load. Recently developed schemes for computing repartitionings provide the user with only a limited control of the tradeoffs among these objectives. This paper describes a new Unified Repartitioning Algorithm that can tradeoff one objective for the other dependent upon a user-defined parameter describing the relative costs of these objectives. We show that the Unified Repartitioning Algorithm is able to reduce the precise overheads associated with repartitioning as well as or better than other repartitioning schemes for a variety of problems, regardless of the relative costs of performing inter-processor communication and data redistribution. Our experimental results show that this scheme is extremely fast and scalable to large problems.