By Topic

On the proof of correctness of “Yet another asynchronous distributed discrete event simulation algorithm (YADDES)”

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

1 Author(s)
S. Ghosh ; Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA

The discipline of discrete event simulation may be utilized to model many physical systems such as digital hardware, queueing networks, telephone networks, simulated warfare, and banking transactions. Where the entities of a physical system execute independently and interact asynchronously, an asynchronous distributed event-driven simulation algorithm may enable the simulation of the system to execute on a parallel processor. This has the potential to significantly reduce the total simulation time. YADDES is the first algorithm that is characterized by: (1) acceptable performance, (2) freedom from deadlock, and (3) probably correct, for circuits where the interactions between the entities constitute a cyclic dependence. Given their complex, asynchronous nature, an important issue associated with all asynchronous distributed algorithms is their correctness, i.e., the generation of accurate output for given input stimulus, under all possible conditions. This paper presents a mathematical proof of correctness and reports the performance of YADDES on the Armstrong parallel processor at Brown University

Published in:

IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans  (Volume:26 ,  Issue: 1 )