Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Analysis of parallel replicated simulations under a completion time constraint
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Algorithms for unboundedly parallel simulations
ACM Transactions on Computer Systems (TOCS)
Parallel simulation of real-time systems via the Standard Clock approach
Mathematics and Computers in Simulation
Determining initial states for time-parallel simulations
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy
Information Processing Letters
Parallel trace-driven cache simulation by time partitioning
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Parallel simulation by time segmentation: methodology and applications
WSC '96 Proceedings of the 28th conference on Winter simulation
Proceedings of the 29th conference on Winter simulation
Time segmentation parallel simulation of tandem queues with manufacturing blocking
Proceedings of the 30th conference on Winter simulation
Efficient distributed simulation of a communication switch with bursty sources and losses
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Perfect sampling for queues and network models
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Challenges and benefits of time-parallel simulation of wireless ad hoc networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Efficient parallel queuing system simulation
Proceedings of the 38th conference on Winter simulation
Time-parallel simulation of wireless ad hoc networks with compressed history
Journal of Parallel and Distributed Computing
Improving Time Parallel Simulation for Monotone Systems
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
Time-parallel simulation of wireless ad hoc networks
Wireless Networks
Monotone queuing networks and time parallel simulation
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
| Hi-index | 0.00 |
This article is concerned with the efficient simulation of communication systems on parallel processors. In most of the article, we assume that the communication system under study can be modeled as a system of finite exponential queues with a general topology (in particular, the system need not be acyclic) and with either loss or communication blocking. We also assume that to estimate the performance measures of interest, it is necessary to generate long sample paths of the system. This is the case in both steady-state simulations and in long transient simulations. The approach involves applying each processor to simulate the entire system for a part of the time horizon of interest. We present theory guaranteeing the validity of the proposed approach, and numerical results proving the viability of the approach. The proof of the validity of the approach uses the fact that the queueing systems considered are continuous time Markov chains. An essential part of the argument is a proof that sample paths starting from different initial states eventually will couple (i.e., become identical), and a simple method for recognizing the time when a sample path has become independent of the original starting state (i.e., when all sample paths have coupled, regardless of the initial state). Finally, we discuss how our approach can be used for parallel trace-driven simulations of certain nonMarkovian systems, and state the implications of this research for the initialization bias problem in steady-state simulation.