Distributed discrete-event simulation
- 1 March 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 18 (1) , 39-65
- https://doi.org/10.1145/6462.6485
Abstract
Traditional discrete-event simulations employ an inherently sequential algorithm. In practice, simulations of large systems are limited by this sequentiality, because only a modest number of events can be simulated. Distributed discrete-event simulation (carried out on a network of processors with asynchronous message-communicating capabilities) is proposed as an alternative; it may provide better performance by partitioning the simulation among the component processors. The basic distributed simulation scheme, which uses time encoding, is described. Its major shortcoming is a possibility of deadlock. Several techniques for deadlock avoidance and deadlock detection are suggested. The focus of this work is on the theory of distributed discrete-event simulation.Keywords
This publication has 6 references indexed in Scilit:
- A Message-Based Approach to Discrete-Event SimulationIEEE Transactions on Software Engineering, 1987
- Virtual timeACM Transactions on Programming Languages and Systems, 1985
- Distributed deadlock detectionACM Transactions on Computer Systems, 1983
- A shared resource algorithm for distributed simulationACM SIGARCH Computer Architecture News, 1982
- 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