Asynchronous distributed simulation via a sequence of parallel computations
Communications of the ACM - Special issue on simulation modeling and statistical computing
Distributed simulation with locality
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Synchronized data distribution management in distributed simulations
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Path lookahead: a data flow view of PDES models
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Performance Evaluation of Conservative Algorithms in Parallel Simulation Languages
IEEE Transactions on Parallel and Distributed Systems
Parallel shared-memory simulator performance for large ATM networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Channel based sequential simulation
WSC '05 Proceedings of the 37th conference on Winter simulation
| Hi-index | 0.00 |
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.