PARALLEL TALBOT ALGORITHM FOR DISTRIBUTED-MEMORY MACHINES

被引：6
|
作者：
DEROSA, MA [1 ]
GIUNTA, G [1 ]
RIZZARDI, M [1 ]
机构：
[1] IST UNIV NAVALE,IST MATEMAT SN,I-80133 NAPLES,ITALY
来源：
PARALLEL COMPUTING | 1995年 / 21卷 / 05期
关键词：
LAPLACE TRANSFORM; TALBOTS METHOD; GOERTZEL-REINSCH ALGORITHM; STABILITY ANALYSIS; INTEL IPSC/860;
D O I：
10.1016/0167-8191(94)00108-M
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Talbot's method is a general numerical method for the inversion of Laplace Transforms. It uses the Riemann Inversion Formula by approximating the value of the inverse Laplace Transform f(t), for t fixed, by means of suitable samples of the Laplace Transform function F(s) in the complex plane. In this paper a parallel algorithm for Talbot's method, designed for distributed memory MIMD machines, is introduced to enhance the efficiency. It is principally based on a parallel version of the Goertzel-Reinsch algorithm for computing Clenshaw's sums. Such a parallel algorithm allows large scale Laplace inversion problems to be efficiently solved. An analysis of the stability of the parallel algorithm is also carried out and some experimental results of a 16-node INTEL iPSC/860 implementation are reported.
引用
收藏
页码：783 / 801
页数：19
相关论文
共 50 条
  • [1] Optimal scheduling algorithm for distributed-memory machines
    Darbha, S
    Agrawal, DP
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (01) : 87 - 95
  • [2] PARALLEL COMPUTATION OF GROBNER BASES ON DISTRIBUTED-MEMORY MACHINES
    SAWADA, H
    TERASAKI, S
    AIBA, A
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 1994, 18 (03) : 207 - 222
  • [3] Parallel FP-LAPW for distributed-memory machines
    Dohmen, R
    Pichlmeier, J
    Petersen, M
    Wagner, F
    Scheffler, M
    [J]. COMPUTING IN SCIENCE & ENGINEERING, 2001, 3 (04) : 18 - 29
  • [4] An interleaving transformation for parallelizing reductions for distributed-memory parallel machines
    Wu, JJ
    [J]. JOURNAL OF SUPERCOMPUTING, 2000, 15 (03): : 321 - 339
  • [5] An Interleaving Transformation for Parallelizing Reductions for Distributed-Memory Parallel Machines
    Jan-Jan Wu
    [J]. The Journal of Supercomputing, 2000, 15 : 321 - 339
  • [6] TDR: A distributed-memory parallel routing algorithm for FPGAs
    Cabral, LAF
    Aude, RS
    Maculan, N
    [J]. FIELD-PROGRAMMABLE LOGIC AND APPLICATIONS, PROCEEDINGS: RECONFIGURABLE COMPUTING IS GOING MAINSTREAM, 2002, 2438 : 263 - 270
  • [7] New parallel scheduling algorithm on distributed-memory systems
    Lu, G.H.
    Sun, S.X.
    [J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2001, 38 (02):
  • [8] An asynchronous algorithm for balancing unpredictable workload on distributed-memory machines
    Chung, Y
    Park, JW
    Yoon, SH
    [J]. ETRI JOURNAL, 1998, 20 (04) : 346 - 360
  • [9] Asynchronously parallel Boltzmann machines mapped onto distributed-memory multiprocessors
    Benitez, JM
    Ortega, J
    Requena, I
    [J]. FROM NATURAL TO ARTIFICIAL NEURAL COMPUTATION, 1995, 930 : 744 - 751
  • [10] Distributed-Memory Parallel JointNMF
    Eswar, Srinivas
    Cobb, Benjamin
    Hayashi, Koby
    Kannan, Ramakrishnan
    Ballard, Grey
    Vuduc, Richard
    Park, Haesun
    [J]. PROCEEDINGS OF THE 37TH INTERNATIONAL CONFERENCE ON SUPERCOMPUTING, ACM ICS 2023, 2023, : 301 - 312
12345