Skip to main content
SpringerLink
Log in
Book cover

International Parallel Processing Symposium

IPPS 1999: Parallel and Distributed Processing pp 1228–1242Cite as

A formal framework for specifying and verifying time warp optimizations

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1586))

Abstract

Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implementors design and develop these systems without a complete understanding of the problem domain; in addition, the nondeterministic nature of certain parallel and distributed systems make system validation difficult if not impossible. To address this issue, the application of formal specification and verification to a class of parallel and distributed software systems is presented in this paper. Specifically, the Prototype Verification System (PVS) is applied to the specification and verification of the Time Warp protocol, a distributed optimistic discrete event simulation algorithm. The paper discusses how the specification of the Time Warp protocol can be mechanized within a general-purpose higher-order theorem proving framework like PVS. In addition, the paper presents the extensibility of the specification to address and verify different aspects and optimizations of the basic Time Warp protocol. As an illustrative example, our experiences in specifying and verifying the infrequent state saving optimization to the basic Time Warp protocol is reported in the paper.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chandy, K. M., and Misra, J. Asynchronous distributed simulation via a sequence of parallel computations. Communications of the ACM 24, 11 (Apr. 1981), 198–206.

    Article  MathSciNet  Google Scholar 

  2. D’Souza, L. M., Fan, X., and Wilsey, P. A. pGVT: An algorithm for accurate GVT estimation. In Proc. of the 8th Workshop on Parallel and Distributed Simulation (PADS 94) (July 1994), Society for Computer Simulation, pp. 102–109.

    Google Scholar 

  3. Fleischmann, J., and Wilsey, P. A. Comparative analysis of periodic state saving techniques in Time Warp simulators. In Proc. of the 9th Workshop on Parallel and Distributed Simulation (PADS 95) (June 1995), pp. 50–58.

    Google Scholar 

  4. Frey, P.Protocols for Optimistic Synchronization of Mixed-Mode Simulation. PhD thesis, University of Cincinnati, August 1998.

    Google Scholar 

  5. Frey, P., Radhakrishnan, R., Carter, H. W., and Wilsey, P. A. Optimistic synchronization of mixed-mode simulators. In 1998 International Parallel Processing Symposium, IPPS’98 (March 30–April 3 1998), pp. 694–699.

    Google Scholar 

  6. Frey, P., Radhakrishnan, R., Wilsey, P. A., Alexander, P., and Carter, H. W. An extensible formal framework for the specification and verification of an optimistic simulation protocol. In Proceedings of the 32nd Hawaii International Conference on System Sciences (HICSS’99) (jan 1999), Sony Electronic Publishing Services. (forthcoming).

    Google Scholar 

  7. Fujimoto, R., Parallel discrete event simulation. Communications of the ACM 33, 10 (Oct. 1990), 30–53.

    Article  Google Scholar 

  8. Jefferson, D., Virtual time. ACM Transactions on Programming Languages and Systems 7, 3 (July 1985), 405–425.

    Article  MathSciNet  Google Scholar 

  9. Kannikeswaran, B., Radhakrishnan, R., Frey, P., Alexander, P., and Wilsey, P. A. Formal specification and verification of the pGVT algorithm. In FME ’96: Industrial Benefit and Advances in Formal Methods (Mar. 1996), M.-C. Gaudel and J. Woodcock, Eds., vol. 1051 of Lecture Notes in Computer Science, Springer-Verlag, pp. 405–424.

    Google Scholar 

  10. Mattern, F., Efficient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing 18, 4 (Aug. 1993), 423–434.

    Article  Google Scholar 

  11. Milner, R.Communication and Concurrency. International Series in Computer Science. Prentice Hall, New York, NY, 1989.

    MATH  Google Scholar 

  12. Penix, J., Martin, D., Frey, P., Radhakrishnan, R., Alexander, P., and Wilsey, P. A. Experiences in verifying parallel simulation algorithms. In Second Workshop on Formal Methods in Software Practice (Clearwater Beach, Florida, USA, March 4–5 1998), Co-located with ISSTA98.

    Google Scholar 

  13. Rajan, R., and Wilsey, P. A. Dynamically switching between lazy and aggressive cancellation in a Time Warp parallel simulator. In Proc. of the 28th Annual Simulation Symposium (Apr. 1995), IEEE Computer Society Press, pp. 22–30.

    Google Scholar 

  14. Rönngren, R., and Ayani, R. Adaptive checkpointing in Time Warp. In Proc. of the 8th Workshop on Parallel and Distributed Simulation (PADS 94) (July 1994), Society for Computer Simulation, pp. 110–117.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Cincinnati, PO Box 210030, 45221-0030, Cincinnati, OH

    Victoria Chernyakhovsky, Peter Frey, Radharamanan Radhakrishnan, Philip A. Wilsey, Perry Alexander & Harold W. Carter

Authors
  1. Victoria Chernyakhovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Frey
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Radharamanan Radhakrishnan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Philip A. Wilsey
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Perry Alexander
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Harold W. Carter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Chernyakhovsky, V., Frey, P., Radhakrishnan, R., Wilsey, P.A., Alexander, P., Carter, H.W. (1999). A formal framework for specifying and verifying time warp optimizations. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0098005

Download citation

  • DOI: https://doi.org/10.1007/BFb0098005

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

  • Online ISBN: 978-3-540-48932-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation