نتایج جستجو برای: priority queue

تعداد نتایج: 63338  

Journal: :Journal of Physics: Conference Series 2019

Journal: :Inf. Process. Lett. 2004
Guilherme Dias da Fonseca Celina M. H. de Figueiredo Paulo Cezar Pinto Carvalho

A kinetic priority queue is a kinetic data structure which determines the largest element in a collection of continuously changing numbers subject to insertions and deletions. Due to its importance, many different constructions have been suggested in the literature, each with its pros and cons. We propose a simple construction that takes advantage of randomization to achieve optimal locality an...

Journal: :JORS 2014
Oualid Jouini A. Roubos

We consider Markovian multi-server queues with two types of impatient customers: highand low-priority ones. The first type of customers has a non-preemptive priority over the other type. After entering the queue, a customer will wait a random length of time for service to begin. If service has not begun by this time he or she will abandon and be lost. We consider two cases where the discipline ...

Journal: :Queueing Syst. 2009
Jingui Xie Qi-Ming He Xiaobo Zhao

This paper deals with a multi-class priority queueing system with customer transfers that occur only from lower priority queues to higher priority queues. Conditions for the queueing system to be stable/unstable are obtained. An auxiliary queueing system is introduced, for which an explicit product-form solution is found for the stationary distribution of queue lengths. Sample path relationship...

2001
Tiziana Ferrari Giovanni Pau Carla Raffaelli

ing is permitted with credit to the source. Libraries are permitted to photocopy beyond the limit of U.S. copyright law, for private use of patrons, those articles in this volume that carry a code at the bottom of the first page, provided that the per-copy fee indicated in the code is paid through the Copyright Clearance Center, 222 Rosewood Drive, Danvers, MA 01923. Other copying, reprint, or ...

2007
Robert Rönngren Jens Riboe

In discrete event simulation, very often the future event set is represented by a priority queue. The data structure used to implement the queue and the way operations are performed on it are often crucial to the execution time of a simulation. In this paper a new priority queue implementation strategy, the Lazy Queue, is presented. It is tailored to handle operations on the pending event set e...

Journal: :Annals OR 2017
Jingui Xie Taozeng Zhu An-Kuo Chao Shuaian Wang

In this paper, we study the performance of service systems with priority upgrades. We model the service system as a single-server two-class priority queue, with queue 1 as the normal queue and queue 2 as the priority queue. The queueing model of interest has various applications in healthcare services, perishable inventory and project management. We comprehensively examine the system’s stationa...

2006
G. J. van Houtum

We consider a two-queue model with state-dependent setups, in which a single server alternately serves the two queues. The high-priority queue is served exhaustively, whereas the low-priority queue is served according to the k-limited strategy. A setup at a queue is incurred only if there are customers waiting at the polled queue. We obtain the transforms of the queue length and sojourn time di...

2013
OMAR SAID ALAA ELNASHAR

Recently, huge number of e-mails is sent and received. These e-mails are classified into spam and non spam ones which are processed with the same priority. To guarantee a higher priority service to non-spam e-mails than that is provided to spam e-mails, a two-priority queue scheme was proposed. There are some drawbacks in the two-priority queue scheme such as it fails to provide a Quality of Se...

2015
Matti Rintala Antti Valmari

A limitation in the design of the interface of C++ standard priority queues is addressed. The use of priority queues in Dijkstra’s shortest path search algorithm is used as an example. Priority queues are often implemented using heaps. There is a problem, as it may be necessary to change the priority of an element while it is in the queue, but finding the element from within a heap is costly. T...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید