Automatic run-time choice for simulation length in mimesis

被引:0
|
作者
Becker, M
Beylot, AL
Damm, G
Thang, WY
机构
[1] Inst Natl Telecommun, INF, F-91011 Evry, France
[2] MASI Lab Associate Members, F-75252 Paris, France
[3] Univ Versailles, PRiSM Lab, F-78035 Versailles, France
[4] EDF, DER, F-92141 Clamart, France
来源
关键词
simulation; stopping procedure; confidence intervals;
D O I
10.1051/ro:1999107
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents an algorithm which prevents a simulation user from choosing a simulation length. This choice is always tricky and often leads to CPU-time waste, not to mention user-time waste. Too often, simulation users forget to compute confidence intervals: they only guess a simulation length and ignore the confidence on the simulation results. Those who do compute them generally try several lengths (and thus run several simulations) so as to obtain small enough confidence intervals. The algorithm aims at optimizing this length choice by running only one simulation and by stoping it nearly as soon as possible, i.e. when some predefined relative confidence intervals on each of the performance criteria are reached. For this purpose, the confidence intervals are periodically computed, at run-time, with the batch mean method. According to these intermediate results and to estimators properties, a mobile simulation length is (also periodically) predicted. The algorithm automatically determines batch size and batches number. This process goes on until all confidence intervals are smaller than the predefined thresholds. This algorithm is implemented in MIMESIS, a computer architecture performance evaluation tool.
引用
收藏
页码:93 / 115
页数:23
相关论文
共 50 条
  • [1] Automatic run-time choice for simulation length in MIMESIS
    Becker, M.
    Beylot, A.-L.
    Damm, G.
    Thang, W.-Y.
    [J]. RAIRO Recherche Operationnelle, 1999, 33 (01): : 93 - 115
  • [2] AUTOMATIC GENERATION OF RUN-TIME PARAMETERIZABLE CONFIGURATIONS
    Bruneel, Karel
    Stroobandt, Dirk
    [J]. 2008 INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE AND LOGIC APPLICATIONS, VOLS 1 AND 2, 2008, : 360 - 365
  • [3] Automatic run-time versioning for BPEL processes
    Melo P.
    da Cunha P.R.
    da Silva C.F.
    Macedo A.
    [J]. Service Oriented Computing and Applications, 2017, 11 (3) : 315 - 327
  • [4] Automatic proof of the absence of run-time errors
    Garnsworthy, Jon
    O'Neill, Ian
    Carre, Bernard
    [J]. Studies in Computer and Communications Systems, 1993, 6
  • [5] Run-Time Automatic Performance Tuning for Multicore Applications
    Karcher, Thomas
    Pankratius, Victor
    [J]. EURO-PAR 2011 PARALLEL PROCESSING, PT 1, 2011, 6852 : 3 - 14
  • [6] Run-Time Support for the Automatic Parallelization of Java Programs
    Bryan Chan
    Tarek S. Abdelrahman
    [J]. The Journal of Supercomputing, 2004, 28 : 91 - 117
  • [7] Automatic dynamic run-time optical network reservations
    Lange, JR
    Sundararaj, AI
    Dinda, PA
    [J]. 14TH IEEE INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE DISTRIBUTED COMPUTING, PROCEEDINGS, 2005, : 255 - 264
  • [8] Run-Time Extensibility and Librarization of Simulation Software
    Brown, Jed
    Knepley, Matthew G.
    Smith, Barry F.
    [J]. COMPUTING IN SCIENCE & ENGINEERING, 2015, 17 (01) : 38 - 45
  • [9] Run-time support for the automatic parallelization of Java programs
    Chan, Bryan
    Abdelrahman, Tarek S.
    [J]. J Supercomput, 1600, 1 (91-117):
  • [10] Automatic configuration and run-time adaptation of distributed applications
    Chang, FZ
    Karamcheti, V
    [J]. NINTH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE DISTRIBUTED COMPUTING, PROCEEDINGS, 2000, : 11 - 20