Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Effects of the checkpoint interval on time and space in time warp
Preiss B., Loucks W., Macintyre I. ACM Transactions on Modeling and Computer Simulation4 (3):223-253,1994.Type:Article
Date Reviewed: Sep 1 1995

Optimistically synchronized parallel discrete-event simulation is based on the use of communicating sequential processes. When synchronization errors are detected, processes are rolled back to an earlier state that has been checkpointed. The performance of the system depends on various factors, including the checkpoint interval, the checkpoint time, the scheduling algorithm for the processes, and the cancellation policy in error situations.

This paper presents empirical results describing the effects of these factors on the time and space requirements of parallel simulation. At first sight, the general results (if systems exhibit few secondary rollbacks, use longer checkpoint intervals) are not very impressive. A more thorough examination of the detailed descriptions of the system performance under varying circumstances gives the reader good insight into the complex behavior of parallel systems, however. The methodological content of the paper should also be useful to anybody working with rollbacks due to synchronization problems.

The paper is rather long, and some details could certainly have been left out. On the other hand, the casual reader would have benefitted from an even more detailed analysis of the causal relations between the architectural factors and the system performance. A topic for further study is the sensitivity of the results to process cooperation patterns.

Reviewer:  T. Alanko Review #: CR118946 (9509-0698)
Bookmark and Share
 
Synchronization (D.4.1 ... )
 
 
Allocation/ Deallocation Strategies (D.4.2 ... )
 
 
Discrete event (I.6.8 ... )
 
 
Modeling Techniques (C.4 ... )
 
 
Parallel (I.6.8 ... )
 
 
Scheduling (D.4.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Synchronization": Date
Synchronous and asynchronous experiments on processes
Hennessy M. Information and Control 59(1-3): 36-83, 1984. Type: Article
Jun 1 1985
Lower Bounds for Distributed Maximum-Finding Algorithms
Pachl J., Korach E., Rotem D. Journal of the ACM 31(4): 905-918, 1984. Type: Article
Oct 1 1985
Synchronizing clocks in the presence of faults
Lamport L., Melliar-Smith P. Journal of the ACM 32(1): 52-78, 1985. Type: Article
Dec 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy