The University of Southampton
University of Southampton Institutional Repository

Parallel Versions of Stone's Strongly Implicit Algorithm

Parallel Versions of Stone's Strongly Implicit Algorithm
Parallel Versions of Stone's Strongly Implicit Algorithm
In this paper, we describe various methods of deriving a parallel version of Stone's Strongly Implicit Procedure (SIP) for solving sparse linear equations arising from finite difference approximation to partial differential equations (PDE's). Sequential versions of this algorithm have been very successful in solving semi-conductor, heat conduction and flow simulation problems and an efficient parallel version would enable much larger simulations to be run. An initial investigation of various parallelising strategies was undertaken using a version of High Performance Fortran (HPF) and the best methods were reprogrammed using the MPI message passing libraries for increased efficiency. Early attempts concentrated on developing a parallel version of the characteristic wavefront computation pattern of the existing sequential SIP code. However, a red-black ordering of grid points, similar to that used in parallel versions of the Gauss-Seidel algorithm, is shown to be far more efficient. The results of both the wavefront and red-black MPI based algorithms are reported for various size problems and number of processors on a sixteen node IBM SP2.
Stones Algorithm Strongly Implicit Procedure
1532-0626
1049-1062
Reeve, Jeff
dd909010-7d44-44ea-83fe-a09e4d492618
Scurr, Anthony
197fdeba-9dad-4992-bb6f-3fe7ce4690d5
Merlin, John
eef0301b-a984-46a7-af72-b0ab3d40bff7
Reeve, Jeff
dd909010-7d44-44ea-83fe-a09e4d492618
Scurr, Anthony
197fdeba-9dad-4992-bb6f-3fe7ce4690d5
Merlin, John
eef0301b-a984-46a7-af72-b0ab3d40bff7

Reeve, Jeff, Scurr, Anthony and Merlin, John (2001) Parallel Versions of Stone's Strongly Implicit Algorithm Concurrency and Computation: Practice and Experience, 13, pp. 1049-1062.

Record type: Article

Abstract

In this paper, we describe various methods of deriving a parallel version of Stone's Strongly Implicit Procedure (SIP) for solving sparse linear equations arising from finite difference approximation to partial differential equations (PDE's). Sequential versions of this algorithm have been very successful in solving semi-conductor, heat conduction and flow simulation problems and an efficient parallel version would enable much larger simulations to be run. An initial investigation of various parallelising strategies was undertaken using a version of High Performance Fortran (HPF) and the best methods were reprogrammed using the MPI message passing libraries for increased efficiency. Early attempts concentrated on developing a parallel version of the characteristic wavefront computation pattern of the existing sequential SIP code. However, a red-black ordering of grid points, similar to that used in parallel versions of the Gauss-Seidel algorithm, is shown to be far more efficient. The results of both the wavefront and red-black MPI based algorithms are reported for various size problems and number of processors on a sixteen node IBM SP2.

Postscript paper.ps - Other
Download (372kB)

More information

Published date: 2001
Keywords: Stones Algorithm Strongly Implicit Procedure
Organisations: EEE

Identifiers

Local EPrints ID: 257614
URI: http://eprints.soton.ac.uk/id/eprint/257614
ISSN: 1532-0626
PURE UUID: 6fbe2fd1-5993-4f83-8d48-a100dc8c1b4a

Catalogue record

Date deposited: 17 Jun 2003
Last modified: 18 Jul 2017 09:37

Export record

Contributors

Author: Jeff Reeve
Author: Anthony Scurr
Author: John Merlin

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×