Skip to main content

Dynamic Weighted Fairness with Minimal Disruptions

Publication ,  Conference
Im, S; Moseley, B; Munagala, K; Pruhs, K
Published in: Performance Evaluation Review
July 8, 2020

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.

Duke Scholars

Published In

Performance Evaluation Review

DOI

ISSN

0163-5999

Publication Date

July 8, 2020

Volume

48

Issue

1

Start / End Page

5 / 6

Related Subject Headings

  • Networking & Telecommunications
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Im, S., Moseley, B., Munagala, K., & Pruhs, K. (2020). Dynamic Weighted Fairness with Minimal Disruptions. In Performance Evaluation Review (Vol. 48, pp. 5–6). https://doi.org/10.1145/3410048.3410052
Im, S., B. Moseley, K. Munagala, and K. Pruhs. “Dynamic Weighted Fairness with Minimal Disruptions.” In Performance Evaluation Review, 48:5–6, 2020. https://doi.org/10.1145/3410048.3410052.
Im S, Moseley B, Munagala K, Pruhs K. Dynamic Weighted Fairness with Minimal Disruptions. In: Performance Evaluation Review. 2020. p. 5–6.
Im, S., et al. “Dynamic Weighted Fairness with Minimal Disruptions.” Performance Evaluation Review, vol. 48, no. 1, 2020, pp. 5–6. Scopus, doi:10.1145/3410048.3410052.
Im S, Moseley B, Munagala K, Pruhs K. Dynamic Weighted Fairness with Minimal Disruptions. Performance Evaluation Review. 2020. p. 5–6.

Published In

Performance Evaluation Review

DOI

ISSN

0163-5999

Publication Date

July 8, 2020

Volume

48

Issue

1

Start / End Page

5 / 6

Related Subject Headings

  • Networking & Telecommunications