ACM Home Page
Please provide us with feedback. Feedback
Fast-software-checkpointing in optimistic simulation: embedding state saving into the event routine instructions
Full text Publisher SitePublisher Site PdfPdf (725 KB)
Source Workshop on Parallel and Distributed Simulation archive
Proceedings of the thirteenth workshop on Parallel and distributed simulation table of contents
Atlanta, Georgia, United States
Pages: 118 - 125  
Year of Publication: 1999
ISBN:0-7695-0155-9
Author
Francesco Quaglia  Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Via Salaria 113, 00198 Roma, Italy
Sponsors
IEEE-CS\TCSIM : TC on Simulation
SIGSIM: ACM Special Interest Group on Simulation and Modeling
SCS : Society for Computer Simulation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 8,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

In this paper we present a software approach, namely Fast-Software-Checkpointing (FSC), to reduce the running time of the state saving protocol in optimistic parallel discrete event simulation. The idea behind FSC is to use the instructions performed during the execution of an event as part of the state saving protocol, hence the total number of instructions due to state saving is reduced. Under FSC the time for saving the state of a logical process prior to the execution of an event e requires an amount of time proportional to the amount of state variables not updated by e's execution, as only these variables must be copied. This outlines that FSC shows some dualism with respect to incremental state saving. We show, however, that there exists a basic difference between the two solutions as in FSC some of the state saving instructions are actually event routine instructions, while in incremental state saving they are only added and mixed to the latter ones. We also present a simple software architecture to support FSC and simulation results to demonstrate the effectiveness of such solution. The obtained data show that FSC, combined with a sparse state saving strategy, may represent the best checkpointing solution in case of both medium/small state granularity simulations and large state granularity simulations even with small (but non-minimal) portions of the state updated by event execution. FSC may result therefore suited for a wide class of simulation problems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
H. Bauer and C. Sporrer, "Reducing Rollback Overhead in Time Warp Based Distributed Simulation with Optimized Incremental State Saving", Proc. 26-th Annual Simulation Symposium, pp. 12-20, March 1993.
 
2
S. Bellenot, "State Skipping Performance with the Time Warp Operating System", Proc. 6-th Workshop on Parallel and Distributed Simulation, pp.33-42, January 1992.
3
4
5
6
 
7
R.M. Fujimoto, "'Performance of Time Warp Under Synthetic Workloads", Proc. Multiconf. Distributed Simulation, Vol.22, No. 1, January 1990.
 
8
 
9
D. Jefferson and H. Sowizral, "Fast Concurrent Simulation Using the Time Warp Mechanism; Part I: Local Control", Tech. Rep. N1906AF, RAND Corporation, December 1982.
10
11
 
12
13
14
 
15
E Quaglia and V. Cortellessa, "Rollback-Based Parallel Discrete Event Simulation by Using Hybrid State Saving", Proc. 9-th European Simulation Symposium, pp.275-279, October 1997.
16
17
18
 
19
20
21
22