On the Optimal Number of Subdomains for Hyperbolic Problems on Parallel Computers.

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 uniprocessor values, and that the effects of granularity are more important.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1996
Accession Number
ADA321327

Entities

People

  • David Gottlieb
  • Paul Fischer

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Arithmetic
  • Boundaries
  • Chebyshev Polynomials
  • Computational Complexity
  • Computations
  • Computers
  • Computing System Architectures
  • Cost Analysis
  • Costs
  • Differential Equations
  • Engineering
  • Equations
  • Partial Differential Equations
  • Topology
  • Two Dimensional

Fields of Study

  • Engineering

Readers

  • Atmospheric Science / Meteorology, specifically Wind Wave Turbulence.
  • Computational Fluid Dynamics (CFD)
  • Parallel and Distributed Computing.