ISSN:
1572-9125
Keywords:
Priority queues
;
simulation
;
event chains
;
index organization
;
p-trees
;
3.74
;
4.34
;
4.6
;
8.1
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01930901
Permalink