Name
Abstract | ||
|---|---|---|
In this paper we present a time parallel simulation approach and discuss conditions under which this approach is applicable. Our approach involves distributing the available processors among segments of the time horizon of the simulation. We show that under certain conditions, sample paths of the system generated by a common sequence of potential events will couple (i.e., become identical) with probability one. This property will be exploited to efficiently combine the information collected on different segments of the sample path and generate a complete valid sample path. We show that the expected coupling time of the system (i.e., the amount of time required for all the sample paths of the system to couple) is essential to the efficiency of the approach. We apply our parallel simulation approach to a class of Markovian queueing networks and investigate the efficiency of the method by providing bounds and estimates for the expected coupling times. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1145/256562.256659 | Winter Simulation Conference |
Keywords | Field | DocType |
time parallel simulation approach,complete valid sample path,markovian queueing network,time segmentation,time horizon,sample path,available processor,certain condition,parallel simulation approach,expected coupling time,common sequence,computational modeling,concurrent computing,context modeling,discrete event simulation,industrial engineering,computer networks | Time horizon,Markov process,Simulation,Computer science,Discrete event dynamic system,Queueing theory,Concurrent computing,Simulation language,Discrete system,Discrete event simulation | Conference |
ISBN | Citations | PageRank |
0-7803-3383-7 | 6 | 0.57 |
References | Authors | |
8 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mehdi Hoseyni-Nasab | 1 | 13 | 1.51 |
| Sigrún Andradóttir | 2 | 548 | 55.09 |