Parallel implementation of domain decomposition techniques on Intel's hypercube

Authors:
M. Haghoo;W. Proskurowski
Affiliations:
Department of Mathematics, University of Southern California, Los Angeles, CA;Department of Mathematics, University of Southern California, Los Angeles, CA
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Year:
1989

Citing 3
Cited 1

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

SIAM Journal on Scientific and Statistical Computing
Interpreting parallel processor performance measurements

SIAM Journal on Scientific and Statistical Computing
Hypercube algorithms and implementations

SIAM Journal on Scientific and Statistical Computing

What have we learnt from using real parallel machines to solve real problems?

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parallel implementation of domain decomposition techniques for elliptic PDEs in rectangular regions is considered. This technique is well suited for parallel processing, since in the solution process the subproblems either are independent or can be easily converted into decoupled problems. More than 80% of execution time is spent on solving these independent and decoupled problems.The hypercube architecture is used for concurrent execution. The performance of the parallel algorithm is compared against the sequential version. The speed-up, efficiency, and communication factors are studied as functions the number of processors. Extensive tests are performed to find, for a given mesh size, the number of subregions and nodes that minimize the overall execution time.