Causality information and proactive cancellation mechanisms

Time Warp distributed simulations can enter a catastrophic state of cascading rollbacks where out of order (premature) event executions propagate faster than the corrective measures (anti‐messages) designed to terminate them. In this paper, a distributed, proactive cancellation mechanism designed to avoid this situation is presented. We also present a version of total clocks called Plausible Total Clocks (PTC). PTC employs a compact time vector of event counter range to address the scalability issues typically suffered by total clock solutions. That is, PTC consists of constant size vectors and are independent of the number of simulation objects in the simulation. The events generated due to an out of order execution are proactively cancelled by determining its causality relation with the already annihilated events. We present a proof of correctness of the distributed cancellation mechanism using PTC and also show that the catastrophic states are avoided with this proactive cancellation mechanism. This cancellation mechanism assumes first‐input–first‐output communication layer, static inter‐connection topology, and logical processes consisting of multiple simulation objects. Copyright © 2009 John Wiley & Sons, Ltd.

[1]  Atul Prakash,et al.  Filter: an algorithm for reducing cascaded rollbacks in optimistic distributed simulations , 1991, Annual Simulation Symposium.

[2]  Carl Tropper,et al.  Clustered time warp and logic simulation , 1995, PADS.

[3]  Jean C. Walrand,et al.  Wolf: a rollback algorithm for optimistic distributed simulation systems , 1988, WSC '88.

[4]  Friedemann Mattern,et al.  Virtual Time and Global States of Distributed Systems , 2002 .

[5]  Krishnan Subramani,et al.  A comparative analysis of various Time Warp algorithms implemented in the WARPED simulation kernel , 1996, Proceedings of the 29th Annual Simulation Symposium.

[6]  Carl Tropper,et al.  The dependence list in time warp , 2001, Proceedings 15th Workshop on Parallel and Distributed Simulation.

[7]  Ajay D. Kshemkalyani,et al.  An Efficient Implementation of Vector Clocks , 1992, Inf. Process. Lett..

[8]  Paul F. Reynolds,et al.  Elastic time , 1998, TOMC.

[9]  R.M. Fujimoto,et al.  Parallel and distributed simulation systems , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[10]  Mustaque Ahamad,et al.  Plausible clocks: constant size logical clocks for distributed systems , 1996, Distributed Computing.

[11]  Boleslaw K. Szymanski,et al.  Breadth-First Rollback in Spatially Explicit Simulations , 1997, Workshop on Parallel and Distributed Simulation.

[12]  Richard M. Fujimoto,et al.  Time Warp on a Shared Memory Multiprocessor , 1989, ICPP.

[13]  Mukesh Singhal,et al.  Logical Time: Capturing Causality in Distributed Systems , 1996, Computer.

[14]  Philip A. Wilsey,et al.  Causality representation and cancellation mechanism in time warp simulations , 2001, Proceedings 15th Workshop on Parallel and Distributed Simulation.

[15]  Roger D. Chamberlain,et al.  Parallel Logic Simulation of VLSI Systems , 1995, 32nd Design Automation Conference.

[16]  Mukesh Singhal,et al.  Dependency sequences and hierarchical clocks: Efficient alternatives to vector clocks for mobile computing systems , 1997, Wirel. Networks.

[17]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[18]  Bernadette Charron-Bost,et al.  Concerning the Size of Logical Clocks in Distributed Systems , 1991, Inf. Process. Lett..

[19]  Philip A. Wilsey,et al.  Dynamic Cancellation: Selecting Time Warp Cancellation Strategies at Runtime , 1999, VLSI Design.

[20]  R. M. Fujimoto,et al.  Parallel discrete event simulation , 1989, WSC '89.

[21]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[22]  Atul Prakash,et al.  Filter: an algorithm for reducing cascaded rollbacks in optimistic distributed simulations , 1991, ANSS '91.