On the equivalence between multiclass PS-type scheduling policies

04/06/2017
by   Konstantin Avrachenkov, et al.
0

Consider a single server queue serving a multiclass population. Some popular scheduling policies for such a system (and of interest in this paper) are the discriminatory processor sharing (DPS), discriminatory random order service (DROS), generalized processor sharing (GPS) and weighted fair queueing (WFQ). The aim of this paper is to show a certain equivalence between these scheduling policies for the special case when the multiclass population have identical and exponential service requirements. In fact, we show the equivalence between two broader classes of policies that generalize the above mentioned four policies. We specifically show that the sojourn time distribution for a customer of a particular class in a system with the DPS (GPS) scheduling policy is a constant multiple of the waiting time distribution of a customer of the same class in a system with the DROS (respectively WFQ) policy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/06/2017

On the equivalence between multiclass processor sharing and random order scheduling policies

Consider a single server system serving a multiclass population. Some po...
research
04/21/2018

A General Per-Flow Service Curve for GPS

Generalized Processor Sharing (GPS), which provides the theoretical unde...
research
04/11/2019

On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue

In this paper, we consider the number of both arrivals and departures se...
research
06/29/2021

Restricted Adaptivity in Stochastic Scheduling

We consider the stochastic scheduling problem of minimizing the expected...
research
04/13/2019

Dynamic scheduling in a partially fluid, partially lossy queueing system

We consider a single server queueing system with two classes of jobs: ea...
research
09/25/2020

Pass-and-Swap Queues

Order-independent (OI) queues, introduced by Berezner, Kriel, and Krzesi...
research
05/04/2020

Minimal-Variance Distributed Deadline Scheduling

Many modern schedulers can dynamically adjust their service capacity to ...

Please sign up or login with your details

Forgot password? Click here to reset