On partitioning dynamic adaptive grid hierarchies

Parashar, Manish; Browne, James C.

doi:10.1109/hicss.1996.495511

Cited by 81 publications

(54 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hybrid partitioners [24,38,20] combining patchbased and domain-based approaches, can be used for coping with the shortcomings present in these techniques. They use a 2-step partitioning approach.…”

Section: Partitioning Samr Grid Hierarchiesmentioning

confidence: 99%

See 1 more Smart Citation

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

Steensland¹,

Ray²

2003

View full text Add to dashboard Cite

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 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.3

show abstract

Section: Partitioning Samr Grid Hierarchiesmentioning

confidence: 99%

“…Domain-based partitioners [24,29,38,34] partition the physical domain, rather than the grids themselves. The domain is partitioned along with all contained grids on all refinement levels.…”

Section: Partitioning Samr Grid Hierarchiesmentioning

confidence: 99%

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

Steensland¹,

Ray²

2003

View full text Add to dashboard Cite

show abstract

“…The parallelization strategy in AMROC is a generalization of the strictly domain-based space-filling curve approach in GrACE [21] . To derive load balance, the partitions are computed exclusively on the basis of the root level .…”

Section: Amrocmentioning

confidence: 99%

An improved bi-level algorithm for partitioning dynamic grid hierarchies.

Deiterding

Johansson

Steensland³

et al. 2006

View full text Add to dashboard Cite

Structured adaptive mesh refinement methods are being widely used for computer simulations of various physical phenomena . Parallel implementations potentially offer realistic simulations of complex three-dimensional applications . But achieving good scalability for large-scale applications is non-trivial . Performance is limited by the partitioner ' s ability to efficiently use the underlying parallel computer's resources . Designed on sound SAMR principles, Nature+Fable is a hybrid, dedicated SAMR partitioning tool that brings together the advantages of both domain-based and patch-based techniques while avoiding their drawbacks. But the original bi-level partitioning approach in Nature+Fable is insufficient as it for realistic applications regards frequently occurr ing bi-levels as "impossible " and fails . This document describes an improved bi-level partitioning algorithm that successfully copes with all possible 3 hi-levels . The improved algorithm uses the original approach side-by-side with a new, complementing approach . By using a new, customized classification method, the improved algorithm switches automatically between the two approaches . This document describes the algorithms, discusses implementation issues, and presents experimental results . The improved version of Nature+Fable was found to be able to handle realistic applications and also to generate less imbalances, similar box count, but more communication as compared to the native, domainbased partitioner in the SAMR framework AMROC.

show abstract

“…These techniques are based on two different kind of hierarchical decomposition of the domain. The ordering of domain elements throught space-filling curves has been adopted in [8], [11] and [19]. Another parallelization approach for irregular problems, called CHAOS, is described in [10] and [15].…”

Section: Introductionmentioning

confidence: 99%

Parallelization of Irregular Problems Based on Hierarchical Domain Representation

Baiardi

Chiti

Mori

et al. 2000

High Performance Computing and Networking

View full text Add to dashboard Cite

Abstract. Irregular problems require the computation of some properties for a set of elements that are irregularly distributed in a domain. The distribution may change at run time in a way that cannot be foreseen in advance. Most irregular problems satisfy a locality property because the properties of an element e depend on the elements that are "close" to e. We propose a methodology to develop a highly parallel solution based upon a load balancing strategy that respects locality because e and most of the elements close to e are mapped onto the same processing node. We also discuss the update of the mapping at run time to recover an unbalancing, together with strategies to acquire data on elements mapped onto other processing node. The proposed methodology is applied to the multigrid adaptive problem and some experimental results are discussed.

show abstract

On partitioning dynamic adaptive grid hierarchies

Cited by 81 publications

References 5 publications

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

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

An improved bi-level algorithm for partitioning dynamic grid hierarchies.

Parallelization of Irregular Problems Based on Hierarchical Domain Representation

Contact Info

Product

Resources

About