Parallel algorithms for the spectral transform method

doi:10.1137/S1064827594266891

Parallel algorithms for the spectral transform method

1997-05-01

44

OA

AI

DOI：10.1137/S1064827594266891

Original

Original request for help

Save

Abstract

En 中文

The spectral transform method is a standard numerical technique for solving partial differential equations on a sphere and is widely used in atmospheric circulation models. Re cent research has identified several promising algorithms for implementing this method on massively parallel computers. however, no detailed comparison of the different algorithms has previously been attempted. In this paper, we describe these different parallel algorithms and report on computational experiments that we have conducted to evaluate their efficiency on parallel computers. The experiments used a testbed code that solves the nonlinear shallow water equations on a sphere: considerable care was taken to ensure that the experiments provide a fair comparison of the different algorithms and that the results are relevant to global models. We focus on hypercube- and mesh-connected multicomputers with cut-through routing, such as the Intel iPSC/860, DELTA, and Paragon, and the nCUBE/2, but we also indicate how the results extend to other parallel computer architectures. The results of this study are relevant not only to the spectral transform method but also to multidimensional fast Fourier transforms (FFTs) and other parallel transforms.

Keywords:

spectral transform method

parallel algorithms

performance analysis

Parallel algorithms for the spectral transform method

Abstract

Journal

Organization