Bragard, QuentinQuentinBragardVentresque, AnthonyAnthonyVentresqueMurphy, Liam, B.E.Liam, B.E.Murphy2015-10-052015-10-052014 ACM2014-05-21http://hdl.handle.net/10197/7146Proceedings of the 2nd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, Denver, Colorado, USA, 18 - 21 May, 2014Synchronisation mechanisms are essential in distributed simulation. 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 simulation at a global scale. Being able to act on the entire simulation is an important feature which allows to dynamically load-balance a distributed simulation. While some local partitioning algorithms exist [12], their lack of global view reduces their efficiency. 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 first algorithm requires the knowledge of some topological properties of the network while the second algorithm works without any requirement. The algorithms are detailed and compared against each other. An evaluation shows the benefits of using a global dynamic load-balancing for distributed simulations.en© Bragard, Quentin; Ventresque, Anthony; Murphy, Liam | ACM} {2014}. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of the 2nd ACM SIGSIM/PADS Conference on Principles of Advanced Discrete Simulation, Denver, Colorado, USA, 18 - 21 May, 2014, http://dx.doi.org/10.1145/10.1145/2601381.2601386.Dynamic load-balancingSynchronisationDistributed simulationConference Publication10.1145/2601381.26013862015-09-30https://creativecommons.org/licenses/by-nc-nd/3.0/ie/