A Graph Partitioning Algorithm for Parallel Agent-Based Road Traffic Simulation

A common approach of parallelising an agent-based road traffic simulation is to partition the road network into sub-regions and assign computations for each subregion to a logical process (LP). Inter-process communication for synchronisation between the LPs is one of the major factors that affect the performance of parallel agent-based road traffic simulation in a distributed memory environment. Synchronisation overhead, i.e., the number of messages and the communication data volume exchanged between LPs, is heavily dependent on the employed road network partitioning algorithm. In this paper, we propose Neighbour-Restricting Graph-Growing (NRGG), a partitioning algorithm which tries to reduce the required communication between LPs by minimising the number of neighbouring partitions. Based on a road traffic simulation of the city of Singapore, we show that our method not only outperforms graph partitioning methods such as METIS and Buffoon, for the synchronisation protocol used, but also is more resilient than stripe spatial partitioning when partitions are cut more ?nely.

[1]  N. Metropolis,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2017 .

[2]  Vipin Kumar,et al.  Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes , 2001, IEEE Trans. Parallel Distributed Syst..

[3]  Shahid H. Bokhari,et al.  A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.

[4]  Michael Lees,et al.  An Asynchronous Synchronization Strategy for Parallel Large-scale Agent-based Traffic Simulations , 2015, SIGSIM-PADS.

[5]  Yoshiki Yamagata,et al.  Large-scale traffic simualtion for Low-Carbon City , 2012, Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC).

[6]  Michael Lees,et al.  Efficient graph-based dynamic load-balancing for parallel large-scale agent-based traffic simulation , 2014, Proceedings of the Winter Simulation Conference 2014.

[7]  Andrew V. Goldberg,et al.  Graph Partitioning with Natural Cuts , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[8]  Toyotaro Suzumura,et al.  Highly Scalable X10-Based Agent Simulation Platform and Its Application to Large-Scale Traffic Simulation , 2012, 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications.

[9]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[10]  Sajal K. Das,et al.  Dynamic load balancing strategies for conservative parallel simulations , 1997, Workshop on Parallel and Distributed Simulation.

[11]  Der-Horng Lee,et al.  A Framework for Parallel Traffic Simulation Using Multiple Instancing of a Simulation Program , 2002, J. Intell. Transp. Syst..

[12]  Xinxin Sun,et al.  An improved road network partition algorithm for parallel microscopic traffic simulation , 2010, 2010 International Conference on Mechanic Automation and Control Engineering.

[13]  Michael Lees,et al.  SEMSim: A Distributed Architecture for Multi-scale Traffic Simulation , 2012, 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation.

[14]  Kai Nagel,et al.  Parallel implementation of the TRANSIMS micro-simulation , 2001, Parallel Comput..

[15]  P. G. Gipps,et al.  A MODEL FOR THE STRUCTURE OF LANE-CHANGING DECISIONS , 1986 .

[16]  R. Jayakrishnan,et al.  A distributed, scalable, and synchronized framework for large-scale microscopic traffic simulation , 2005, Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005..

[17]  Helbing,et al.  Congested traffic states in empirical observations and microscopic simulations , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[18]  Marco Fiore,et al.  Large-scale urban vehicular mobility for networking research , 2011, 2011 IEEE Vehicular Networking Conference (VNC).

[19]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[20]  Richard M. Fujimoto,et al.  Parallel and Distribution Simulation Systems , 1999 .

[21]  Tamara G. Kolda,et al.  Graph partitioning models for parallel computing , 2000, Parallel Comput..

[22]  Peter Sanders,et al.  Distributed Evolutionary Graph Partitioning , 2011, ALENEX.

[23]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[24]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[25]  P. G. Gipps,et al.  A behavioural car-following model for computer simulation , 1981 .

[26]  Tomas Potuzak.  Distributed/Parallel Genetic Algorithm for Road Traffic Network Division Using a Hybrid Island Model/Step Parallelization Approach , 2016, 2016 IEEE/ACM 20th International Symposium on Distributed Simulation and Real Time Applications (DS-RT).

[27]  R.M. Fujimoto,et al.  Parallel and distributed simulation systems , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[28]  Dirk Helbing,et al.  General Lane-Changing Model MOBIL for Car-Following Models , 2007 .