Search

The paper considers the implementation of distributed discrete event simulation (DDES) using what has been commonly called the Misra approach, after one of the inventors of the approach. A major problem with DDES is that deadlock can occur. Therefore, DDES algorithms must either avoid deadlock in the first place, or detect the existence of deadlock when it does occur and eliminate the deadlock. Misra proposes the use of NULL messages as one way to circumvent the deadlock problem. However, the number of NULL messages can become quite large. Methods are presented for reducing the number of NULL messages through the prediction of channel times. A framework is presented on which the distributed discrete event simulation can be built for applications which can be decomposed into feedforward and feedback networks. [ABSTRACT FROM AUTHOR]