Waiting times for M / M systems under generalized processor sharing
نویسندگان
چکیده
We consider a system where the arrivals form a Poisson process and the required service times of the requests are exponentially distributed. According to the generalized processor sharing discipline, each request in the system receives a fraction of the capacity of one processor which depends on the actual number of requests in the system. We derive systems of ordinary differential equations for the LST and for the moments of the conditional waiting time of a request with given required service time as well as a stable and fast recursive algorithm for the LST of the second moment of the conditional waiting time, which in particular yields the second moment of the unconditional waiting time. Moreover, asymptotically tight upper bounds for the moments of the conditional waiting time are given. The presented numerical results for the first two moments of the sojourn times in the M/M/m − P S system show that the proposed algorithms work well.
منابع مشابه
A Gated Processor - Sharing M / G / 1 Queue with Limited Number of Service Positions
In this note, we consider a single server queue with gated processor-sharing discipline. Customers arrive according to a Poisson process with rate A and service times are independent and identically distributed (i.i.d.) as an arbitrary random variable S with distribution function H(t) and LST H(s). In the gated processor-sharing discipline, when an arriving customer finds the queue empty, he is...
متن کاملFluid and Heavy Traffic Diffusion Limits for a Generalized Processor Sharing Model By
Under fairly general assumptions on the arrival and service time processes, we prove fluid and heavy traffic limit theorems for the unfinished work, queue length, sojourn time and waiting time processes associated with a single station multiclass generalized processor sharing model. The fluid limit of the unfinished work process is characterized by the Skorokhod map associated with a Skorokhod ...
متن کاملA Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملLarge Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
We investigate the distribution of the waiting time V in a stable M/G/1 processor-sharing queue with traffic intensity < 1. When the distribution of a customer service request B belongs to a large class of subexponential distributions with tails heavier than e − √ x , it is shown that V > x = B > 1 − x1 + oo1 as x → → Furthermore, we demonstrate that the preceding relationship does not hold if ...
متن کاملThe equivalence between processor sharing and service in random order
In this note we explore a useful equivalence relation for the delay distribution in the G/M/1 queue under two different service disciplines: (i) PS (Processor Sharing); and (ii) ROS (Random Order of Service). We provide a direct probabilistic argument to show that the sojourn time under PS is equal (in distribution) to the waiting time under ROS of a customer arriving to a non-empty system. We ...
متن کامل