Comparative analysis of periodic state saving techniques in time warp simulators

  • Authors:

  • Josef Fleischmann;Philip A. Wilsey

  • Affiliations:

  • Institute of Electronic Design Automation, Technical University of Munich, D-80290 Munich, Germany;Center for Digital Systems Engineering, Dept of ECECS, PO Box 210030, Cincinnati, Ohio

  • Venue:
  • PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

Checkpointing in a time warp synchronized parallel simulator is a necessary and potentially expensive operation. In the simple case, a time warp simulator checkpoints every &khgr; events, for some fixed value &khgr;. For larger values of &khgr;, the simulator requires less overhead for saving the state, but incurs an increased latency during rollback. Thus, the problem is to balance the time to save states against the time to coast forward upon rollback. Unfortunately, a static determination of a optimal value for &khgr; is very difficult and can vary widely, even between closely related instances of a time warp simulator. Furthermore, the optimal checkpoint interval may actually vary over the lifetime of the simulation.To address these problems, several investigators have proposed dynamically adjusting the checkpoint interval &khgr; as the simulation progresses. This paper analyzes three previous techniques for dynamically sizing checkpoint intervals and presents a new, heuristic algorithm for this purpose. All four techniques are implemented in a common application domain (digital system simulation from VHDL descriptions) and a direct comparison between the algorithms is performed. The results show a significant difference in the performance of the implemented algorithms. However, in virtually all cases, the dynamic algorithms performed near or better than the best static value. Furthermore, the best algorithms performed as much as 12% better than the best static value.