Abstract

Explores the performance of three synchronous discrete-event simulation algorithms: the global clock algorithm, the conservative lookahead algorithm, and speculative computation. We examine the effects of granularity and present empirical data to illustrate at what granularity the algorithm has reasonable performance. We also investigate two techniques for decreasing both synchronization and load imbalance. In addition, we examine how various execution platforms impact the performance of the simulation, providing empirical data from a network of workstations and a shared-memory multiprocessor. The impact of shared computational resources on simulation performance is also explored. The simulated system is a network of queues connected in a torus topology. >

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 call

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.