The Community for Technology Leaders
Green Image
<p>With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. We present a set of shared memory experiments using the Chandy-Misra distributed simulation algorithm to simulate networks of queues. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors.</p>
Chandy-Misra algorithm, deadlock recovery, discrete event simulation, distributed simulation, parallel processing.
A.D. Maloney, B.D. McCredie, D.A. Reed, "Parallel Discrete Event Simulation Using Shared Memory", IEEE Transactions on Software Engineering, vol. 14, no. , pp. 541-553, April 1988, doi:10.1109/32.4677
89 ms
(Ver 3.3 (11022016))