7-days of FREE Audio papers, translation & more with Prime
7-days of FREE Prime access
7-days of FREE Audio papers, translation & more with Prime
7-days of FREE Prime access
https://doi.org/10.5555/1162708.1162819
Copy DOIPublication Date: Dec 4, 2005 |
Citations: 2 |
Sequential discrete event simulation is widely employed to study the behavior of many systems. Events are typically managed in a central event list which is implemented as a priority queue ordered by event timestamps. Most research to improve sequential simulation performance has focused on improving the priority queue implementations. Recent work has demonstrated that asynchronous conservative parallel discrete event simulation systems can achieve better sequential performance under some conditions, but worse performance under other conditions. This paper introduces a new sequential discrete event simulation algorithm that can exhibit some of the same performance advantages of asynchronous conservative parallel discrete event simulation algorithms and has complexity no more than that of central event list algorithms in the worst case.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.