Architecture-adaptable finite element modelling: a case study using ocean circulation simulation

Authors:
Santosh Kumaran;Michael J. Quinn;Robert N. Miller
Affiliations:
Department of Computer Science, Oregon State University, Corvallis, OR;Department of Computer Science, Oregon State University, Corvallis, OR;College of Oceanic and Atmospheric Sciences, Oregon State University, Corvallis, OR
Venue:
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Year:
1995

Citing 7
Cited 1

A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation

SIAM Journal on Scientific and Statistical Computing
Finite element applications on a shared-memory multiprocessor: algorithms and experimental results

Journal of Computational Physics
A data parallel finite element method for computational fluid dynamics on the Connection Machine system

Computer Methods in Applied Mechanics and Engineering
Computational fluid mechanics and massively parallel processors

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Analytical performance prediction on multicomputers

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Parallel computing (2nd ed.): theory and practice

Parallel computing (2nd ed.): theory and practice
Divide-and-conquer programming on MIMD computers

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing

Automatic exploitation of dual level parallelism on a network of multiprocessors

HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an architecture-adaptable methodology for the parallel implementation of finite element numerical models of physical systems. We use a model of time-dependent ocean currents as our working example. The heart of the computation is the solution of a banded linear system, and we describe an algorithm based on the domain decompositionmethod to solve the banded system. The algorithm is represented in a divide-and-conquer framework facilitates easy implementation of various algorithmic options. The process is straightforward and amenable to automation. We demonstrate the validity of this approach using two radically different target machine, a workstation network and a supercomputer. Our results show very good speedup on both platforms.