On the potential of semi-conservative look-ahead estimation in approximative distributed discrete event simulation

  • Authors:
  • Desheng Fu;Matthias Becker;Helena Szczerbicka

  • Affiliations:
  • University of Hannover Modeling & Simulation Group, Hannover, Germany;University of Hannover Modeling & Simulation Group, Hannover, Germany;University of Hannover Modeling & Simulation Group, Hannover, Germany

  • Venue:
  • Proceedings of the 2013 Summer Computer Simulation Conference
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

One major problem of distributed discrete event simulation is the poor performance due to the huge overhead for maintaining the order of causality, so that the execution time cannot be reduced significantly compared to sequential simulation. This holds especially when the processes are tightly coupled and the look-ahead is very short. On the other hand, results of many simulations are obtained from a number of independent outputs, which are of stochastic nature and a small deviation of a limited amount of outputs is acceptable. Acceptance of such deviations in a controlled way could affect a trade-off between the simulation accuracy and the execution time. The goal of our investigation is to develop a methodology to handle the trade-off. In this paper, we propose a new way of distributed simulation with semi-conservative look-ahead estimation, where we accept causality errors to a certain and limited extent. In our approach, we consider a semi-conservative estimation allowing limited over-estimation. If the look-ahead is over-estimated, unsolved causality errors will be resolved by a very efficient recovery procedure at the expense of simulation errors. Results from a case study demonstrate that our approach is able to maximize the look-ahead with respect to the predefined error bounds and can reduce the execution time of many simulations. We do however also point out the limitations of the mechanism and the trend of our further investigation.