Abstract
The design of a Time Warp simulation kernel is made difficult by the inherent complexity of the paradigm. Hence it becomes critical that the design of such complex simulation kernels follow established design principles such as object-oriented design so that the implementation is simple to modify and extend. In this paper, we present a compendium of our efforts in the design and development of an object-oriented Time Warp simulation kernel, called warped. warped is a publically available Time Warp simulation kernel for experimentation and application development. The kernel defines a standard interface to the application developer and is designed to provide a highly configurable environment for the integration of Time Warp optimizations. It is written in C++, uses the MPI message passing standard for communication, and executes on a variety of platforms including a network of SUN workstations, a SUN SMP workstation, the IBM SP1/SP2 multiprocessors, the Cray T3E, the Intel Paragon, and IBM-compatible PCs running Linux.
Support for this work was provided in part by the Advanced Research Projects Agency under contracts DABT63-96-C-0055 and J-FBI-93-116.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Fujimoto. Parallel discrete event simulation. Communications of the ACM, 33(10):30–53, October 1990.
D. Jefferson. Virtual time. ACM Transactions on Programming Languages and Systems, 7(3):405–425, July 1985.
W. Gropp, E. Lusk, and A. Skjellum. Using MPI: Portable Parallel Programming with the Message-Passing Interface. MIT Press, Cambridge, MA, 1994.
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of ACM, pages 558–565, July 1978.
Yi-Bing Lin. Memory management algorithms for optimistic parallel simulation. In 6th Workshop on Parallel and Distributed Simulation, pages 43–52. Society for Computer Simulation, January 1992.
F. Mattern. Efficient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing, 18(4):423–434, August 1993.
C. H. Young and P. A. Wilsey. Optimistic fossil collection for Time Warp simulation. In H. El-Rewini and B. D. Shriver, editors, 29th Hawaii International Conference on System Sciences (HICSS-29), volume Volume I, pages 364–372, January 1996.
R. Rajan, R. Radhakrishnan, and P. A. Wilsey. Dynamic cancellation: Selecting Time Warp cancellation strategies at runtime. VLSI Design, 1998. (forthcoming).
J. Fleischmann and P. A. Wilsey. Comparative analysis of periodic state saving techniques in Time Warp simulators. In Proc. of the 9th Workshop on Parallel and Distributed Simulation (PADS 95), pages 50–58, June 1995.
M. Chetlur, N. Abu-Ghazaleh, R. Radhakrishnan, and P. A. Wilsey. Optimizing communication in Time-Warp simulators. In 12th Workshop on Parallel and Distributed Simulation. Society for Computer Simulation, May 1998.
R. Radhakrishnan, N. Abu-Ghazaleh, M. Chetlur, and P. A. Wilsley. On-line configuration of a Time Warp parallel discrete event si mulator. In 1998 International Conference on Parallel Processing, (ICPP’98). IEEE Computer Society Press, August 1998. (forthcoming).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Radhakrishnan, R., Martin, D.E., Chetlur, M., Madhava Rao, D., Wilsey, P.A. (1998). An Object-Oriented Time Warp Simulation Kernel. In: Caromel, D., Oldehoeft, R.R., Tholburn, M. (eds) Computing in Object-Oriented Parallel Environments. ISCOPE 1998. Lecture Notes in Computer Science, vol 1505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49372-7_2
Download citation
DOI: https://doi.org/10.1007/3-540-49372-7_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65387-5
Online ISBN: 978-3-540-49372-3
eBook Packages: Springer Book Archive