On the optimal number of subdomains for hyperbolic problems on parallel computers
By: Paul Fischer, David Gottlieb.
Contributors: Gottlieb, David.; Institute for Computer Applications in Science and Engineering.
Series: ICASE report -- no. 96-68.; NASA contractor report -- NASA CR-201625.
Publisher: Institute for Computer Applications in Science and Engineering, NASA Langley Research Center
Published: 1996
Place of publication: Hampton, Va
Language: eng
Number of pages: 12
Subjects: Spectral geometry; Computational complexity; Differential equation, Hyperbolic; Parallel processing (Electronic computers)
Description: 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 numerical solution of hyperbolic problems.  The complexity analysis is based upon theoretical results which predict error as a function of (q,n) for problems having wave-like solutions.  These are combined with a linear communication cost model to study the impact of communication 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 impact of communication overhead does not significantly shift (q,n) from the optimal uni-processor values, and that the effects of granularity are more important."
Notes: Cover title.

"December 1996."

Includes bibliographical references.

Supported in part by the NSF. ASC-9405403.

Supported in part by AFOSR. F49620-95-1-0074.

Supported in part by the National Aeronautics and Space Administration. NAS1-19480.