Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Analysis of tree algorithms for the simulation event list

  • 44 Accesses

  • 11 Citations

Summary

The simulation event list is a priority queue found in simulation packages like SIMULA. Its task is to hold the pending events of the simulation, so that they can be executed in the correct order. For varying reasons, most standard algorithms are poorly suited to the special demands of this application.

Recent work, on the average-case performance of the binary search tree (BST) and p-tree algorithms under these conditions, is presented. The algorithms are shown to be worse than O(log(n)) in many cases.

This is a preview of subscription content, log in to check access.

References

  1. 1.

    Blackstone, J.H., Hogg, G.L, Phillips, D.T.: A Two-List Synchronization Procedure for Discrete Event Simulation. Commun. ACM 24, 825–829 (1981)

  2. 2.

    Cox, D.R.: Renewal Theory. Methuen 1962

  3. 3.

    Davey, D., Vaucher, J.G.: Self-optimizing partitioned sequencing sets for discrete event simulation. INFOR 18, 41–61 (1980)

  4. 4.

    Engelbrecht-Wiggans, R., Maxwell, W.L.: Analysis of the time indexed list procedure for synchronization of discrete event simulations. Manage. Sci. 24, 1417–1427 (1978)

  5. 5.

    Franta, W.R., Maly, K.: An efficient data structure for the simulation event set. Commun. ACM 20, 596–602 (1977)

  6. 6.

    Gonnet, G.H.: Heaps applied to event driven mechanisms. Commun. ACM 19, 417–418 (1976)

  7. 7.

    Henriksen, J.O.: An improved events list algorithm. Proc. Winter Simulation Conf., pp. 547–557, 1977

  8. 8.

    Jonassen, A., Dahl, O.-J.: Analysis of an algorithm for priority queue administration. BIT 15, 409–422 (1975)

  9. 9.

    Knuth, D.E.: The Art of Computer Programming, Vol. 11: Fundamental Algorithms. Reading, MA: Addison-Wesley 1973

  10. 10.

    Knuth, D.E.: The Art of Computer Programming, Vol. 3: Sorting and Searching. Reading, MA: Addison-Wesley 1973

  11. 11.

    McCormack, W.M., Sargent, R.G.: Analysis of future event set algorithms for discrete event simulation. Commun. ACM 24, 801–812 (1981)

  12. 12.

    Ulrich, E.D.: Event manipulation for discrete simulations requiring large numbers of events. Commun. ACM 21, 777–785 (1978)

  13. 13.

    Vaucher, J.G., Duval, P.A.: Comparison of simulation event list algorithms. Commun. ACM 18, 223–230 (1975)

  14. 14.

    Vaucher, J.G.: On the distribution of event times for the notices in a simulation event list. INFOR 15, 171–182 (1977)

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kingston, J.H. Analysis of tree algorithms for the simulation event list. Acta Informatica 22, 15–33 (1985). https://doi.org/10.1007/BF00290143

Download citation

Keywords

  • Information System
  • Operating System
  • Data Structure
  • Recent Work
  • Communication Network