LARGE-SCALE PARALLEL GRAPH-BASED SIMULATIONS - MATSim

List of Figures
1.1 Physical and strategic layers of a traffic simulation system . . . . . . . . . . . 2
2.1 The Gawron’s queue model . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.2 Simplifying the intersection logic . . . . . . . . . . . . . . . . . . . . . . . . . 8
2.3 Pseudo code for traffic dynamics defined in the queue model . . . . . . . . . . 9
2.4 Test suite results for the intersection dynamics . . . . . . . . . . . . . . . . . . 9
2.5 Handling intersections according to the modified version of fair intersections
algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.6 Handling intersections according to Metropolis sampling . . . . . . . . . . . . 10
2.7 Handling intersections according to the modified Metropolis sampling . . . . . 11
2.8 An example of the graph data in the XML format . . . . . . . . . . . . . . . . 12
2.9 An example for the plans data in the XML format . . . . . . . . . . . . . . . . 13
2.10 An example for the events data in the XML format . . . . . . . . . . . . . . . 14
3.1 STL-containers for the graph data . . . . . . . . . . . . . . . . . . . . . . . . 20
3.2 The STL-map for the graph data . . . . . . . . . . . . . . . . . . . . . . . . . 21
3.3 Insertion in the middle of an STL-vector by insert(position,object) 21
3.4 The STL-vector for the graph data . . . . . . . . . . . . . . . . . . . . . . 22
3.5 Linear search for the graph data . . . . . . . . . . . . . . . . . . . . . . . . . 22
3.6 Sorting the graph data stored in an STL-vector . . . . . . . . . . . . . . . . 23
3.7 RTR and Speedup for using different data structures for the graph data . . . . . 24
3.8 Declarations for waiting and parking queues with the STL-multimap . . . . 25
3.9 Declarations for waiting and parking queues with linked lists . . . . . . . . . . 25
3.10 RTR and Speedup for using different data structures for waiting and parking
queues . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
3.11 Ring Structure: Insertion at the end, Deletion from the beginning . . . . . . . . 28
3.12 RTR and Speedup for using different data structures for the spatial queues and
the buffers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
3.13 Reading plans from a structured text file, by using an STL-vector . . . . . . 32
3.14 Reading plans from a structured text file, by using fscanf . . . . . . . . . . . 33
4.1 Handling the boundaries and split links . . . . . . . . . . . . . . . . . . . . . . 41
4.2 Domain decomposition by METIS for Switzerland . . . . . . . . . . . . . . . 42
4.3 Pseudo code for parallel implementation of queue model . . . . . . . . . . . . 43
4.4 Calculation of neighbors of computing nodes . . . . . . . . . . . . . . . . . . 47
4.5 RTR and Speedup curves for Parallel Queue Model . . . . . . . . . . . . . . . 49
4.6 RTR and Speedup graphs for PVM and MPI comparison . . . . . . . . . . . . 51
4.7 The data of a vehicle to be packed . . . . . . . . . . . . . . . . . . . . . . . . 52
4.8 Packing vehicle data with memcpy . . . . . . . . . . . . . . . . . . . . . . . . 53
4.9 Packing vehicle data with MPI Pack . . . . . . . . . . . . . . . . . . . . . . 53
vii