Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/performance-bounds-on-parallel-self-initiating-discrete-event-0sXP7GM50S
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1991 by ACM Inc.
- ISSN
- 1049-3301
- DOI
- 10.1145/102810.102812
- Publisher site
- See Article on Publisher Site
Abstract
This paper considers the use of massively parallel architectures to execute discrete-event simulations of what we term “self-initiating” models. A logical process in a self-initiating model schedules its own state reevaluation times, independently of any other logical process, and sends its new state to other logical processes following the reevaluation. Our interest is in the effects of that communication on synchronization. Using a model that idealizes the communication topology of a simulation, we consider the performance of various synchronization protocols by deriving upper and lower bounds on optimal performance, upper bounds on Time Warp's performance, and lower bounds on the performance of a new consevative protocol. Our analysis of Time Warp includes some of the overhead costs of state saving and rollback; the effects of propogating rollbacks are ignored. The analysis points out sufficient conditions for the conservitive protocol to outperform Time Warp. The analysis also quantifies the sensitivity of performance to message fanout, lookahead ability, and the probability distributions underlying the simulation.
Journal
ACM Transactions on Modeling and Computer Simulation (TOMACS) – Association for Computing Machinery
Published: Jan 3, 1991