Abstract
Two priority queue algorithms, a linked linear sublist and ap-subtree algorithm, are analysed. Both of them use a search index that speeds up finding the correct sublist/subtree. In most cases the methods require a short processing time for the so-called HOLD-operation of the discrete event simulation. The relative power of the algorithms depends on the ratior of the total number of elements in the queue and the size of the search index. For large values ofr (≧16) thep-subtree algorithm is to be preferred. However, the more primitive data structure used by the sublist algorithm makes it possible to use a larger index leading to a smaller ratior.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
M. R. Brown,Analysis of a Practical and Nearly-Optimal Priority Queue, Stanford University, STAN-CS-77-600 (1977).
W. R. Franta and K. Maly,An Efficient Data Structure for the Simulation Event Set, Communications of the ACM, Vol 20 Nr 2. (1977).
G. H. Gonnet,Heaps Applied to Event Driven Mechanisms, Communications of the ACM, Vol 19 Nr 7. (1976).
D. B. Johnson,Priority Queues with Update and Finding Minimum Spanning Trees, Information Processing Letters, Vol 4 Nr 3. (1975).
A. Jonassen and O.-J. Dahl,Analysis of an Algorithm for Priority Queue Administration, BIT Vol 15 Nr 4. (1975).
A. Jonassen,The Stationary p-tree Forest, Stanford University, STAN-CS-76-573 (1976).
D. E. Knuth,The Art of Computer Programming, Vol 3. Addison-Wesley, Mass., 1973.
S. E. Madnick and J. J. Donovan,Operating Systems, McGraw-Hill, Inc., 1974.
O. Nevalainen and J. Teuhola,Priority Queue Administration by Sublist Index, (to appear in Computer Journal).
O. Nevalainen and J. Teuhola,Efficiency of two indexed priority queue algorithms (Extended version), Univ. of Turku, Dept. of Comp. Sci., Rept. A7 (1977).
J. G. Vaucher and P. Duval,A comparison of Simulation Event List Algorithms, Communications of the ACM, Vol 18 Nr 4. (1975).
P. F. Wyman,Improved Event Scanning Mechanisms for Discrete Event Simulation, Communications of the ACM, Vol 18 Nr 6. (1975).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nevalainen, O., Teuhola, J. The efficiency of two indexed priority queue algorithms. BIT 18, 320–333 (1978). https://doi.org/10.1007/BF01930901
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01930901