loading...
Towards an Efficient Branching Mechanism for Simultaneous Events in Distributed Simulation
Singapore May 24-May 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PADS.2006.3620th Workshop on Principles of Advanc ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Patrick Peschlow, Universit?t Bonn, Germany
Peter Martini, Universit?t Bonn, Germany
In distributed discrete-event simulation, simultaneous events can considerably influence simulation results as well as hinder reproducibility. As tie-breaking rules do not solve these problems satisfactorily [4], it makes sense to examine different event execution orders by using a branching mechanism. Branching guarantees reproducibility and increases confidence in simulation results, and we have already shown techniques for an efficient implementation with sequential simulation in [1]. However, branching poses additional challenges in distributed simulation.
Citation:
Patrick Peschlow, Peter Martini, "Towards an Efficient Branching Mechanism for Simultaneous Events in Distributed Simulation," pads, pp.133, 20th Workshop on Principles of Advanced and Distributed Simulation (PADS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.