Time Parallel Simulation and hv-Monotonicity

We show how we can make more efficient the time parallel simulation of monotone systems adapting Nicol’s approach. We use the monotonicity of a model related to the initial state of the simulation and we prove an algorithm with fix-up computations which minimises the number of runs before we get a consistent sample-path. We obtain proved upper or lower bounds of the sample-path of the simulation and bounds of some estimates as well.

[1]  Damla Turgut,et al.  Speedup-Precision Tradeoffs in Time-Parallel Simulation of Wireless Ad hoc Networks , 2006, 2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications.

[2]  R.M. Fujimoto,et al.  Parallel and distributed simulation systems , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[3]  Albert G. Greenberg,et al.  Algorithms for unboundedly parallel simulations , 1991, TOCS.

[4]  Albert G. Greenberg,et al.  ICASE MASSIVELY PARALLEL ALGORITHMS FOR TRACE-DRIVEN CACHE SIMULATIONS , 1991 .

[5]  Richard M. Fujimoto,et al.  Parallel simulation of statistical multiplexers , 1995, Discret. Event Dyn. Syst..

[6]  Hagit Attiya,et al.  Wiley Series on Parallel and Distributed Computing , 2004, SCADA Security: Machine Learning Concepts for Intrusion Detection and Prevention.

[7]  Jean-Michel Fourneau,et al.  Improving Time Parallel Simulation for Monotone Systems , 2009, 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications.

[8]  Jean-Michel Fourneau,et al.  An Algorithmic Approach to Stochastic Bounds , 2002, Performance.

[9]  Sigrún Andradóttir,et al.  Parallel simulation of transfer lines by time segmentation , 2004, Eur. J. Oper. Res..