Abstract
This paper presents an experimental evaluation of a suite of dynamic partitioning/load-balancing techniques for adaptive grid hierarchies that underlie parallel structured adaptive mesh refinement applications. Partitioners evaluated include those included in popular software libraries such as GrACE, Vampire, and ParMetis. The overall goal of the research presented in the paper is an application-centric characterization of the partitioners as a function of the number of processors, problem size, and partitioning granularity.
Research supported by NSF via grants WU-HT-99-19 P029786F (KDI) and ACI 9984357 (CAREERS) awarded to Manish Parashar. The authors thank Johan Steensland and Ravi Samtaney for providing access to Vampire and RM3D.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Karypis, G., Schloegel, K., Kumar, V.: ParMetis-Parallel Graph Partitioning and Sparse Matrix Ordering Library, ver. 2.0. University of Minnesota, 1998.
Parashar, M., et al: A Common Data Management Infrastructure for Adaptive Algorithms for PDE Solutions. Technical Paper at Supercomputing, 1997.
Steensland, J.: http://www.caip.rutgers.edu/~johans/vampire. Vampire, 2000.
Steensland, J., Chandra, S., Thuné, M., Parashar, M.: Characterization of Domain-Based Partitioners for Parallel SAMR Applications. IASTED International Conference on Parallel and Distributed Computing and Systems, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chandra, S., Parashar, M. (2001). An Evaluation of Partitioners for Parallel SAMR Applications. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_26
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive