Partitioning with Space-Filling Curves on the Cubed-Sphere

  • Authors:
  • John M. Dennis

  • Affiliations:
  • -

  • Venue:
  • IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Solving partial differential equations arising in geophysical fluid dynamics on distributed memory computers requires partitioning of the computational domain. The partitioning algorithm has a impact on the execution rate of an atmospheric model. The NCAR spectral element model projects a cube onto a sphere. The cube faces are subdivided into an array of quadrilateral spectral element. When the cubed-sphere is partitioned using METIS, both load imbalance and communication requirements leads to sub-optimal performance. Hilbert and Peano space-filling curves are investigated as alternative partitioning algorithms. The resulting partitions allow a 22% increase in execution rate versus METIS on O(1000) processors.