Uniformization and hybrid simulation/analytic models of renewal processes
Operations Research
Parallel simulation of queueing networks: limitations and potentials
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Optimistic parallel simulation of continuous time Markov chains using uniformization
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
A comparative study of parallel algorithms for simulating continuous time Markov chains
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Hybrid simulation models of computer systems
Communications of the ACM
Distributed Simulation of Petri Nets
IEEE Parallel & Distributed Technology: Systems & Technology
Conservative Parallel Simulation of Continuous Time Markov Chains Using Uniformization
IEEE Transactions on Parallel and Distributed Systems
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on modeling and analysis of stochastic systems
Unsynchronized parallel discrete event simulation
Proceedings of the 30th conference on Winter simulation
Split: a flexible and efficient algorithm to vector-descriptor product
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
| Hi-index | 0.00 |
A distributed algorithm is introduced for the analysis of large continuous time Markov chains (CTMCs) by combining in some sense numerical solution techniques and simulation. CTMCs are described as a set of processes communicating via message passing. The state of a process is described by a probability distribution over a set of reachable states rather than by a single state. Simulation is used to determine event times and messages types to be exchanged, whereas transitions are realized by vector matrix products as in iterative numerical analysis techniques. In this way, the state space explosion of numerical analysis is avoided, but it is still possible to determine more detailed results than with simulation. Parallelization of the algorithm is realized applying a conservative synchronization scheme, which exploits the possibility of precomputing event times as already proposed for parallel simulation of CTMCs. In contrast to a pure simulation approach, the amount of computation is increased, whereas the amount of communication keeps constant. Hence it is possible to achieve even on a workstation cluster a significant speedup.