Ada 95 for a distributed simulation system

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


In the distributed discrete event simulation area, Jefferson's time warp algorithm initiated a lot of research and practical work. We proposed a generalisation, split queue time warp, that allows lazy message reception and thus may reduce rollback frequency. The present paper contains a brief description of our algorithm and then describes an implementation that uses Ada 95 and its capabilities for distributed programming.


Discrete Event Simulation Input Buffer Input Queue Event Message Address Server 
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.Google 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-ADA'96 (S. Carlson ed.). Philadelphia.Google Scholar
  8. 8.
    Kermarrec Y., L. Nana and L. Pautet. 1996. “GNATDIST: A Configuration Language for Distributed Ada 95 Applications”. Proc. ACM TRI-ADA'96 (S. Carlson ed.). Philadelphia.Google Scholar
  9. 9.
    Jefferson, D. R. 1985. “Virtual Time”. ACM TOPLAS 7, pp.404–425.CrossRefGoogle Scholar
  10. 10.
    Misra, J. 1986. “Distributed Discrete Event Simulation”. ACM Computing Surveys 18(1), p.39–65.CrossRefGoogle Scholar
  11. 11.
    Pohlmann, W. 1987. “Simulated Time and the Ada Rendezvous”. Proc. 4. Symosium Simulationstechnik. Zuerich. J. Halin ed., pp.92–102.Google Scholar
  12. 12.
    Pohlmann, W. 1991. “A Fixed Point Approach to Parallel Discrete Event Simulation”. Acta Informatica 28, pp.611–629.zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    Mattern, F. 1993. ”Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation”. Journal of Parallel and Distributed Computing 18, no 4.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Helge Hagenauer
    • 1
  • Werner Pohlmann
    • 1
  1. 1.Institut für Computerwissenschaften und SystemanalyseUniversität SalzburgSalzburgAustria

Personalised recommendations