1. A novel algorithm for discrete-event simulation: asynchronous distributed discrete-event simulation algorithm for cyclic circuits using a dataflow network
- Author
-
E. DeBenedictis, S. Ghosh, and M.-L. Yu
- Subjects
Brooks–Iyengar algorithm ,Correctness ,General Computer Science ,Dataflow ,Computer science ,Distributed computing ,Edge chasing ,Deadlock ,Network traffic simulation ,Asynchronous communication ,Distributed algorithm ,Cycle graph ,Discrete event simulation ,Algorithm - Abstract
Distributed simulation of circuits in which the process interactions form a cyclic graph is addressed. The method described uses a dataflow network synthesized on the basis of the connectivity of the circuit components. The algorithm, called Yaddes (which stands for yet another asynchronous distributed discrete-event simulation algorithm), computes for each component a quantity time of next event, which permits the corresponding model to execute asynchronously as far ahead in simulation time as possible. The network ensures that a simulation process executing in a distributed processing environment will not deadlock. The algorithm, which also offers acceptable performance and provable correctness, is compared with the two other principal algorithms proposed to avoid deadlocks: the deadlock recovery algorithm and the exception-mode algorithm. Performance results for Yaddes are presented. >
- Published
- 1991
- Full Text
- View/download PDF