A comparison of restart implementations

被引:0
|
作者
Garvels, MJJ [1 ]
Kroese, DP [1 ]
机构
[1] Univ Twente, Ctr Telemat & Informat Technol, NL-7500 AE Enschede, Netherlands
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The RESTART method is a widely applicable simulation technique for the estimation of rare event probabilities. The method is based on the idea to restart the simulation in certain system states, in order to generate more occurrences of the rare event. One of the main questions for any RESTART implementation is how and when to restart the simulation, in order to achieve the most accurate results for a fixed simulation effort. In this paper we investigate and compare, both theoretically and empirically, different implementations of the RESTART method. We find that the original RESTART implementation, in which each path is split into a fixed number of copies, may not be the most efficient one. It is generally better to fix the total simulation effort for each stage of the simulation. Furthermore, given this effort, the best strategy is to restart an equal number of times from each state, rather than to restart each time from a randomly chosen state.
引用
收藏
页码:601 / 608
页数:8
相关论文
共 50 条
  • [1] A survey of fault tolerance mechanisms and checkpoint/restart implementations for high performance computing systems
    Egwutuoha, Ifeanyi P.
    Levy, David
    Selic, Bran
    Chen, Shiping
    JOURNAL OF SUPERCOMPUTING, 2013, 65 (03): : 1302 - 1326
  • [2] A survey of fault tolerance mechanisms and checkpoint/restart implementations for high performance computing systems
    Ifeanyi P. Egwutuoha
    David Levy
    Bran Selic
    Shiping Chen
    The Journal of Supercomputing, 2013, 65 : 1302 - 1326
  • [3] A Comparison of the Scalability of OpenMP Implementations
    Jammer, Tim
    Iwainsky, Christian
    Bischof, Christian
    EURO-PAR 2020: PARALLEL PROCESSING, 2020, 12247 : 83 - 97
  • [4] An empirical comparison of CORBA implementations
    Eggen, RE
    Grant, IK
    7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL II, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING, 2003, : 338 - 343
  • [5] Comparison of different implementations of MFCC
    Zheng, F
    Zhang, GL
    Song, ZJ
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2001, 16 (06) : 582 - 589
  • [6] Comparison of different implementations of MFCC
    Fang Zheng
    Guoliang Zhang
    Zhanjiang Song
    Journal of Computer Science and Technology, 2001, 16 : 582 - 589
  • [7] A comparison of three MPI implementations
    Vinter, B
    Bjorndalen, JM
    Anshus, OJ
    Larsen, T
    COMMUNICATING PROCESS ARCHITECTURES 2004, 2004, 62 : 127 - 136
  • [8] Comparison of Different Implementations of MFCC
    郑方
    张国亮
    宋战江
    Journal of Computer Science and Technology, 2001, (06) : 582 - 589
  • [9] Comparison of branching CORDIC implementations
    Singh, A
    Phatak, DS
    Goff, T
    Riggs, M
    Plusquellic, J
    Patel, C
    IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, PROCEEDINGS, 2003, : 215 - 225
  • [10] Comparison and optimization of RESTART run time strategies
    Gorg, C
    Fuss, O
    AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 1998, 52 (03) : 197 - 204