A novel algorithm for discrete-event simulation: asynchronous distributed discrete-event simulation algorithm for cyclic circuits using a dataflow network
- 1 June 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 24 (6) , 21-33
- https://doi.org/10.1109/2.86834
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.Keywords
This publication has 7 references indexed in Scilit:
- A global feedback detection algorithm for VLSI circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An asynchronous distributed approach for the simulation of behavior-level models on parallel processorsIEEE Transactions on Parallel and Distributed Systems, 1995
- System and application software for the Armstrong multiprocessorComputer, 1988
- Distributed discrete-event simulationACM Computing Surveys, 1986
- Virtual timeACM Transactions on Programming Languages and Systems, 1985
- Distributed deadlock detectionACM Transactions on Computer Systems, 1983
- Asynchronous distributed simulation via a sequence of parallel computationsCommunications of the ACM, 1981