A Novel Algorithm for Discrete-Event Simulation: Asynchronous Distributed Discrete-Event Simulation Algorithm for Cyclic Circuits Using a Dataflow Network

Authors:
Erik DeBenedictis;Sumit Ghosh;Meng-Lin Yu
Affiliations:
-;-;-
Venue:
Computer
Year:
1991

Citing 6
Cited 13

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed discrete-event simulation

ACM Computing Surveys (CSUR)
System and Application Software for the Armstrong Multiprocessor

Computer
Distributed deadlock detection

ACM Transactions on Computer Systems (TOCS)
Asynchronous distributed simulation via a sequence of parallel computations

Communications of the ACM - Special issue on simulation modeling and statistical computing
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

State of the art in parallel simulation

WSC '92 Proceedings of the 24th conference on Winter simulation
Asynchronous, distributed event driven simulation algorithm for execution of VHDL on parallel processors

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Symphony: a simulation backplane for parallel mixed-mode co-simulation of VLSI systems

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Parallel and distributed discrete event simulation: algorithms and applications

WSC '93 Proceedings of the 25th conference on Winter simulation
En route to more efficient conservative parallel event simulation

ANSS '92 Proceedings of the 25th annual symposium on Simulation
P2EDAS: Asynchronous, Distributed Event Driven Simulation Algorithm with Inconsistent Event Preemption for Accurate Execution of VHDL Descriptions on Parallel Processors

IEEE Transactions on Computers
The Role of Modeling and Asynchronous Distributed Simulation in Analyzing Complex Systems of the Future

Information Systems Frontiers
International Payments Processing in Real Time: A Distributed Architecture

IEEE Computational Science & Engineering
Simulating Asynchronous, Decentralized Military Command and Control

IEEE Computational Science & Engineering
Exploiting temporal independence in distributed preemptive circuit simulation

EDTC '97 Proceedings of the 1997 European conference on Design and Test
Triggering Creativity in Science and Engineering: Reflection as a Catalyst

Journal of Intelligent and Robotic Systems
Conservative DEVS: a novel protocol for parallel conservative simulation of DEVS and cell-DEVS models

SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Conservative vs. optimistic parallel simulation of DEVS and Cell-DEVS: a comparative study

Proceedings of the 2010 Summer Computer Simulation Conference

Quantified Score

Hi-index	4.10

Visualization

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.