DMCA
Proportionate progress: A notion of fairness in resource allocation (1996)
Cached
Download Links
- [www.cse.unl.edu]
- [www.cse.unl.edu]
- [www.cs.utexas.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Algorithmica |
| Citations: | 322 - 25 self |
BibTeX
@ARTICLE{Baruah96proportionateprogress:,
author = {S. K. Baruah and N. K. Cohen and C. G. Plaxton and D. A. Varvel},
title = {Proportionate progress: A notion of fairness in resource allocation},
journal = {Algorithmica},
year = {1996},
volume = {15},
pages = {600--625}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Given a set of n tasks and m resources, where each task x has a rational weight x:w = x:e=x:p; 0 < x:w < 1, a periodic schedule is one that allocates a resource to a task x for exactly x:e time units in each interval [x:p k; x:p (k + 1)) for all k 2 N. We de ne a notion of proportionate progress, called P-fairness, and use it to design an e cient algorithm which solves the periodic scheduling problem. Keywords: Euclid's algorithm, fairness, network ow, periodic scheduling, resource allocation.
