The Parallelization of the Princeton Ocean Model

Authors:
L. A. Boukas;N. Th. Mimikou;Nikolaos M. Missirlis;G. L. Mellor;A. Lascaratos;G. Korres
Affiliations:
-;-;-;-;-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 5
Cited 3

Parallel ocean general circulation modeling

Proceedings of the eleventh annual international conference of the Center for Nonlinear Studies on Experimental mathematics : computational issues in nonlinear science: computational issues in nonlinear science
Experiments with an ocean circulation model on CEDAR

ICS '92 Proceedings of the 6th international conference on Supercomputing
Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
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
(R) 3-D Land Avoidance and Load Balancing in Regional Ocean Simulation

ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 2

Parallelization of the Fvcom Coastal Ocean Model

International Journal of High Performance Computing Applications
A simple parallelization technique with MPI for ocean circulation models

Journal of Parallel and Distributed Computing
Software, data and modelling news: sbPOM: A parallel implementation of Princenton Ocean Model

Environmental Modelling & Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present the parallel implementation of the Princeton Ocean Model (POM) using message passing. Domain decomposition techniques are used for the horizontal discretization whereas in the vertical direction each column per grid point is computed. The required interprocessor communication was implemented on the PVM message passing library. Three different data partitioning schemes are studied. It is found that the checkerboard partitioning produces the best results when the number of processors becomes larger than 15, otherwise row block striped partitioning is to be preferred.