A Synchronized and Dynamic Distributed Graph structure to allow the native distribution of Multi-Agent System simulations

Multi-Agent Systems (MAS) are naturally good candidates for large-scale parallel simulations. However, implementing MAS simulations for distributed memory architectures, such as High Performance Computing clusters, is still complex for non-experts. In this article we present the principle of a Dynamic Distributed Graph structure, that enables the native distribution of MAS simulations. Most of the distribution related issues such as dynamic load-balancing, time synchronization and data migration across processes can be completely automated and abstracted for the user, who can safely design distribution independent MAS models. The major interest of our contribution is the transparent management of concurrent read / write requests across distant processes, a significant feature not provided by surveyed platforms. We also present FPMAS, an open source C++ implementation of a Distributed Multi-Agent System Simulation platform based on the Distributed Graph structure.