A heuristic re-mapping algorithm reducing inter-level communication in SAMR applications.

This paper aims at decreasing execution time for large-scale structured adaptive mesh refinement (SAMR) applications by proposing a new heuristic re-mapping algorithm and experimentally showing its effectiveness in reducing inter-level communication. Tests were done for five different SAMR applications. The overall goal is to engineer a dynamically adaptive meta-partitioner capable of selecting and configuring the most appropriate partitioning strategy at run-time based on current system and application state. Such a metapartitioner can significantly reduce execution times for general SAMR applications. Computer simulations of physical phenomena are becoming increasingly popular as they constitute an important complement to real-life testing. In many cases, such simulations are based on solving partial differential equations by numerical methods. Adaptive methods are crucial to efficiently utilize computer resources such as memory and CPU. But even with adaption, the simulations are computationally demanding and yield huge data sets. Thus parallelization and the efficient partitioning of data become issues of utmost importance. Adaption causes the workload to change dynamically, calling for dynamic (re-) partitioning to maintain efficient resource utilization. The proposed heuristic algorithm reduced inter-level communication substantially. Since the complexity of the proposed algorithm is low, this decrease comes at a relatively low cost. As a consequence, we more » draw the conclusion that the proposed re-mapping algorithm would be useful to lower overall execution times for many large SAMR applications. Due to its usefulness and its parameterization, the proposed algorithm would constitute a natural and important component of the meta-partitioner. « less

[1]  Erlendur Steinthorsson,et al.  Advanced methodology for simulation of complex flows using structured grid systems , 1995 .

[2]  Martin Berzins,et al.  A comparison of some dynamic load-balancing algorithms for a parallel adaptive flow solver , 2000, Parallel Comput..

[3]  James C. Browne,et al.  Systems Engineering for High Performance Computing Software: The HDDA/DAGH Infrastructure for Implementation of Parallel Structured Adaptive Mesh , 2000 .

[4]  Scott B. Baden,et al.  Flexible Communication Mechanisms for Dynamic Structured Applications , 1996, IRREGULAR.

[5]  Kamy Sepehrnoori,et al.  A New Generation EOS Compositional Reservoir Simulator: Part I - Formulation and Discretization , 1997 .

[6]  Manish Parashar,et al.  An Application-Centric Characterization of Domain-Based SFC Partitioners for Parallel SAMR , 2002, IEEE Trans. Parallel Distributed Syst..

[7]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[8]  Vipin Kumar,et al.  A Unified Algorithm for Load-balancing Adaptive Scientific Simulations , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[9]  G. Bryan,et al.  Cosmological Adaptive Mesh Refinement , 1998, astro-ph/9807121.

[10]  Jarmo Rantakokko Data Partitioning Methods and Parallel Block-Oriented PDE Solvers , 1998 .

[11]  Greg L. Bryan,et al.  Fluids in the universe: adaptive mesh refinement in cosmology , 1999, Comput. Sci. Eng..

[12]  P. Colella,et al.  Local adaptive mesh refinement for shock hydrodynamics , 1989 .

[13]  G. Bryan,et al.  Dynamic load balancing of SAMR applications on distributed systems , 2002 .

[14]  James C. Browne,et al.  On partitioning dynamic adaptive grid hierarchies , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.

[15]  Matthew W. Choptuik Experiences with an adaptive mesh refinement algorithm in numerical relativity. , 1989 .

[16]  Martin G. Everett,et al.  Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes , 1997, J. Parallel Distributed Comput..

[17]  Johan Steensland Efficient Partitioning of Dynamic Structured Grid Hierarchies , 2002 .

[18]  Chris Walshaw,et al.  Multilevel mesh partitioning for heterogeneous communication networks , 2001, Future Gener. Comput. Syst..

[19]  Scott H. Hawley,et al.  Boson stars driven to the brink of black hole formation , 2000 .

[20]  M. Berger,et al.  Adaptive mesh refinement for hyperbolic partial differential equations , 1982 .

[21]  Zhiling Lan,et al.  Dynamic load balancing for structured adaptive mesh refinement applications , 2001, International Conference on Parallel Processing, 2001..

[22]  Julian Cummings,et al.  An Experimental Study of Adaptive Application-Sensitive Partitioning Strategies for SAMR Applications , 2001 .

[23]  Johan Steensland Domain-based partitioning for parallel SAMR applications , 2001 .

[24]  Michael Thuné,et al.  Partitioning Strategies for Composite Grids , 1997, Parallel Algorithms Appl..

[25]  Manish Parashar,et al.  An Evaluation of Partitioners for Parallel SAMR Applications , 2001, Euro-Par.

[26]  Peng Wang,et al.  A New Generation EOS Compositional Reservoir Simulator: Part II - Framework and Multiprocessing , 1997 .

[27]  Phillip Colella,et al.  Adaptive Cartesian grid methods for representing geometry in inviscid compressible flow , 1993 .

[28]  Courtenay T. Vaughan,et al.  Design of dynamic load-balancing tools for parallel applications , 2000, ICS '00.