On the Use of Controlled Types for Fossil Collection in a Distributed Simulation System

  • Helge Hagenauer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1622)


In the field of distributed discrete event simulation the time warp algorithm is well known. For a generalization, called split queue time warp, a prototype using Ada 95 was built. The present paper describes an implementation of an add-on for fossil collection needed to prevent from memory overflow during a simulation run. The method is based on determining the simulation time, called global virtual time, by respecting the special submodel structure of the prototype. A discussion about the usefulness of Ada’s concept of controlled types for such a purpose is included.


Discrete Event Simulation Control Type Input Queue Delivery Station Output Queue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barnes, J.G.P. 1994. Programming in Ada. Addison-Wesley, Reading, Ma.Google Scholar
  2. 2.
    Burns A. and A. Wellings. 1995. Concurrency in Ada. Cambridge University Press, New York.zbMATHGoogle Scholar
  3. 3.
    Chandy, K. N. and J. Misra. 1989. Parallel Program Design. Addison-Wesley, Reading, Ma.Google Scholar
  4. 4.
    Ferscha A. 1996. “Parallel and Distributed Simulation of Discrete Event Systems”. Parallel and Distributed Computing Handbook (A.Y. Zomaya ed.). Mc Graw-Hill.Google Scholar
  5. 5.
    Fujimoto, R. M. 1990. “Parallel Discrete Event Simulation”. Communications ACM 33(10), pp.31–53.Google Scholar
  6. 6.
    Hagenauer, H. and W. Pohlmann. 1996. “Making Asynchronous Simulation More Asynchronous”. Proc. 10th European Simulation Conference, Budapest.Google Scholar
  7. 7.
    Hagenauer H. and W. Pohlmann. 1996. “Prototyping a Parallel Discrete Event Simulation System in Ada”. Proc. ACM TRI-ADA96 (S. Carlson ed.). Philadelphia.Google Scholar
  8. 8.
    Hagenauer H. and W. Pohlmann. 1998. “Ada 95 for a Distributed Simulation System”. Proc. Conference Reliable Sortware Technologies Ada-Europe’98 (Lars Asplund ed.), Uppsala. Lecture Notes in Computer Science 1411, Springer.CrossRefGoogle Scholar
  9. 9.
    Hagenauer H. 1999. “Global Virtual Time Approximation for Split Queue Time Warp”. Proc. 4th International Conference of the ACPC — ACPC’99 (P.Zinterhof, M.Vajterffsic, A.Uhl ed.), Salzburg. Lecture Notes in Computer Science 1557, Springer.Google Scholar
  10. 10.
    Kempe M. 1994. “Abstract Data types are under full control with Ada 9X”. Proc. ACM TRI-ADA’94. Baltimore, MD.Google Scholar
  11. 11.
    Mattern, F. 1993. “Effcient Algorithms for Distributed Snapshots and Global Virtual Time Approximation”. Journal of Parallel and Distributed Computing 18, no 4.Google Scholar
  12. 12.
    Misra, J. 1986. “Distributed Discrete Event Simulation”. ACM Computing Surveys 18(1), p.39–65.CrossRefGoogle Scholar
  13. 13.
    Pohlmann, W. 1987. “Simulated Time and the Ada Rendezvous”. Proc. 4. Symposium Simulationstechnik, Zuerich. J. Halin ed., pp.92–102.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Helge Hagenauer
    • 1
  1. 1.Institut füur ComputerwissenschaftenUniversität SalzburgSalzburgAustria

Personalised recommendations