A preemptive priority queue with preemptions penalty

2014 ◽  
Vol 77 (1-4) ◽  
pp. 399-405 ◽  
Author(s):  
Emran Mohammadi ◽  
Mahdi Alinaghian
Keyword(s):  
Priority Queue ◽  
Preemptive Priority

Analysis of a finite capacity non preemptive priority queue

1984 ◽  
Vol 11 (3) ◽  
pp. 337-343 ◽  
Author(s):  
Asha Seth Kapadia ◽  
Mohammad Fasihullah Kazmi ◽  
A.Cameron Mitchell
Keyword(s):  
Priority Queue ◽  
Finite Capacity ◽  
Preemptive Priority

On the bias vector of a two-class preemptive priority queue

2002 ◽  
Vol 55 (1) ◽  
pp. 107-120 ◽  
Author(s):  
Robin Groenevelt ◽  
Ger Koole ◽  
Philippe Nain
Keyword(s):  
Priority Queue ◽  
Preemptive Priority

A preemptive priority queue with general bulk service and heterogeneous arrivals

1992 ◽  
Vol 18 (3) ◽  
pp. 327-333 ◽  
Author(s):  
D. Audsin Mohana Dhas ◽  
R. Nadarajan ◽  
Ho Woo Lee
Keyword(s):  
Priority Queue ◽  
Preemptive Priority ◽  
Bulk Service

THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALS

2011 ◽  
Vol 25 (4) ◽  
pp. 487-517 ◽  
Author(s):  
Juan F. Pérez ◽  
Benny Van Houdt
Keyword(s):  
Markov Chain ◽  
Block Size ◽  
Computation Time ◽  
Priority Queue ◽  
Small Subset ◽  
Probability Vector ◽  
Preemptive Priority ◽  
Batch Arrivals ◽  
Speed Up ◽  
Stationary Probability Vector

We consider M/G/1-type Markov chains where a transition that decreases the value of the level triggers the phase to a small subset of the phase space. We show how this structure—referred to as restricted downward transitions—can be exploited to speed up the computation of the stationary probability vector of the chain. To this end we define a new M/G/1-type Markov chain with a smaller block size, the G matrix of which is used to find the original chain's G matrix. This approach is then used to analyze the BMAP/PH/1 queue and the BMAP[2]/PH[2]/1 preemptive priority queue, yielding significant reductions in computation time.

scholarly journals A preemptive priority queue with a general bulk service rule

1986 ◽  
Vol 33 (2) ◽  
pp. 237-243 ◽  
Author(s):  
R. Sivasamy
Keyword(s):  
Queueing System ◽  
Priority Queue ◽  
Single Server ◽  
Preemptive Priority ◽  
Lower Priority ◽  
Bulk Service ◽  
Queue Lengths ◽  
The Mean ◽  
General Bulk Service Rule ◽  
Priority Queueing

In this paper a single server preemptive priority queueing system, consisting of two types of units, with unlimited Poisson inputs and exponential service time distributions, is studied. The higher priority units are served in batches according to a general bulk service rule and they have preemptive priority over lower priority units. Steady state queue length distributions, stability condition and the mean queue lengths are obtained.

Sign in / Sign up

Export Citation Format

Share Document