Performance Model for a Conservative Distributed Simulation Environment Using Null Messages to Avoid Deadlock

Date Added: Apr 2010
Format: PDF

A conservative distributed simulation requires all Logical Processes (LPs) to follow the causality constraint requirement. This implies that all event-messages are processed in strictly timestamp order. Apart from the timestamp of each event generated by LPs, synchronization between all LPs is the second most important requirements. Finally, there must not be a deadlock in the distributed environment. A deadlock may occur when there is no events present in the queue of LP. In such case, to avoid deadlock, Chandy-Misra-Bryant presented an algorithm called Null Message Algorithm (NMA). These null messages are passed as an event-message to other LPs and it stored in one of queues of LPs.