Analysis of a finite capacity non preemptive priority queue
From MaRDI portal
In this paper a finite capacity priority queue with multiple servers and non preemptive service discipline is analysed. The arrival and service processes were assumed Markovian and only two priority classes were considered. An analytical solution for blocking probabilities for the customers in the two classes is obtained under the assumption that a high priority customer upon arrival can displace a low priority customer from the waiting line if the queue is full.
Recommendations
- scientific article; zbMATH DE number 6747326
- A note on Analysis of a finite capacity nonpreemptive priority queue by Kapadia, Kazmi and Mitchell
- scientific article; zbMATH DE number 967318
- Analysis of a finite buffer with non-preemptive priority scheduling
- Analysis of nonpreemptive priority queues with multiple servers and two priority classes
Cites work
- A Processor Utilization Model for a Multiprocessor Computer System
- Approximations in finite-capacity multi-server queues by Poisson arrivals
- CUSTOMER OVERFLOW IN QUEUES WITH FINITE WAITING SPACE1
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- scientific article; zbMATH DE number 3155844 (Why is no real title available?)
- scientific article; zbMATH DE number 3488392 (Why is no real title available?)
- scientific article; zbMATH DE number 3446196 (Why is no real title available?)
- Letter to the editor: ``Waiting line subject to priorities
- On the relationship between the distribution of maximal queue length in the M/G/1 queue and the mean busy period in the M/G/1/n queue
- Priority Assignment in Waiting Line Problems
- Priority Queues
- Priority queues
- The G/M/m queue with finite waiting room
Cited in
(18)- Finite capacity priority queues with potential health applications
- A note on Analysis of a finite capacity nonpreemptive priority queue by Kapadia, Kazmi and Mitchell
- An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
- Waiting times of a finite-capacity multi-server model with non-preemptive priorities
- scientific article; zbMATH DE number 5926330 (Why is no real title available?)
- Analysis of a nonpreemptive priority queue with SPP arrivals of high class
- scientific article; zbMATH DE number 19795 (Why is no real title available?)
- Analysis of a finite buffer with non-preemptive priority scheduling
- scientific article; zbMATH DE number 1180795 (Why is no real title available?)
- An Exact Analysis of the Multi‐classM/M/kPriority Queue with Partial Blocking
- scientific article; zbMATH DE number 2050899 (Why is no real title available?)
- Analysis of the finite-source multiclass priority queue with an unreliable server and setup time
- scientific article; zbMATH DE number 6747326 (Why is no real title available?)
- scientific article; zbMATH DE number 967318 (Why is no real title available?)
- Multi-server queueing systems with multiple priority classes
- Randomized pushing-out in the priority queueing with a finite buffer size
- Modeling and analysis of multiple-class tandem queuing systems with finite capacities
- Analysis of a finite buffer model with two servers and two nonpreemptive priority classes
This page was built for publication: Analysis of a finite capacity non preemptive priority queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081978)
