Relaxing Synchronization in Parallel Agent-Based Road Traffic Simulation

Autor: Heiko Aydt, Daniel Zehe, Wentong Cai, Yadong Xu, Michael Lees
Přispěvatelé: Computational Science Lab (IVI, FNWI), IvI Research (FNWI)
Jazyk: angličtina
Rok vydání: 2017
Předmět:
Zdroj: ACM Transactions on Modeling and Computer Simulation, 27(2):14. Association for Computing Machinery (ACM)
ISSN: 1049-3301
Popis: Large-scale agent-based traffic simulation is computationally intensive. Parallel computing can help to speed up agent-based traffic simulation. Parallelization of agent-based traffic simulations is generally achieved by decomposing the road network into subregions. The agents in each subregion are executed by a Logical Process (LP). There are data dependencies between LPs which require synchronization of LPs. An asynchronous protocol allows LPs to progress and communicate asynchronously. LPs use lookahead to indicate the time to synchronize with other LPs. Larger lookahead means less frequent synchronization operations. High synchronization overhead is still a major performance issue of large-scale parallel agent-based traffic simulations. In this article, two methods to increase the lookahead of LPs for an asynchronous protocol are developed. They take advantage of uncertainties in traffic simulation to relax synchronization without altering simulation results statistically. Efficiency of the proposed methods is investigated in the parallel agent-based traffic simulator SEMSim Traffic. Experiment results showed that the proposed methods are able to reduce overall running time of the parallel simulation compared to existing methods.
Databáze: OpenAIRE