Multiprocessor implementations of a parallel Implicit Runge-Kutta code

Author

William N. Rust

Date of Award

12-1986

Degree Type

Thesis

Degree Name

Master of Science

Major

Mathematics

Major Professor

Ohannes Karakashian

Committee Members

Steven M. Serbin

Abstract

A two-stage Implicit Runge-Kutta algorithm is shown to exhibit a high level of parallelism making it an ideal candidate for coding and execution on a two-processor parallel computing system. The algorithm is coded for execution on both a loosely-coupled (CDC Cyberplus) and a tightly-coupled (CRI Cray X-MP) multiprocessor system. The coding and implementation on both systems is described and the performance in terms of speedup is presented. It is shown that the algorithm may be successfully parallel processed on the tightly-coupled system.

Recommended Citation

Rust, William N., "Multiprocessor implementations of a parallel Implicit Runge-Kutta code. " Master's Thesis, University of Tennessee, 1986.
https://trace.tennessee.edu/utk_gradthes/13792