Skip to main content
Conference ProceedingsOPEN ACCESS

An evaluation of partitioners for parallel SAMR applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2150 171-174
DOI: 10.1007/3-540-44681-8_26
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Chandra, S., & Parashar, M. (2001). An evaluation of partitioners for parallel SAMR applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2150, pp. 171–174). Springer Verlag. https://doi.org/10.1007/3-540-44681-8_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free