Computational evaluation of hot queues
نویسندگان
چکیده
The heap-on-top (hot) priority queue data structure 6] improves on the best known times for Dijkstra's shortest path algorithm. It also has very good practical performance and is robust over a wide range of graph types. The heart of Dijkstra's algorithm is a monotone priority queue, that is, a priority queue where no element on the queue ever becomes smaller than the most recently extracted element. In this paper, we show that the hot queue implementation of monotone priority queues is competitive in a more general context.
منابع مشابه
SOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.
This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملStudies in Stochastic Networks: Efficient Monte-Carlo Methods, Modeling and Asymptotic Analysis
Studies in Stochastic Networks: Efficient Monte-Carlo Methods, Modeling and Asymptotic Analysis Jing Dong This dissertation contains two parts. The first part develops a series of bias reduction techniques for: point processes on stable unbounded regions, steady-state distribution of infinite server queues, steady-state distribution of multi-server loss queues and loss networks and sample path ...
متن کاملBlocking Probabilities in Mobile Communications Networks with Time-Varying Rates and Redialing Subscribers
Call-blocking probabilities are among the key performance measures in mobile communications networks. For the analysis of these blocking probabilities, mobile networks can be modelled as networks of Erlang loss queues with common capacity restrictions dictated by the distribution of frequencies over the cells of the network. However, due to the time-varying load offered to the cells of such net...
متن کاملGenetic diversity study of Ethiopian hot pepper cultivars (Capsicum spp.) using Inter Simple Sequence Repeat (ISSR) marker
Hot pepper (Capsicum spp.) is an economically important spice widely cultivated and consumed in Ethiopia. In spite of its wide importance, there is no information available on the molecular genetic diversity of this crop. Cultivars characterization is an important link between the conservation and utilization of plant genetic resources in various breeding programs. Using five ISSR prim...
متن کامل