Time warp - connection oriented

Abstract

Conservative parallel discrete event simulation takes a connection-oriented approach to inter-process communication. Conservative processes modeling physical entities are connected via channels that represent physical links in the target system. By contrast, optimistic strategy and its implementation in time warp machine, take a connectionless approach where a process can communicate freely with any other process without prior connection. This paper presents the case for a connection-oriented optimistic approach and provides a data structure for the event set of time warp processes that significantly reduce the cost of event scheduling and cancellation under connection-oriented operation. Detailed description of the proposed implementation is given and performance of the structure in forward event scheduling and backward event cancellation is tested and the results are discussed.