Abstract
Efficient event scheduling and synchronization constitutes an essential part of high-performance parallel discrete event simulation. Traditional synchronization approaches like conservative and optimistic synchronization focus on a simple scheduling paradigm based on a primitive set of rules. However, we argue that a sophisticated synchronization algorithm considering event interactions can remarkably improve the performance of the simulation. In this article, we discuss three different heuristics which analyze those dependencies online and speed up the simulation by a factor of up to 6.5. Further, we analyze the ability of this paradigm to automatically detect available parallelism by applying it to scenarios featuring different degrees of available parallelism.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: PIK - Praxis der Informationsverarbeitung und Kommunikation
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.
