The event graph data structure (or Graph for brevity) provides an asynchronous communication layer based on a directed graph, which represents the senders and the receivers. A node in the graph can send multicast messages (called event messages) via all its out-going edges. All messages sent via the same edge are delivered in order. The user determines the capacity of the edges, which bounds the maximum number of outstanding messages at any given time. Snapshots can also be taken on the Graph objects to determine the status of all messages. The implementation of the event graph takes advantage of the graph structure to perform optimizations such as collapsing event messages and flow-control messages.
The Graph data structure is used in asynchronous simulation, and other applications where the sender/receiver relationship remains unchanged throughout the execution.
DistObj, Snapshot.