
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Hervé Avril, Carl Tropper, "On Rolling Back and Checkpointing in Time Warp," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 11051121, November, 2001.  
BibTex  x  
@article{ 10.1109/71.969122, author = {Hervé Avril and Carl Tropper}, title = {On Rolling Back and Checkpointing in Time Warp}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {11}, issn = {10459219}, year = {2001}, pages = {11051121}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.969122}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  On Rolling Back and Checkpointing in Time Warp IS  11 SN  10459219 SP1105 EP1121 EPD  11051121 A1  Hervé Avril, A1  Carl Tropper, PY  2001 KW  Parallel simulation KW  distributed simulation KW  distributed processing. VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In this paper, we present a family of three algorithms which serve to perform checkpoints and to roll back Time Warp. These algorithms are primarily intended for use in simulations in which there are a large number of LPs and in which events have a small computational granularity. Important representatives of this class are VLSI and computer network simulations. In each of our algorithms, LPs are gathered into clusters via algorithms which are application dependent. In order to examine the performance of our algorithms and to compare them to Time Warp, we made use of two of the largest digital logic circuits available from the ISCAS89 benchmark series of combinational circuits. The execution time, number of states saved, and maximal memory consumption were compared to the same quantities for Time Warp. Our results indicated that each of the algorithms occupies a different point in the spectrum of possible tradeoffs between memory usage and execution time, ranging from substantial memory savings (at a comparable cost in speed) to memory savings and a comparable speed to Time Warp. Hence, an important benefit of our algorithms is the ability to trade off memory requirements with execution time.
[1] H. Avril and C. Tropper, “Clustered Time Warp and Logic Simulation,” Proc. Ninth Workshop Parallel and Distributed Simulation, pp. 112119, 1995.
[2] H. Avril, “Clustered Time Warp and Logic Simulation,” PhD dissertation, School of Computer Science, McGill Univ., Montreal, Canada, 1996.
[3] H. Avril and C. Tropper, “Dynamic Load Balancing of Clustered Time Warp,” Proc. 10th Workshop Parallel and Distributed Simulation, 1996.
[4] M.L. Bailey, J.V. Briner, and R.D. Chamberlain, “Parallel Logic Simulation of VLSI Systems,” ACM Computing Surveys, vol. 26, no. 3, pp. 255295, Sept. 1994.
[5] H. Bauer, C. Sporrer, and T.H. Krodel, “On Distributed Logic Simulation Using Time Warp,” Proc. Int'l Conf. Very Large Scale Integration (VLSI), C. Halas and G. Denyer, eds., pp. 127136, Aug. 1991.
[6] A. Boukerche and C. Tropper, “Parallel Simulation on the Hypercube Multiprocessor,” Distributed Computing, vol. 8, pp. 181190, 1995.
[7] J.V. Briner Jr., “Parallel MixedLevel Simulation of Digital Circuits Using Virtual Time,” PhD thesis, Duke Univ., 1990.
[8] J.V. Briner Jr., “Fast Parallel Simulation of Digital Systems,” Proc. Fifth Workshop Parallel and Distributed Simulation, pp. 7177, 1991.
[9] K. Chandy and J. Misra, “Distributed Simulation: A Case Study in the Design and Verification of Distriuted Programs,” IEEE Trans. Software Eng., vol. 5, pp. 440452, Sept. 1979.
[10] M. Choe and C. Tropper, “On Learning Algorithms and Balancing Loads in Time Warp,” Proc. 13th Workshop Parallel and Distributed Simulation, pp. 101109, May 1999.
[11] S. Das et al., “GTW: A Time Warp System for Shared Memory Multiprocessors,” Proc. 1994 Winter Simulation Conf., 1994.
[12] J. Fleischmann and P.A. Wilsey, “Comparative Analysis of Periodic State Saving Techniques in TimeWarp Simulators,” Proc. Ninth Workshop Parallel and Distributed Simulation (PADS '95), pp. 5058, June 1995.
[13] R.M. Fujimoto, ”Time Warp on a Shared Memory Multiprocessor,” Trans. Soc. Computer Simulation, vol. 6, no. 3, pp. 211239, July 1989.
[14] R. Fujimoto, “Parallel Discrete Event Simulation,” Comm. ACM, vol. 33, no. 10, pp. 3053, Oct. 1990.
[15] A. Gafni, ”Rollback Mechanisms for Optimistic Distributed Simulation Systems,” Proc. Second Workshop Parallel and Distributed Systems, pp. 6167, 1988.
[16] B. Groselj and C. Tropper, “The Distributed Simulation of Clustered Processes,” Distributed Computing, vol. 4, pp. 111121, 1991.
[17] D.R. Jefferson, "Virtual Time," ACM Trans. Programming Languages and Systems, vol. 7, no. 3, pp. 404425, July 1985.
[18] K. ElKhatib and C. Tropper, “Load Balancing for Clustered Time Warp,” Proc. Symp. Modeling Ananlysis and Simulation of Computer and Telecomm. '97, 1997.
[19] Y.B. Lin and E.D. Lazowska, “Processor Scheduling for Time Warp Parallel Simulation,” Proc. 1991 Soc. Computer Simulation Multiconf. Advances in Parallel and Distributed Simulations, pp. 1114, Jan. 1991.
[20] B. Lubachevsky, A. Schwartz, and A. Weiss, “Rollback Sometimes Works ... If Filtered,” Proc. 1989 Winter Simulation Conf., pp. 630639, Dec. 1989.
[21] D. Nicol and R. Fujimoto, ”Parallel Simulation Today,” Annals Operations Research, vol. 53, pp. 249285, Nov. 1994.
[22] K. Panesar and R. Fujimoto, ”Adaptive Flow Control in Time Warp,” Proc. 11th Workshop Parallel and Distributed Simulation, pp. 108116, June 1997.
[23] B.R. Preiss, “The Yaddes Distributed Discrete Event Simulation Specification Language and Execution Environment,” Proc. Multiconf. Distributed Simulation, pp. 139144, 1989.
[24] B.R. Preiss, W. Loucks, and I. MacIntyre, “Effects of the Checkpoint Interval on Time and Space in Time Warp,” ACM Trans. Modeling and Computer Simulation, July 1994.
[25] M. Presley, M. Ebling, F. Wieland, and D. Jefferson, “Benchmarking the Time Warp Operating System with a Computer Network Simulation,” Proc. Third Workshop Parallel and Distributed Simulation, pp. 2436, 1989.
[26] M. Presley, M. Ebling, F. Wieland, and D. Jefferson, “Virtual Time Based Dynamic Load Management in the Time Warp Operating System,” Proc. Fourth Workshop Parallel and Distributed Simulation, pp. 103111, 1990.
[27] F. Wieland et al., “Distributed Combat Simulation and Time Warp: The Model and Its Performance,” Proc. Soc. Computer Simulation Multic. Distributed Simulation, vol. 21, no. 2, pp. 1421, Mar. 1989.