LARGE-SCALE PARALLEL GRAPH-BASED SIMULATIONS - MATSim

More documents

Recommendations

Info

7.15 Summary figures for the single PS case . . . . . . . . . . . . . . . . . . . . . 119 7.16 Linear scale version of summary figures . . . . . . . . . . . . . . . . . . . . . 119 8.1 Round-trip travel times for different sizes of messages . . . . . . . . . . . . . . 124 ix
List of Tables 3.1 Performance results for reading different types of plans file and approaches . . 31 3.2 Performance results for reading the graph data . . . . . . . . . . . . . . . . . . 33 3.3 Performance results for writing the events file . . . . . . . . . . . . . . . . . . 34 3.4 Summary table of the serial performance results for different data structures of the traffic flow simulator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 4.1 Summary table of the parallel performance results for different data structures of the traffic flow simulator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 5.1 Performance results for reading the events file . . . . . . . . . . . . . . . . . . 67 6.1 Performance prediction table for buffered events . . . . . . . . . . . . . . . . . 84 6.2 Performance results for ERs writing the events file . . . . . . . . . . . . . . . 94 6.3 Summary table of the performance results of events transfered between TSs and ERs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103 7.1 Summary table of the performance results of plans transfered between TSs and PSs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 x
Page 1 and 2: DISS. ETH NO. LARGE-SCALE PARALLEL
Page 3 and 4: Zusammenfassung Für das Modelliere
Page 5 and 6: Contents Abstract Zusammenfassung A
Page 7 and 8: 6.9 Results of the Buffered Events
Page 9: 4.10 Packing vehicle data with MPI
Page 13 and 14: The strategical world: Concepts whi
Page 15 and 16: queues, on the other hand, does not
Page 17 and 18: Handling Constraints - Original alg
Page 19 and 20: node spatial queue buffer acc to ca
Page 21 and 22: Algorithm-3 for Vehicle Movement th
Page 23 and 24: - network - nodes - - - node i d =
Page 25 and 26: ) ¥ § ¡ £ ) ¥ ) ¥ ) ¡ £
Page 27 and 28: has the attributes such as type, le
Page 29 and 30: 3.2 The Benchmark The traffic flow
Page 31 and 32: make ‘ ‘ Nodes ’ ’ a c o n
Page 33 and 34: ¡ ¥ ¥ t y p e d e f v e c t o r
Page 35 and 36: 1024 RTR, Diff. Data Str. for Graph
Page 37 and 38: 1024 RTR, Diff. Data Str. for Parki
Page 39 and 40: push_back(O1) push_back(02) head =
Page 41 and 42: The sequence of attributes is not i
Page 43 and 44: ¡ ¡ ¡ c l a s s Plan / / data s
Page 45 and 46: Writing Time Explanation Raw Local
Page 47 and 48: RunTime Graph Data Parking-Waiting
Page 49 and 50: depends on the dimensions (single o
Page 51 and 52: 4.2 Parallel Computing in Transport
Page 53 and 54: 350000 300000 250000 200000 150000
Page 55 and 56: ¢¡ ¥ ¡ * 6 §¡ ¥ ¢¡ ¥ 8
Page 57 and 58: ¥¦¨§ ¡¦©§ §¡ ¥ *
Page 59 and 60: 4.5 Experimental Results The parall
Page 61 and 62:
¡ ¥ ¡ If the simulation time s
Page 63 and 64:
a long i n t e g e r f o r v e h i
Page 65 and 66:
¡ / / d e f i n e a s t r u c t co
Page 67 and 68:
1024 512 256 RTR for a 3-hour run o
Page 69 and 70:
In Section 4.1.2, task parallelizat
Page 71 and 72:
Chapter 5 Coupling the Traffic Simu
Page 73 and 74:
100% Initial Plans File Activity Ge
Page 75 and 76:
¡ ¡ ¡ p f map- - ; / / d e f i n
Page 77 and 78:
¡ char myline [MAXSIZE ] ; while (
Page 79 and 80:
5.3 Other Coupling Mechanisms Coupl
Page 81 and 82:
pieces of code. For instance, a com
Page 83 and 84:
5.3.5 Module Coupling via Messages
Page 85 and 86:
Chapter 6 Events Recorder 6.1 Intro
Page 87 and 88:
A2 are collected by the other ER. S
Page 89 and 90:
& $ ¡ & $ ¡ 3. TSs
Page 91 and 92:
Algorithm A - Traffic Simulator Rep
Page 93 and 94:
¡ 6 ) © £ ¡ © ¤ ¡ 6 ) © (
Page 95 and 96:
and ¤¢¤ ¢ ¡ ¢ ¡ ¡ ¢ ¡
Page 97 and 98:
256 64 Packing Only, Raw Events mem
Page 99 and 100:
£ ¥ Time in Secs 256 64 16 4 Send
Page 101 and 102:
Multicast Sending Only, Raw Events,
Page 103 and 104:
Time in Secs 256 64 16 4 1 Effectiv
Page 105 and 106:
¢ Writing Time Explanation Raw XML
Page 107 and 108:
700 600 500 TS-p TS-s ER-er ER-u ER
Page 109 and 110:
¡ ¡ ¦ ¦ © ¡ c r e a t e a C
Page 111 and 112:
i n t i n t e g e r i t e m ; doubl
Page 113 and 114:
When the events are reported to str
Page 115 and 116:
Chapter 7 Plans Server 7.1 Introduc
Page 117 and 118:
Algorithm A - Plans Server while no
Page 119 and 120:
i n t i n t e g e r i t e m ; doubl
Page 121 and 122:
) ) ) £ ¡ © §¦ ©¨ ¡ £ ¡
Page 123 and 124:
) © ¨ ¡ ¡ $ ¢ ¡ ¡ * ¢ $
Page 125 and 126:
For PSs, Send Only (IDs & StartLink
Page 127 and 128:
For TSs, Effective Receive + Unpack
Page 129 and 130:
64 32 16 8 4 2 1 0.5 0.25 For PSs,
Page 131 and 132:
Time nPSs nTSs OP Note 1.87s 1 1 pa
Page 133 and 134:
£ ¡ ¡ § ¤¡2 ) © ¡ ( ¡
Page 135 and 136:
100 Round Trip Travel Time 10 1 0.1
Page 137 and 138:
observe the Internet packet traffic
Page 139 and 140:
A probably better way to reduce the
Page 141 and 142:
[14] Berksekas D. and R. Gallager.
Page 143 and 144:
[51] MPI www page. www-unix.mcs.anl
Page 145 and 146:
[87] W. Willinger W.E. Leland, M. T
Page 147:
Large-scale multi-agent transportat
show all

LARGE-SCALE PARALLEL GRAPH-BASED SIMULATIONS - MATSim

Create successful ePaper yourself

Delete template?

Save as template?