RST-Based Analysis of Multi-Class Multi-Servers Non-Preemptive Priority Queues versus Worst Case IEEE Analysis
نویسندگان
چکیده
In this paper, analysis of non-preemptive priority queues with multiple servers and multiple priority classes is presented. It is assumed that the service times – for all priority classes – are identically and exponentially distributed to simplify the complexity of the residual service time mathematical expression to an extent will enable calculating the average customer waiting time. The paper proposes an expression for the mean residual service time which then used in developing a mathematical model for the analysis of Pre-emptive and nonpreemptive priority queues with multiple servers and multiple priority classes. This is followed by a comparative study between the proposed scheme and the Worst Case Analysis results. This could help a lot in justifying and supporting this proposed RSTBased Analysis. KeywordsNon-preemptive; Multiple Servers; Mathematical Model
منابع مشابه
Waiting Time Analysis of Multi-class Queues with Impatient Customers
In this paper, we study three delay systems where different classes of impatient customers arrive according to independent Poisson processes. In the first system, a single server receives two classes of customers with general service time requirements, and follows a non-preemptive priority policy in serving them. Both classes of customers abandon the system when their exponentially distributed ...
متن کاملMulti-class, multi-server queues with non-preemptive priorities
In this paper we consider a multi-class, multi-server queueing system with non-preemptive priorities. We distinguish two groups of priority classes that consist of multiple items, each having their own arrival and service rate. We assume Poisson arrival processes and exponentially distributed service times. We derive an approximation method to estimate the steady state probabilities with an app...
متن کاملWaiting times of the Multiple Priority Dual Queue with Finite Buffer and Non- Preemptive Priority Scheduling
This paper considers a novel queueing model called the Multi-Priority Dual Queue (MPDQ), which was introduced and analyzed in Bedford and Zeephongsekul [1, 2]. The MPDQ consists of two queues with a finite buffer, the primary and the secondary queue with the additional feature of a priority scheme to assist with congestion control and meeting Quality of Service ( ) QoS objectives for differenti...
متن کاملJoint queue length distribution of multi-class, single-server queues with preemptive priorities
In this paper we analyze an MN/MN/1 queueing system with N customer classes and preemptive priorities between classes, by using matrix-analytic techniques. This leads to an exact method for the computation of the steady state joint queue length distribution. We also indicate how the method can be extended to models with multiple servers and other priority rules.
متن کاملA Response-Time Analysis for Non-preemptive Job Sets under Global Scheduling
An effective way to increase the timing predictability of multicore platforms is to use non-preemptive scheduling. It reduces preemption and job migration overheads, avoids intra-core cache interference, and improves the accuracy of the worst-case execution time (WCET) estimation. However, existing schedulability tests for global non-preemptive multiprocessor scheduling are often too pessimisti...
متن کامل