A Flexible Dynamic Partitioning Algorithm for Optimistic Distributed Simulation

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. 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.

[1]  Boleslaw K. Szymanski,et al.  Dynamic load balancing in parallel discrete event simulation for spatially explicit problems , 1998, Workshop on Parallel and Distributed Simulation.

[2]  Khalil El-Khatib,et al.  On metrics for the dynamic load balancing of optimistic simulations , 1999, Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers.

[3]  Herbert Bauer,et al.  Dynamic load balancing of a multi-cluster simulator on a network of workstations , 1995, PADS.

[4]  C.-L. Liu,et al.  Dynamic load balancing in parallel simulation using time warp mechanism , 1994, Proceedings of 1994 International Conference on Parallel and Distributed Systems.

[5]  Azzedine Boukerche,et al.  Partitioning parallel simulation of wireless networks , 2000, 2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165).

[6]  John C. S. Lui,et al.  An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems , 2002, IEEE Trans. Parallel Distributed Syst..

[7]  David R. Jefferson,et al.  Dynamic load management in the time warp operating system , 1990 .

[8]  Jouni Ikonen,et al.  Automatic load distribution for conservative distributed simulation , 2000, ESM.

[9]  Maria Hybinette.  Just-in-time cloning , 2004, 18th Workshop on Parallel and Distributed Simulation, 2004. PADS 2004..

[10]  21st International Workshop on Principles of Advanced and Distributed Simulation, PADS'07, San Diego, California, USA, June 12-15, 2007 , 2007, PADS.

[11]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[12]  Carl Tropper,et al.  On Process Migration and Load Balancing in Time Warp , 1993, IEEE Trans. Parallel Distributed Syst..

[13]  Malcolm Yoke-Hean Low.  Dynamic load-balancing for BSP Time Warp , 2002, Proceedings 35th Annual Simulation Symposium. SS 2002.

[14]  Jan Lemeire,et al.  Exploiting symmetry for partitioning models in parallel discrete event simulation , 2004, 18th Workshop on Parallel and Distributed Simulation, 2004. PADS 2004..

[15]  Christopher D. Carothers,et al.  Efficient Execution of Time Warp Programs on Heterogeneous, NOW Platforms , 2000, IEEE Trans. Parallel Distributed Syst..

[16]  H. Avril,et al.  The Dynamic Load Balancing of Clustered Time Warp for Logic Simulation , 1996, Proceedings of Symposium on Parallel and Distributed Tools.

[17]  Sajal K. Das,et al.  Dynamic load balancing strategies for conservative parallel simulations , 1997, Workshop on Parallel and Distributed Simulation.

[18]  Wei Shen,et al.  Experiments in load migration and dynamic load balancing in SPEEDES , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[19]  Richard M. Fujimoto,et al.  Parallel simulation: parallel and distributed simulation systems , 2001, WSC '01.