A parallel and scalable algorithm for ADI method with pre-propagation and message vectorization

Authors:
Akiyoshi Wakatani
Affiliations:
Faculty of Science and Engineering, Konan University, 8-9-1, Okamoto, Higashinada, Kobe 658-8501, Japan
Venue:
Parallel Computing
Year:
2004

Citing 4
Cited 1

Parallel computer ADENART—its architecture and application

ICS '91 Proceedings of the 5th international conference on Supercomputing
Two-dimensional parallel solver for the solution of Navier-Stokes equations with constant and variable coefficients using ADI on cells

Parallel Computing
Run-Time Selection of Block Size in Pipelined Parallel Programs

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
An Efficient Parallel ADI Algorithm for Solving 3-D Convection Diffusion Equations with Neumann Boundary Conditions

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops

Parallel Dichotomy Algorithm for solving tridiagonal system of linear equations with multiple right-hand sides

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is hard to implement the ADI method in an efficient way on distributed-memory parallel computers. We propose "P-scheme" which parallelizes a tridiagonal linear system of equations for the ADI method, but its effectiveness is limited to the cases where the problem size is large enough mainly because of the communication cost of the propagation phase of the scheme.In order to overcome this difficulty, we propose an improved version of the P-scheme with "message vectorization" which aggregates several communication messages into one and alleviates the communication cost. Also we evaluate the effectiveness of message vectorization for the ADI method and show that the improved version of the P-scheme works well even for smaller problems and linear and super-linear speedups can be achieved for 8194 × 8194 and 16,386 × 16.386 problems, respectively.