Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves
IEEE Transactions on Parallel and Distributed Systems
Parallelization of Irregular Problems Based on Hierarchical Domain Representation
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Load Balancing and Locality in Hierarchical N-Body Algorithms on Distributed Memory Architectures
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
A Hierarchical Approach to Irregular Problems (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
On Partitioning Dynamic Adaptive Grid Hierarchies
HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
PIT: A Library for the Parallelization of Irregular Problems
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
| Hi-index | 0.01 |
Adaptive multigrid methods solve partial differential equations through a discrete representation of the domain that introduces more points in those zones where the equation behavior is highly irregular. The distribution of the points changes at run time in a way that cannot be foreseen in advance. We propose a methodology to develop a highly parallel solution based upon a load balancing strategy that respects the locality property of adaptive multigrid method, where the value of a point p depends on the points that are "close" to p according to a neighborhood stencil. We also describe the update of the mapping at run time to recover an unbalancing, together with strategies to acquire data mapped onto other processing nodes. A MPI implementation is presented together with some experimental results.