On the Optimal Number of Subdomains for Hyperbolic Problems on Parallel Computers
- 1 March 1997
- journal article
- research article
- Published by SAGE Publications in The International Journal of Supercomputer Applications and High Performance Computing
- Vol. 11 (1), 65-76
- https://doi.org/10.1177/109434209701100105
Abstract
The computational complexity for parallel implementation of multidomain spectral methods is studied to derive the optimal number of subdomains, q, and spectral order, n, for the numerical solution of hyperbolic problems. The complexity analysis is based on theoretical results that predict error as a function of (q,n) for problems having wavelike solutions. These are combined with a linear com munication cost model to study the impact of communica tion overhead and imposed granularity on the optimal choice of ( q,n) as a function of the number of processors. It is shown that, for present-day multicomputers, the im pact of communication overhead does not significantly shift ( q,n) from the optimal uniprocessor values and that the effects of granularity are more important.Keywords
This publication has 4 references indexed in Scilit:
- Parallel complexity of domain decomposition methods and optimal coarse grid sizeParallel Computing, 1995
- Time-Stable Boundary Conditions for Finite-Difference Schemes Solving Hyperbolic Systems: Methodology and Application to High-Order Compact SchemesJournal of Computational Physics, 1994
- Development of Parallel Methods for a $1024$-Processor HypercubeSIAM Journal on Scientific and Statistical Computing, 1988
- Driven cavity flows by efficient numerical techniquesJournal of Computational Physics, 1983