Time warp - connection oriented

Authors:
Nasser Kalantery
Affiliations:
University of Westminster, London
Venue:
Proceedings of the eighteenth workshop on Parallel and distributed simulation
Year:
2004

Citing 8
Cited 1

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
An empirical comparison of priority-queue and event-set implementations

Communications of the ACM
Parallel discrete event simulation

Communications of the ACM - Special issue on simulation
Efficient implementation of event sets in Time Warp

PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Efficient optimistic parallel simulations using reverse computation

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Asynchronous distributed simulation via a sequence of parallel computations

Communications of the ACM - Special issue on simulation modeling and statistical computing
The dependence list in time warp

Proceedings of the fifteenth workshop on Parallel and distributed simulation
Causality representation and cancellation mechanism in time warp simulations

Proceedings of the fifteenth workshop on Parallel and distributed simulation

Using Consistent Global Checkpoints to Synchronize Processes in Distributed Simulation

DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications

Quantified Score

Hi-index	0.00

Visualization

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 reduces 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.