Abstract
The time warp mechanism is one of the most favorite paradigm to carry out a distributed discrete event simulation, where the synchronization of events can be determined a priori when the program is being executed. The forward computation performed optimistically has to be rolled back when an out-of-order synchronization message is received. This excessive amount of rollback often haunts the performance of a time warp mechanism. We propose in this paper that the semantics of the synchronization messages being sent in a time warp execution can be exploited to reduce the amount of rollback. In particular, we illustrate with some examples how the commutativity and dependency properties of messages can be used to avoid certain types of rollback. For example, two commutative messages can be processed in any order and the resultant computation remains valid. We present a protocol for message handling in the time warp mechanism. We also give a correctness argument for the protocol, leaving the formal proof in the full paper. In the discussion, we suggest several optimization techniques that can be used in our protocol for a better improvement.
This research is supported by the National Science Foundation under grant number IRI-9117094.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Mustaque Ahamad, James E. Burns, Phillip W. Hutto, and Gil Neiger. Causal memory. Technical report, Georgia Institute of Technology, College of Computing, Atlanta, GA30332-2593, 1991.
R.L. Bagrodia and W.T. Liao. Transparent optimizations of overheads in optimistic simulations. In Proceedings of the 1992 Winter Simulation Conference, pages 637–645, 1992.
Amotz Bar-Noy and Danny Dolev. Shared memory vs message passing in an asynchronous distributed environment. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pages 307–318. ACM, 1989.
K.P. Birman, T.A. Joseph, K. Kane, and F. Schmuck. ISIS-a distributed programming environment user's guide and reference manual. Technical report, Cornell University, Department of Computer Science, March 1988.
K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, Reading, Massachusetts, 1988.
K.M. Chandy and J. Misra. Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engineering, 5(9):440–452, Sept 1979.
P.M. Dickens and P.F. Reynold. SRADS with local rollback. In Proceedings of the SCS Multiconference on Distributed Simulation, pages 161–164, Jan 1990.
R. Fujimoto. Parallel distributed discrete event simulation. Communications of the ACM, 33(10):30–53, October 1990.
A. Gafni. Rollback mechanisms for optimistic distributed simulation systems. In Proceedings of the SCS Multiconference on Distributed Simulation, pages 61–67, July 1988.
M. P. Herlihy and W. E. Weihl. Hybrid Concurrency Control for Abstract Data Types. Journal of Computer and System Sciences, 43(1):25–61, August 1991. Special issue on the 7th Annual ACM SIGACT-SIGMOD Symposium on the Principles of Database Systems, March 21–23, 1988.
David Jefferson. Virtual time. ACM Transactions on Programming Languages and Systems, 7(3):404–425, July 1985.
H. F. Korth. Locking primitives in a database system. Journal of the ACM, 30(1):55–79, Jan 1983.
H. V. Leong and D. Agrawal. Semantics-based time warp protocols. Technical Report TRCS93-10, University of California at Santa Barbara, Department of Computer Science, Santa Barbara, CA93106, 1993.
H. V. Leong and D. Agrawal. Using message semantics to reduce rollback in optimistic message logging recovery schemes. Technical report, University of California at Santa Barbara, Department of Computer Science, Santa Barbara, CA93106, 1993. To appear.
Kai Li and Paul Hudak. Memory coherence in shared virtual memory systems. ACM Transactions on Computer Systems, 7(4):321–359, Nov 1989.
J. Misra. Distributed discrete-event simulation. ACM Computing Surveys, 18(1):39–65, March 1986.
P.M. Schwarz and A.Z. Spector. Synchronizing shared abstract types. ACM Transactions on Computer Systems, 2(3):223–250, Aug 1984.
L. Sokol, B. Stucky, and V. Hwang. MTW: A control mechanism for parallel discrete simulation. In Proceedings of the 1989 International Conference on Parallel Processing, volume III, pages 250–254. IEEE, 1989.
J.S. Steinman. SPEEDES: Synchronous parallel environment for emulation and discrete event simulation. In Proceedings of the SCS Multiconference on Distributed Simulation, pages 95–103, Jan 1991.
William E. Weihl. The impact of recovery on concurrency control. In Proceedings of the 8th ACM Symposium on Principles of Database Systems, pages 259–269. ACM, 1989.
D. West. Optimizing time warp: Lazy rollback and lazy re-evaluation. Master's thesis, University of Calgary, Department of Computer Science, Jan 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leong, H.V., Agrawal, D., Agre, J.R. (1993). Using message semantics to reduce rollback in the time warp mechanism. In: Schiper, A. (eds) Distributed Algorithms. WDAG 1993. Lecture Notes in Computer Science, vol 725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57271-6_44
Download citation
DOI: https://doi.org/10.1007/3-540-57271-6_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57271-8
Online ISBN: 978-3-540-48029-7
eBook Packages: Springer Book Archive