By Topic

An asynchronous distributed discrete event simulation algorithm for cyclic circuits using a data-flow network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Ghosh ; Div. of Eng., Brown Univ., Providence, RI ; E. Debenedictis

The authors propose a mathematically proven algorithm for asynchronous, distributed, discrete-event simulation of circuits containing feedback loops. Every component of the circuit is represented through an executable model and the flow of information is expressed through message communication. Simulation time is encapsulated in the model description and encoded in the messages. A data-flow network is synthesized based on the connectivity of the components in the circuit that computes a quantity time of next event for every component. This quantity permits the corresponding model to execute asynchronously as far ahead in simulation time as possible and yet guarantees correctness. The network ensures that any simulation process executing on a distributed processing environment that has sufficient information to simulate can execute while also avoiding deadlock. The algorithm has been verified through an implementation on loosely coupled parallel processor

Published in:

Systems, Man, and Cybernetics, 1991. 'Decision Aiding for Complex Systems, Conference Proceedings., 1991 IEEE International Conference on

Date of Conference:

13-16 Oct 1991