The Community for Technology Leaders
2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (2005)
Monterey, Californi
June 1, 2005 to June 3, 2005
ISSN: 1087-4097
ISBN: 0-7695-2383-8
pp: 217-226
Rob Simmonds , University of Calgary
Cameron Kiddle , University of Calgary
Brian Unger , University of Calgary
Roger Curry , University of Calgary
<p>The widespread use of sequential simulation in large scale parameter studies means that large cost savings can be made by improving the performance of these simulators. Sequential discrete event simulation systems usually employ a central event list to manage future events. This is a priority queue ordered by event timestamps. Many different priority queue algorithms have been developed with the aim of improving simulator performance.</p> <p>Researchers developing asynchronous conservative parallel discrete event simulations have reported exceptional performance for their systems running sequentially in certain cases. This paper compares the performance of simulations using a selection of high performance central event list implementations to that achieved using techniques borrowed from the parallel simulation community. Theoretical and empirical analysis of the algorithms is presented demonstrating the range of performance that can be achieved, and the benefits of employing parallel simulation techniques in a sequential execution environment.</p>
Sequential Discrete Event Simulation, Parallel Discrete Event Simulation, Conservative Synchronization
Rob Simmonds, Cameron Kiddle, Brian Unger, Roger Curry, "Sequential Performance of Asynchronous Conservative PDES Algorithms", 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, vol. 00, no. , pp. 217-226, 2005, doi:10.1109/PADS.2005.25
202 ms
(Ver 3.3 (11022016))