Synchronisation for dynamic load balancing of decentralised conservative distributed simulation

Synchronisation mechanisms are essential in distributed sim- ulation. Some systems rely on central units to control the simulation but central units are known to be bottlenecks [10]. If we want to avoid using a central unit to optimise the simulation speed, we lose the capacity to act on the sim- ulation at a global scale. Being able to act on the entire simulation is an important feature which allows to dynam- ically load-balance a distributed simulation. While some local partitioning algorithms exist [12], their lack of global view reduces their e ciency. Running a global partitioning algorithm without central unit requires a synchronisation of all logical processes (LPs) at the same step.We introduce in this paper two algorithms allowing to synchronise logical processes in a distributed simulation without any central unit. The rst algorithm requires the knowledge of some topological properties of the network while the second algo- rithm works without any requirement. The algorithms are detailed and compared against each other. An evaluation shows the bene ts of using a global dynamic load-balancing for distributed simulations.