A Hierarchical Approach to Irregular Problems
Irregular problems require the computation of some properties for a set of elements irregularly distributed in a domain in a dynamic way. Most irregular problems satisfy a locality property because the properties of an element e depend upon the elements “close” to e. We propose a methodology to develop a highly parallel solution based on load balancing strategies that respects locality, i.e. e and most of the elements close to e are mapped onto the same processing node. We present the experimental results of the application of the methodology to the n-boby problem and to the adaptive multigrid method.
Unable to display preview. Download preview PDF.
- S. J. Aarset, M. Henon, and R. Wielen. Numerical methods for the study of star cluster dynamics. Astronomy and Astrophysics, 37(2), 1974.Google Scholar
- J.E. Barnes and P. Hut. A hierarchical O(nlogn) force calculation algorithm. Nature, 324, 1986.Google Scholar
- M. Berger and J. Oliger. Adaptive mesh refinement for hyperbolic partial differential equations. J. Comp. Physics, 53, 1984.Google Scholar
- W. Briggs. A multigrid tutorial SIAM, 1987.Google Scholar
- P. Hanrahan, D. Salzman, and L. Aupperle. A rapid hierarchical radiosity algorithm. Computer Graphics (SIGGRAPH’ 91 Proceedings), 25(4), 1991.Google Scholar
- J.R. Pilkington and S.B. Baden. Dynamic partitioning of non-uniform structured workloads with space filling curves. IEEE TOPDS, 7(3), 1996.Google Scholar
- J.K. Salmon. Parallel Hierarchical N-body Methods. PhD thesis, California Institute of Technology, 1990.Google Scholar
- J.P. Singh. Parallel Hierarchical N-body Methods and their Implications for Multiprocessors. PhD thesis, Stanford University, 1993.Google Scholar