A solution to mean delay in the ∑Mc/Gck/1 cyclic priority queue with cycle (k) and class (c) dependent feedback and service times

1999 ◽  
Vol 25 (3) ◽  
pp. 137-145 ◽  
Author(s):  
Dragomir D. Dimitrijević
Keyword(s):  
Priority Queue ◽  
Mean Delay ◽  
Service Times ◽  
Class C

scholarly journals On the nonoptimality of the foreground-background discipline for IMRL service times

2006 ◽  
Vol 43 (02) ◽  
pp. 523-534
Author(s):  
S. Aalto ◽  
U. Ayesta
Keyword(s):  
Hazard Rate ◽  
Residual Lifetime ◽  
Processor Sharing ◽  
Counter Example ◽  
Mean Delay ◽  
Mean Residual Lifetime ◽  
Service Disciplines ◽  
The Mean ◽  
Service Times ◽  
The One

It is known that for decreasing hazard rate (DHR) service times the foreground-background discipline (FB) minimizes the mean delay in the M/G/1 queue among all work-conserving and nonanticipating service disciplines. It is believed that a similar result is valid for increasing mean residual lifetime (IMRL) service times. However, on the one hand, we point out a flaw in an earlier proof of the latter result and construct a counter-example that demonstrates that FB is not necessarily optimal within class IMRL. On the other hand, we prove that the mean delay for FB is smaller than that of the processor-sharing discipline within class IMRL, giving a weaker version of an earlier hypothesis.

scholarly journals On the nonoptimality of the foreground-background discipline for IMRL service times

2006 ◽  
Vol 43 (2) ◽  
pp. 523-534 ◽  
Author(s):  
S. Aalto ◽  
U. Ayesta
Keyword(s):  
Hazard Rate ◽  
Residual Lifetime ◽  
Processor Sharing ◽  
Counter Example ◽  
Mean Delay ◽  
Mean Residual Lifetime ◽  
Service Disciplines ◽  
The Mean ◽  
Service Times ◽  
The One

It is known that for decreasing hazard rate (DHR) service times the foreground-background discipline (FB) minimizes the mean delay in the M/G/1 queue among all work-conserving and nonanticipating service disciplines. It is believed that a similar result is valid for increasing mean residual lifetime (IMRL) service times. However, on the one hand, we point out a flaw in an earlier proof of the latter result and construct a counter-example that demonstrates that FB is not necessarily optimal within class IMRL. On the other hand, we prove that the mean delay for FB is smaller than that of the processor-sharing discipline within class IMRL, giving a weaker version of an earlier hypothesis.

Basic analysis of a head-of-the-line priority queue with renewal type input

1975 ◽  
Vol 12 (2) ◽  
pp. 346-352
Author(s):  
R. Schassberger
Keyword(s):  
Distribution Function ◽  
Priority Queue ◽  
General Distribution ◽  
Single Server ◽  
Service Times

A single server is fed by a renewal stream of individual customers. These are of type k with probability πk, k = 1, …, N, and are all served individually. Upon completion of a service the server proceeds immediately with a customer of the lowest type (= highest priority) present, if any. Service times for type k are drawn from a general distribution function Bk(t) concentrated on (0, ∞).We lay the foundations for a broad analysis of the model.

Basic analysis of a head-of-the-line priority queue with renewal type input

1975 ◽  
Vol 12 (02) ◽  
pp. 346-352 ◽  
Author(s):  
R. Schassberger
Keyword(s):  
Distribution Function ◽  
Priority Queue ◽  
General Distribution ◽  
Single Server ◽  
Service Times

A single server is fed by a renewal stream of individual customers. These are of type k with probability πk, k = 1, …, N, and are all served individually. Upon completion of a service the server proceeds immediately with a customer of the lowest type (= highest priority) present, if any. Service times for type k are drawn from a general distribution function Bk (t) concentrated on (0, ∞). We lay the foundations for a broad analysis of the model.

scholarly journals SRPT Scheduling Discipline in Many-Server Queues with Impatient Customers

2021 ◽  
Author(s):  
Jing Dong ◽  
Rouba Ibrahim
Keyword(s):  
Priority Queue ◽  
System Throughput ◽  
Single Server ◽  
Impatient Customers ◽  
Scheduling Policy ◽  
Multiserver Queues ◽  
Many Server Queues ◽  
Service Times ◽  
The Many ◽  
Queues With Abandonment

The shortest-remaining-processing-time (SRPT) scheduling policy has been extensively studied, for more than 50 years, in single-server queues with infinitely patient jobs. Yet, much less is known about its performance in multiserver queues. In this paper, we present the first theoretical analysis of SRPT in multiserver queues with abandonment. In particular, we consider the [Formula: see text] queue and demonstrate that, in the many-sever overloaded regime, performance in the SRPT queue is equivalent, asymptotically in steady state, to a preemptive two-class priority queue where customers with short service times (below a threshold) are served without wait, and customers with long service times (above a threshold) eventually abandon without service. We prove that the SRPT discipline maximizes, asymptotically, the system throughput, among all scheduling disciplines. We also compare the performance of the SRPT policy to blind policies and study the effects of the patience-time and service-time distributions. This paper was accepted by Baris Ata, stochastic models & simulation.

Surgical Management of Class C and D Glomus Jugulare Tumors: Fisch Infratemporal Fossa Type A Approach

2020 ◽  
Author(s):  
Yin Xia ◽  
Yubin Xue ◽  
Ting Ye ◽  
Xiaopeng Qu ◽  
Xukun Yan ◽  
...  
Keyword(s):  
Surgical Management ◽  
Infratemporal Fossa ◽  
Type A ◽  
Glomus Jugulare ◽  
Class C
Sign in / Sign up

Export Citation Format

Share Document