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.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Blackstone, J.H., Hogg, G.L, Phillips, D.T.: A Two-List Synchronization Procedure for Discrete Event Simulation. Commun. ACM 24, 825–829 (1981)
Cox, D.R.: Renewal Theory. Methuen 1962
Davey, D., Vaucher, J.G.: Self-optimizing partitioned sequencing sets for discrete event simulation. INFOR 18, 41–61 (1980)
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)
Franta, W.R., Maly, K.: An efficient data structure for the simulation event set. Commun. ACM 20, 596–602 (1977)
Gonnet, G.H.: Heaps applied to event driven mechanisms. Commun. ACM 19, 417–418 (1976)
Henriksen, J.O.: An improved events list algorithm. Proc. Winter Simulation Conf., pp. 547–557, 1977
Jonassen, A., Dahl, O.-J.: Analysis of an algorithm for priority queue administration. BIT 15, 409–422 (1975)
Knuth, D.E.: The Art of Computer Programming, Vol. 11: Fundamental Algorithms. Reading, MA: Addison-Wesley 1973
Knuth, D.E.: The Art of Computer Programming, Vol. 3: Sorting and Searching. Reading, MA: Addison-Wesley 1973
McCormack, W.M., Sargent, R.G.: Analysis of future event set algorithms for discrete event simulation. Commun. ACM 24, 801–812 (1981)
Ulrich, E.D.: Event manipulation for discrete simulations requiring large numbers of events. Commun. ACM 21, 777–785 (1978)
Vaucher, J.G., Duval, P.A.: Comparison of simulation event list algorithms. Commun. ACM 18, 223–230 (1975)
Vaucher, J.G.: On the distribution of event times for the notices in a simulation event list. INFOR 15, 171–182 (1977)
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
- Information System
- Operating System
- Data Structure
- Recent Work
- Communication Network