Fast Concurrent Simulation Using the Time Warp Mechanism: Part I, Local Control, Part 1More than 20 years after its development, computer simulation continues to be a time-consuming process. This Note addresses the problem of speeding up simulation through concurrency. The authors propose a new method for concurrent simulation. the Note first presents the fundamental issues in concurrent discrete event simulation. A critical analysis of the methods for concurrent simulation proposed in the literature follows. Then the authors give a detailed description of the local control part of the Time Warp mechanism, the part concerned with the actual mechanics of discrete event simulation. Finally, the discussion examines the concepts of messages, antimessages, annihilation, and rollback. |
Common terms and phrases
176 Sending virtual 182 Receiving virtual annihilation antimessage asynchronous method avoid deadlock Blocking Table algorithm Cancellation Phase cause Chandy and Misra Coasting Forward phase concurrent or distributed concurrent simulation methods conservative mechanism cycle David Jefferson discrete event simulation distributed computation distributed simulation earlier than 135 eligible to execute enqueued event messages farthest behind object implementation Input Message Queue input queue input/output large simulations Link Time algorithm memory overflow Message Queue 119 message transmission messages arrive Network Paradigm node null messages number of messages object's LVT ordinary message original message Output Message Queue overflow memory Peacock problem processed processors progress forward Queue 92 Rand random seeds Receiver 1 Anti-toggle receiving object Restoration Phase roll rollback mechanism saved secondary rollbacks Sender simulation programmer speedup stamps greater straggler Text State Queue transitive closure University of Waterloo virtual time 112 Warp mechanism Warp method Warp Object Warp system Wong