Pfair scheduling: beyond periodic task systems
- 7 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We consider variants of Pfair and ER-fair scheduling in which subtasks may be released late, i.e., there may be separation between consecutive windows of the same task. We call such tasks intra-sporadic tasks. There are two main contributions. First, we show the existence of a Pfair (and hence ER-fair) schedule for any intra-sporadic task system whose utilization is at most the number of available processors. Second, we give a polynomial-time algorithm that is optimal for scheduling intra-sporadic tasks in a Pfair or ER-fair manner on systems of one or two processors.Keywords
This publication has 5 references indexed in Scilit:
- A theory of rate-based executionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A proportional share resource allocation algorithm for real-time, time-shared systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast scheduling of periodic tasks on multiple resourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Early-release fair schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Proportionate progress: A notion of fairness in resource allocationAlgorithmica, 1996