Cooperative acceleration
- 1 July 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSIM Simulation Digest
- Vol. 24 (1) , 58-64
- https://doi.org/10.1145/195291.182494
Abstract
Robustness of the simulation mechanism is a requirement for acceptability of distributed simulation environments. We consider complex and erratic distributed conservative simulations, using colliding pucks as a guiding example. A new mechanism is introduced which allows logical processes to cooperate locally and advance. Advance is made through the collective selection of the next event in a group of logical processes. The algorithm demonstrates scalability through the locality of its determination. A description and proof of correctness is given. The effectiveness of the cooperative acceleration mechanism is illustrated with measurements on road traffic and colliding pucks simulations.Keywords
This publication has 2 references indexed in Scilit:
- Asynchronous distributed simulation via a sequence of parallel computationsCommunications of the ACM, 1981
- Distributed Simulation: A Case Study in Design and Verification of Distributed ProgramsIEEE Transactions on Software Engineering, 1979