An algorithm for optimistic distributed simulations
Blekinge Institute of Technology, School of Computing2009 (English)Conference paper (Refereed) Published
Distributed simulation has traditionally suffered from synchronization constraints that reduce the speedup significantly below the theoretical maximum. One solution approach are optimistic synchronization algorithms, allowing some nodes to advance in model time. In this paper, we present a novel algorithm that does not share the typical rollback costs of optimistic simulation, at the expense of restrictions on the design of simulation models. We have implemented that algorithm in an agent-based simulation framework, and evaluate its performance gains through measurements on actual simulation models.
Place, publisher, year, edition, pages
Beijing: IASTED , 2009.
Agents, Discrete event simulation, Optimistic simulation
IdentifiersURN: urn:nbn:se:bth-7775Local ID: oai:bth.se:forskinfoA31E72DEDD61D353C125775800419A5FOAI: oai:DiVA.org:bth-7775DiVA: diva2:835437
IASTED International Conference on Modelling, Simulation, and Identification, MSI 2009