Asynchronous distributed simulation via a sequence of parallel computations
An approach to carrying out asynchronous, distributed simulation on multiprocessor message-passing architectures is presented. This scheme differs from other distributed simulation schemes because (1) the amount of memory required by all processors together is bounded and is no more than the amount required in sequential simulation and (2) the multiprocessor network is allowed to deadlock, the deadlock is detected, and then the deadlock is broken. Proofs for the correctness of this approach are outlined.
© 1981 ACM. Received 2/80; revised 9/80; accepted 12/80. This work is partially supported by NSF grants MCS77-09812 and MCS 79-25383 and AFOSR 77-3409.