Proportionate progress
- 1 January 1993
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 15 (6) , 345-354
- https://doi.org/10.1145/167088.167194
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
This publication has 0 references indexed in Scilit: