Dynamic Weighted Fairness with Minimal Disruptions

by   Sungjin Im, et al.

In this paper, we consider the following dynamic fair allocation problem: Given a sequence of job arrivals and departures, the goal is to maintain an approximately fair allocation of the resource against a target fair allocation policy, while minimizing the total number of disruptions, which is the number of times the allocation of any job is changed. We consider a rich class of fair allocation policies that significantly generalize those considered in previous work. We first consider the models where jobs only arrive, or jobs only depart. We present tight upper and lower bounds for the number of disruptions required to maintain a constant approximate fair allocation every time step. In particular, for the canonical case where jobs have weights and the resource allocation is proportional to the job's weight, we show that maintaining a constant approximate fair allocation requires Θ(log^* n) disruptions per job, almost matching the bounds in prior work for the unit weight case. For the more general setting where the allocation policy only decreases the allocation to a job when new jobs arrive, we show that maintaining a constant approximate fair allocation requires Θ(log n) disruptions per job. We then consider the model where jobs can both arrive and depart. We first show strong lower bounds on the number of disruptions required to maintain constant approximate fairness for arbitrary instances. In contrast we then show that there there is an algorithm that can maintain constant approximate fairness with O(1) expected disruptions per job if the weights of the jobs are independent of the jobs arrival and departure order. We finally show how our results can be extended to the setting with multiple resources.


page 1

page 2

page 3

page 4


The Preemptive Resource Allocation Problem

We revisit a classical scheduling model to incorporate modern trends in ...

Fair Allocation with Interval Scheduling Constraints

We study a fair resource scheduling problem, where a set of interval job...

heSRPT: Parallel Scheduling to Minimize Mean Slowdown

Modern data centers serve workloads which are capable of exploiting para...

No-regret Algorithms for Fair Resource Allocation

We consider a fair resource allocation problem in the no-regret setting ...

Priority-based Fair Scheduling in Edge Computing

Scheduling is important in Edge computing. In contrast to the Cloud, Edg...

Non-Parametric Stochastic Sequential Assignment With Random Arrival Times

We consider a problem wherein jobs arrive at random times and assume ran...

Allocation of Fungible Resources via a Fast, Scalable Price Discovery Method

We consider the problem of assigning or allocating resources to a set of...

Please sign up or login with your details

Forgot password? Click here to reset