Options
Synchronisation for Dynamic Load Balancing of Decentralised Conservative Distributed Simulation
Date Issued
2014-05-21
Date Available
2015-10-05T08:48:27Z
Abstract
Synchronisation 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.
Sponsorship
Science Foundation Ireland
Other Sponsorship
Lero
Type of Material
Conference Publication
Publisher
Association for Computing Machinery
Copyright (Published Version)
2014 ACM
Language
English
Status of Item
Peer reviewed
Conference Details
Proceedings of the 2nd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, Denver, Colorado, USA, 18 - 21 May, 2014
This item is made available under a Creative Commons License
File(s)
Owning collection
Scopus© citations
5
Acquisition Date
Mar 28, 2024
Mar 28, 2024
Views
1993
Last Month
2
2
Acquisition Date
Mar 27, 2024
Mar 27, 2024
Downloads
347
Last Month
5
5
Acquisition Date
Mar 27, 2024
Mar 27, 2024