3.1 MB - Evernote

More documents

Recommendations

Info

Simulation Controller Model Parser GVT Calculation Reporting Figure 11: Architecture overview 41 Implementation Logical Process State List Simulation Engine Transaction Chain Model Partition LPCC State Cluster Space Each Logical Process implements an LP according to the Shock Resistant Time Warp algorithm. The main component of the Logical Process is the Simulation Engine, which contains the Transaction chain and the model partition that is simulated. The Simulation Engine is the part that is performing the actual simulation. It is moving the Transactions from block to block by executing the block functionality using the Transactions. Another important part of the Logical Process is the State List. It contains historic simulation states in order to allow rollbacks as required by optimistic synchronisation algorithms. Note that there will be other lists like for instance the list of Transactions received and the list of Transactions sent to other Logical Processes, which are not shown in Figure 11. Furthermore the Logical Process will contain the Logical Process Control Component (LPCC) according to the Shock Resistant Time Warp algorithm described in 4.2.3. Using specific sensors within the Logical Process the LPCC will limit the optimism by the means of an artificial memory limit if this promises a better simulation performance at the current circumstances. The Simulation Controller will perform GVT calculations in order to establish the overall progress of the simulation and if requested by one of the Logical Processes that needs to reclaim memory using fossil collection. GVT calculation will also be used to
42 Implementation confirm a provisional simulation end state that might be reached by one of the Logical Processes. When the end of the simulation is reached then the Simulation Controller will ensure that the partial models in all Logical Processes are set to the correct and consistent end state and it will collect information from all Logical Processes in order to assemble and output the post simulation report. 5.1.2 Transaction Chain and Scheduling Thomas J. Schriber gives an overview in section 4. and 7. of [26] on how the Transaction chains and the scheduling work in the original GPSS/H implementation. The scheduling and the Transaction chains for the parallel transaction-oriented simulator of this work will be based on his description but with some significant differences. Only one Transaction chain is used containing Transactions for current and future simulation time in a sorted order. The Transactions within the chain are first sorted ascending by their next moving time and Transactions for the same time are also sorted descending by their priority. Transactions will be taken out of the chain before they are moved and put back into the chain after they have been moved (unless the Transaction has been terminated). The functionality to put a Transaction back into the chain will do so at the right position ensuring the correct sort order of the Transactions within the chain. The scheduling will be slightly simpler than described in [26] because no “Model’s Status changed flag” will be needed. Another difference is that in order to keep the time management as simple as possible the proposed parallel simulator will restrict the simulation time and time related parameters to integer values instead of floating point values. At first this might seem like a major restriction but it is not because decimal places can be represented using scaling. If for instance a simulation time with three decimal places is needed for a simulation then a scale of 1000:1 can be used, which means 1000 time units of the parallel simulator represent one second of simulation time or a single time unit represents 1ms. The Java integer type long will be used for time values providing a large value range that allows flexible scaling for different required precisions. The actual scheduling will be implemented using a SimulationEngine class. This class will for instance contain the functionality for moving Transactions, updating the
Page 1 and 2: TRANSACTION-ORIENTED SIMULATION IN
Page 3 and 4: Table of Content II Table of Conten
Page 5 and 6: IV Table of Content 6 VALIDATION OF
Page 7 and 8: Figures VI Figures Figure 1: Ad Hoc
Page 9 and 10: Tables VIII Tables Table 1: Change
Page 11 and 12: 2 Introduction synchronisation algo
Page 13 and 14: 2 Fundamental Concepts Fundamental
Page 15 and 16: Figure 1: Ad Hoc Grid architecture
Page 17 and 18: 8 Fundamental Concepts In continuou
Page 19 and 20: 10 Fundamental Concepts Two other a
Page 21 and 22: 12 Fundamental Concepts known as st
Page 23 and 24: 14 Fundamental Concepts event execu
Page 25 and 26: 3 Ad Hoc Grid Aspects 16 Ad Hoc Gri
Page 27 and 28: 18 Ad Hoc Grid Aspects resources an
Page 29 and 30: 20 Ad Hoc Grid Aspects means that a
Page 31 and 32: Parallel Transaction-oriented Simul
Page 33 and 34: 24 Parallel Transaction-oriented Si
Page 35 and 36: 4.2 Synchronisation algorithm 26 Pa
Page 49: 5 Implementation 40 Implementation
Page 53 and 54: 44 Implementation large numerical p
Page 55 and 56: 46 Implementation A detailed descri
Page 57 and 58: 48 Implementation But in a parallel
Page 59 and 60: 50 Implementation GPSS test models
Page 61 and 62: Simulation Controller side 52 Imple
Page 63 and 64: 54 Implementation technique describ
Page 65 and 66: Implementation Euclidean distance b
Page 67 and 68: 58 Implementation chain at the corr
Page 69 and 70: 60 Implementation The algorithm wil
Page 71 and 72: No Start Is Active Object body acti
Page 73 and 74: 5.3.2 GVT Calculation and End of Si
Page 75 and 76: 66 Implementation provisional simul
Page 77 and 78: Implementation relatively basic per
Page 79 and 80: 70 Implementation log4j.logger.para
Page 81 and 82: proactive-log4j 72 Implementation T
Page 83 and 84: 74 Implementation Memory Allocation
Page 85 and 86: 76 Validation of the Parallel Simul
Page 93 and 94: 6.4 Validation 4 84 Validation of t
Page 97 and 98: … LpccEnabled=true LpccClusterNum
Page 99 and 100: Validation 5.2 Validation of the Pa
Page 101 and 102:
92 Validation of the Parallel Simul
Page 103 and 104:
94 Validation of the Parallel Simul
Page 105 and 106:
7 Conclusions 96 Conclusions Even s
Page 107 and 108:
References 98 References [1] Amin K
Page 109 and 110:
[19] Krafft G. Parallelisation of T
Page 111 and 112:
Appendix A: Detailed GPSS Syntax 10
Page 113 and 114:
Reserved word: DEPART Syntax: [] DE
Page 115 and 116:
Reserved word: SEIZE Syntax: [] SEI
Page 117 and 118:
Setting: LpccClusterNumber Default
Page 119 and 120:
Appendix C: Simulator log4j loggers
Page 121 and 122:
Logger: parallelJavaGpssSimulator.l
Page 123 and 124:
114 Appendix D: Structure of the at
Page 125 and 126:
Appendix E: Documentation of select
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
!"#"$$%$&"'"(!))*+,-$"./#0$! 1$"))
Page 133 and 134:
Page 135 and 136:
!/+/.7/8$ Appendix E: Documentation
Page 137 and 138:
Returns: Appendix E: Documentation
Page 139 and 140:
!"#$%&''$()*)")$ +',)$-)$. #,/. !"#
Page 141 and 142:
!"#$%&'()#%*+,"-*.# Appendix E: Doc
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Constructor Detail !"#$%&'$(#$)*$%+
Page 155 and 156:
Page 157 and 158:
Validation 1.1, output of simulate:
Page 159 and 160:
Validation 2, output of LP: Appendi
Page 161 and 162:
Appendix F: Validation output logs
Page 163 and 164:
Validation 2, output of simulate: A
Page 165 and 166:
Validation 3.1, output of LP1: Appe
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Validation 4, output of LP1: Append
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
simulation for time 2000) (628) 20:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Validation 4, output of simulate: A
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
(135) 19:37:56,477 Total transactio
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
(68) 19:37:56,619 by the transactio
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
(1295) 14:25:22,740 Simulation stop
Page 229 and 230:
Page 231 and 232:
Page 233 and 234:
Page 235 and 236:
Page 237 and 238:
(68) 14:25:22,888 by the transactio
Page 239 and 240:
Validation 6.2, output of LP2: (1)
Page 241:
(32) (1,2) 0 765 Block: TRANSFER 0.
show all

3.1 MB - Evernote

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?