Skip to main content
Journal ArticleOPEN ACCESS

Dynamic load partitioning strategies for managing data of space and time heterogeneity in parallel SAMR applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2790 181-188
DOI: 10.1007/978-3-540-45209-6_27
5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents the design and experimental evaluation of two dynamic load partitioning and balancing strategies for parallel Structured Adaptive Mesh Refinement (SAMR) applications: the Level-based Partitioning Algorithm (LPA) and the Hierarchical Partitioning Algorithm (HPA). These techniques specifically address the computational and communication heterogeneity across refinement levels of the adaptive grid hierarchy underlying these methods. An experimental evaluation of the partitioning schemes is also presented. © Springer-Verlag 2003.

Author supplied keywords

Cite

CITATION STYLE

APA

Li, X., & Parashar, M. (2004). Dynamic load partitioning strategies for managing data of space and time heterogeneity in parallel SAMR applications. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 181–188. https://doi.org/10.1007/978-3-540-45209-6_27

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