Runtime optimisation approaches for a real-time evacuation assistant

Authors:
Armel Ulrich Kemloh Wagoum;Bernhard Steffen;Armin Seyfried
Affiliations:
Jülich Supercomputing Centre, Forschungszentrum Jülich GmbH, Jülich, Germany;Jülich Supercomputing Centre, Forschungszentrum Jülich GmbH, Jülich, Germany;Jülich Supercomputing Centre, Forschungszentrum Jülich GmbH, Jülich, Germany
Venue:
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Year:
2011

Citing 8
Cited 0

Computer simulation of liquids

Computer simulation of liquids
Protein calculations on parallel processors. II: Parallel algorithm for the forces and molecular dynamics

Journal of Computational Chemistry
Dynamic Domain Decomposition and Load Balancing for Parallel Simulations of Long-Chained Molecules

PARA '95 Proceedings of the Second International Workshop on Applied Parallel Computing, Computations in Physics, Chemistry and Engineering Science
A quadtree approach to domain decomposition for spatial interpolation in grid computing environments

Parallel Computing - Special issue: High performance computing with geographical data
Real-time navigating crowds: scalable simulation and rendering: Research Articles

Computer Animation and Virtual Worlds - CASA 2006
Big fast crowds on PS3

Proceedings of the 2006 ACM SIGGRAPH symposium on Videogames
Numerical Simulation in Molecular Dynamics: Numerics, Algorithms, Parallelization, Applications

Numerical Simulation in Molecular Dynamics: Numerics, Algorithms, Parallelization, Applications
The Scalasca performance toolset architecture

Concurrency and Computation: Practice & Experience - Scalable Tools for High-End Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents runtime optimisation approaches for a real-time evacuation assistant. The pedestrian model used for the forecast is a modification of the centrifugal force model which operates in continuous space. It is combined with an event driven route choice algorithm which encompasses the local shortest path, the global shortest path and a combination with the quickest path. A naive implementation of this model has the complexity of O(N2), N being the number of pedestrians. In the first step of the optimisation the complexity is reduced to O(N) using special neighbourhood lists like Verlet-List or Linked-Cell commonly used in molecular dynamics. The next step in this optimisation process is parallelisation on a multicore system. The Message Passing Interface (MPI) and Open Multi-Processing (OpenMP) application programming interfaces are used to this extend. The simulation is performed on the Juropa cluster installed at the Jülich Supercomputing Centre. The speedup factors obtained are ˜10 for the linked-cells, ˜4 for 8 threads and ˜3 for the parallelisation on 5 nodes using a static domain decomposition.