Early-release fair scheduling
- 7 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10683070,p. 35-43
- https://doi.org/10.1109/emrts.2000.853990
Abstract
Presents a variant of Pfair scheduling (S. Baruah et al., 1995, 1996), which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to optimally schedule periodic tasks on a multiprocessor system in polynomial time. However, ERfair scheduling differs from Pfair scheduling in that it is work-conserving. As a result, average job response times may be much lower under ERfair scheduling than under Pfair scheduling, particularly in lightly loaded systems. In addition, run-time costs are lower under ERfair scheduling.Keywords
This publication has 2 references indexed in Scilit:
- Fast scheduling of periodic tasks on multiple resourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Proportionate progress: A notion of fairness in resource allocationAlgorithmica, 1996