An Integrated Decomposition and Partitioning Approach for Irregular Block-Structured Applications

Authors:
Jarmo Rantakokko
Affiliations:
-
Venue:
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Year:
2000

Citing 4
Cited 2

A comparison of data-parallel and message-passing versions of the Miami Isopycnic Coordinate Ocean Model (MICOM)

Parallel Computing - Special issue: climate and weather modeling
A parallel adaptive grid algorithm for computational shock hydrodynamics

Applied Numerical Mathematics - Special issue on adaptive mesh refinement methods for CFD applications
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
A parallel software infrastructure for dynamic block-irregular scientific calculations

A parallel software infrastructure for dynamic block-irregular scientific calculations

Optimization of Distributed Implementation of Grayscale Electron-Beam Proximity Effect Correction on a Temporally Heterogeneous Cluster

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14
Parallel clustering algorithms for structured AMR

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an integrated domain decomposition and data partitioning approach for irregular bloc k-structured methods in scientific computing. We have demonstrated the method for an application related to Ocean modeling. Our approach gives better results than other methods that we have found in the literature. We have compared the domain decomposition part with the Berger-Rigoutsos point clustering algorithm and the partitioning part with a multilev elmethod used in Metis, a bin pac king method, and an inverse space filling curve algorithm. The partitions produced with our approach give lower run times, i.e. higher parallel efficiency, for our application than all the other partitions we have tried. Moreover, the integrated approach gives a possibility to further improve the parallel efficiency compared to doing the decomposition and partitioning in two separate steps.