On the optimal number of subdomains for hyperbolic problems on parallel computers

被引:15
作者
Fischer, P
Gottlieb, D
机构
[1] Division of Applied Mathematics, Brown University, Providence
[2] Division of Applied Mathematics, Brown University
[3] Ctr. Res. in Parallel Computation, Caltech
来源
INTERNATIONAL JOURNAL OF SUPERCOMPUTER APPLICATIONS AND HIGH PERFORMANCE COMPUTING | 1997年 / 11卷 / 01期
关键词
D O I
10.1177/109434209701100105
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 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.
引用
收藏
页码:65 / 76
页数:12
相关论文
共 7 条
  • [1] CARPENTER M, 1995, IN PRESS J COMP PHYS, V111, P220
  • [2] PARALLEL COMPLEXITY OF DOMAIN DECOMPOSITION METHODS AND OPTIMAL COARSE GRID SIZE
    CHAN, TF
    SHAO, JP
    [J]. PARALLEL COMPUTING, 1995, 21 (07) : 1033 - 1049
  • [3] Gear C. W., 1971, NUMERICAL INITIAL VA
  • [4] GOTTLIEB DI, 1996, IN PRESS 9 INT C DOM
  • [5] DEVELOPMENT OF PARALLEL METHODS FOR A 1024-PROCESSOR HYPERCUBE
    GUSTAFSON, JL
    MONTRY, GR
    BENNER, RE
    [J]. SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1988, 9 (04): : 609 - 638
  • [6] KELLER HB, 1983, J COMP PHYS, V49, P310
  • [7] RONQUIST E, 1988, THESIS MIT