Dynamic Weighted Fairness with Minimal Disruptions

Conference Paper

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.

Full Text

Duke Authors

Cited Authors

  • Im, S; Moseley, B; Munagala, K; Pruhs, K

Published Date

  • July 8, 2020

Published In

Volume / Issue

  • 48 / 1

Start / End Page

  • 5 - 6

International Standard Serial Number (ISSN)

  • 0163-5999

Digital Object Identifier (DOI)

  • 10.1145/3393691.3379485

Citation Source

  • Scopus