International Journal of High Performance Computing Applications

 

Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Click here for more information

Sign In to gain access to subscriptions and/or personal tools.
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via ISI Web of Science (3)
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Mirin, A. A.
Right arrow Articles by Sawyer, W. B.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati  
What's this?
International Journal of High Performance Computing Applications, Vol. 19, No. 3, 203-212 (2005)
DOI: 10.1177/1094342005056096

A Scalable Implementation of a Finite-Volume Dynamical Core in the Community Atmosphere Model

Arthur A. Mirin

Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore, CA 94550, USA, mirin{at}llnl.gov

William B. Sawyer

Swiss Federal Institute of Technology (ETHZ) Rämistrasse 101, 8092 Zurich, Switzerland

We present a distributed memory message passing parallel implementation of a finite-volume discretization of the primitive equations in the Community Atmosphere Model. Due to the data dependences resulting from the polar singularity of the latitude-longitude coordinate system, we employ two separate domain decompositions within the dynamical core: one in latitude/level space and the other in longitude/latitude space. This requires that the data be periodically redistributed between these two decompositions. In addition, the domains contain halo regions that cover the nearest-neighbor data dependences. A combination of several techniques, such as one-sided communication and multithreading, are presented to optimize data movements. The resulting algorithm is shown to scale to very large machine configurations, even for relatively coarse resolutions.

Key Words: atmospheric dynamics • parallel processing


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati    What's this?