The implementation of the finite-volume dynamical core in the community atmosphere model

Authors:
William B. Sawyer;Arthur A. Mirin
Affiliations:
Swiss Federal Institute of Technology (ETHZ), Seminar for Applied Mathematics, Rämistrasse 101, Zürich 8092, Switzerland and Global Modeling and Assimilation Office (GMAO), Goddard Space ...;Lawrence Livermore National Laboratory, Livermore, CA 94550, USA
Venue:
Journal of Computational and Applied Mathematics
Year:
2007

Citing 7
Cited 1

Design and performance of a scalable parallel community climate model

Parallel Computing - Special issue: climate and weather modeling
Weather forecasting on parallel architectures

Parallel Computing - Special issue: climate and weather modeling
OpenMP: An Industry-Standard API for Shared-Memory Programming

IEEE Computational Science & Engineering
MPI: A Message-Passing Interface Standard

MPI: A Message-Passing Interface Standard
Performance Portability in the Physical Parameterizations of the Community Atmospheric Model

International Journal of High Performance Computing Applications
A Scalable Implementation of a Finite-Volume Dynamical Core in the Community Atmosphere Model

International Journal of High Performance Computing Applications
Cross-Platform Performance of a Portable Communication Module and the Nasa Finite Volume General Circulation Model

International Journal of High Performance Computing Applications

Understanding the formation of wait states in applications with one-sided communication

Proceedings of the 20th European MPI Users' Group Meeting

Quantified Score

Hi-index	7.29

Visualization

Abstract

A distributed memory message-passing parallel implementation of a finite-volume discretization of the primitive equations in the community atmosphere model (CAM) 3.0 is presented. These 3-D equations can be decoupled into a set of 2-D equations by the introduction of a floating vertical coordinate, resulting in considerable potential parallelism. Subsequent analysis of the data dependencies-in particular those arising from the polar singularity of the latitude-longitude coordinate system-suggests that two separate domain decompositions should be employed, each tailored for a different part of the model. The implementation requires that data be periodically redistributed between these two decompositions. Furthermore, data from nearest neighbors are kept in halo regions, which are updated between iterations. These data movements are optimized through one-sided communication primitives and multithreading. The resulting algorithm is shown to scale to very large machine configurations, even for relatively coarse resolutions.