The Community for Technology Leaders
2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (2007)
San Diego, California, USA
June 12, 2007 to June 15, 2007
ISBN: 0-7695-2898-8
pp: 219-228
Patrick Peschlow , University of Bonn, Germany
Peter Martini , University of Bonn, Germany
Tobias Honecker , University of Bonn, Germany
The performance of distributed simulation depends very much on the partitioning of the simulation model among the participating hosts. Usually, when starting a simulation run, an initial partitioning is determined by taking into account the available computing resources as well as the expected workload and the communication structure of the simulation model. However, as hosts can be subject to background load or the model behavior can change in the course of the simulation, a dynamic partitioning mechanism is required to avoid inefficiencies. <p>In this paper, we introduce a new dynamic partitioning algorithm for optimistic distributed simulation. The algorithm is generally applicable but can also be configured to meet the requirements of specific scenarios. It is based on performance estimates for both computation and communication workload, the calculation of which is completely platform-independent. Our experiments show that the algorithm has low overhead and reacts reliably to changes of both model behavior and external resources.</p>
Patrick Peschlow, Peter Martini, Tobias Honecker, "A Flexible Dynamic Partitioning Algorithm for Optimistic Distributed Simulation", 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, vol. 00, no. , pp. 219-228, 2007, doi:10.1109/PADS.2007.6
95 ms
(Ver 3.3 (11022016))