skip to main content
research-article

On constructing optimistic simulation algorithms for the discrete event system specification

Published:04 January 2009Publication History
Skip Abstract Section

Abstract

This article describes a Time Warp simulation algorithm for discrete event models that are described in terms of the Discrete Event System Specification (DEVS). The article shows how the total state transition and total output function of a DEVS atomic model can be transformed into an event processing procedure for a logical process. A specific Time Warp algorithm is constructed around this logical process, and it is shown that the algorithm correctly simulates a DEVS coupled model that consists entirely of interacting atomic models. The simulation algorithm is presented abstractly; it is intended to provide a basis for implementing efficient and scalable parallel algorithms that correctly simulate DEVS models.

References

  1. Bruce, D. 1995. The treatment of state in optimistic systems. In Proceedings of the 9th Workshop on Parallel and Distributed Simulation (PADS). IEEE Computer Society, 40--49. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Chow, A., Zeigler, B., and Kim, D. H. 1994. Abstract simulator for the parallel DEVS formalism. In Proceedings of the 5th Annual Conference on AI, Simulation, and Planning in High Autonomy Systems. IEEE Press, 157--163.Google ScholarGoogle Scholar
  3. Chow, A. C. H. and Zeigler, B. P. 1994. Parallel DEVS: a parallel, hierarchical, modular, modeling formalism. In Proceedings of the 26th Winter Simulation Conference. Society for Computer Simulation International, San Diego, CA, 716--722. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Christensen, E. 1990. Hierarchical optimistic distributed simulation: combining DEVS and time warp. Ph.D. thesis, Department of Electrical and Computer Engineering, University of Arizona. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Ferscha, A. 1995. Parallel and distributed simulation of discrete event systems. In Handbook of Parallel and Distributed Computing. McGraw-Hill, Inc., New York, NY.Google ScholarGoogle Scholar
  6. Fujimoto, R. 1990. Performance of Time Warp under synthetic workloads. In Proceedings of the SCS Multiconference on Distributed Simulation. Society for Computer Simulation, Vol. 22. San Diego, CA, 23--28.Google ScholarGoogle Scholar
  7. Fujimoto, R. 2000. Parallel and Distributed Simulation Systems. John Wiley and Sons, Inc., New York, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Glinsky, E. and Wainer, G. 2006. New Parallel Simulation Techniques of DEVS and Cell-DEVS in CD++. In Proceedings of the 39th Annual Simulation Symposium. IEEE Computer Society, 244--251. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Leivent, J. I. and Watro, R. J. 1993. Mathematical foundations for time warp systems. ACM Trans. Prog. Lang. Syst. 15, 5, 771--794. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Liu, Q. 2007. Parallel Environment for DEVS and Cell-DEVS Models. SIMULATION 83, 6, 449--471. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Maler, O., Manna, Z., and Pnueli, A. 1992. From timed to hybrid systems. In Proceedings of the REX Workshop Real-Time: Theory in Practice. Lecture Notes in Computer Science, vol. 600. Springer-Verlag, 447--484. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Manna, Z. and Pneuli, A. 1993. Verifying hybrid systems. In Hybrid Systems, volume 736 of Lecture Notes in Computer Science. Springer, 4--35. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Martin, D. E., McBrayer, T. J., Radhakrishnan, R., and Wilsey, P. A. 1999. WARPED: A TimeWarp parallel discrete event simulator (Documentation for version 1.0). http://www.ececs.uc.edu/paw/warped/doc/index.html.Google ScholarGoogle Scholar
  14. Mattern, F. 1993. Efficient algorithms for distributed snapshots and global virtual time approximation. J. Para. Distrib. Comput. 18, 4, 423--434. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Mesarovic, M. and Takahara, Y. 1989. Abstract Systems Theory. Springer-Verlag.Google ScholarGoogle Scholar
  16. Nutaro, J. 2003. Parallel discrete event simulation with application to continuous systems simulation. Ph.D. thesis, Department of Electrical and Computer Engineering, University of Arizona. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Nutaro, J. and Sarjoughian, H. 2004. Design of distributed simulation environments: a unified system-theoretic and logical processes approach. Trans. Soc. Model. Simul. Int. 80, 11, 577--589. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Rajan, R. and Wilsey, P. A. 1995. Dynamically switching between lazy and aggressive cancellation in a time warp parallel simulator. In Proceedings of the 28th Annual Simulation Symposium (SS'95). IEEE Computer Society, 22--30. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Rönngren, R. and Liljenstam, M. 1999. On event ordering in parallel discrete event simulation. In Proceedings of the 13th Workshop on Parallel and Distributed Simulation (PADS). IEEE Computer Society, 38--45. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Soliman, H. M. 1999. On the selection of the state saving strategy in time warp parallel simulations. Trans. Soci. Comput. Simul. Int. 16, 1, 32--36. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Wieland, F. 1997. The threshold of event simultaneity. In Proceedings of the 11th Workshop on Parallel and Distributed Simulation (PADS). IEEE Computer Society, 56--59. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Xu, Q. and Tropper, C. 2005. XTW, a parallel and distributed logic simulator. In Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation (PADS). IEEE Computer Society, 181--188. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Young, C. H., Abu-Ghazaleh, N. B., and Wilsey, P. A. 1998. OFC: a distributed fossil-collection algorithm for Time-Warp. In Proceedings of the 12th International Symposium on Distributed Computing (DISC). Springer-Verlag, 408--418. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Zeigler, B. P., Ball, G., Cho, H., Lee, J., and Sarjoughian, H. 1999. Implementation of the DEVS formalism over the HLA/RTI: problems and solutions. In 1999 Fall Simulation Interoperability Workshop.Google ScholarGoogle Scholar
  25. Zeigler, B. P., Praehofer, H., and Kim, T. G. 2000. Theory of Modeling and Simulation: Second Edition. Academic Press, San Diego, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Zeng, Y., Cai, W., and Turner, S. J. 2004. Batch based cancellation: a rollback optimal cancellation scheme in time warp simulations. In Proceedings of the 18th Workshop on Parallel and Distributed Simulation (PADS). ACM, New York, NY, 78--86. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On constructing optimistic simulation algorithms for the discrete event system specification

      Recommendations

      Reviews

      Tommaso Mazza

      Time management in discrete event-based simulation systems has always been considered a challenging task. Problems related to synchronization of concurrent activities performed on different elaborating units draw wide interest across the most diverse research fields. Time is a crucial variable in both parallel and distributed systems. It progresses in different ways for each elaborating unit, because of many intrinsic and extrinsic reasons. Indeed, some processors might be overloaded, malfunctioning, or simply faster than others; consequently, they might be communicating in different virtual times. "Time warp" is a well-consolidated strategy to tackle and resolve temporal conflicts that processors might encounter during their activities. In this context, Nutaro shows how to transform the total state transition and the total output function of a discrete event system specification "into an event-processing procedure for a logical process." He designs an abstract algorithm around this concept, and proves it functions correctly. The paper is well organized. It offers a brief but exhaustive introduction to the problem at hand. It shows how it would be possible to transition from atomic models to logical processes, by paying particular attention to, first, the equivalence of the state and the output trajectories produced by a recursive and an iterative calculation of the state function, and, second, the preservation of the causality constraint. The author then introduces his time warp algorithm. It is not only succinctly compared with a couple of alternative algorithms, but is also abstractly formalized in pseudocode. A slightly more detailed comparison with the other algorithms would have helped complete the dissertation. The final proofs of correctness and the theorems confer trustworthiness to the paper and make it self-contained. A good list of references is provided. Online Computing Reviews Service

      Access critical reviews of Computing literature here

      Become a reviewer for Computing Reviews.

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Modeling and Computer Simulation
        ACM Transactions on Modeling and Computer Simulation  Volume 19, Issue 1
        December 2008
        108 pages
        ISSN:1049-3301
        EISSN:1558-1195
        DOI:10.1145/1456645
        Issue’s Table of Contents

        Copyright © 2009 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 4 January 2009
        • Accepted: 1 February 2008
        • Revised: 1 December 2007
        • Received: 1 April 2007
        Published in tomacs Volume 19, Issue 1

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader