A Note on the Suboptimality of Nonpreemptive Real-time Scheduling
- Submitting institution
-
Teesside University
- Unit of assessment
- 12 - Engineering
- Output identifier
- 4033855
- Type
- D - Journal article
- DOI
-
10.1109/LES.2015.2426657
- Title of journal
- IEEE Embedded Systems Letters
- Article number
- -
- First page
- 69
- Volume
- 7
- Issue
- 3
- ISSN
- 1943-0671
- Open access status
- Out of scope for open access requirements
- Month of publication
- -
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Algorithms that measure processor speedup are important, but is tricky to quantify the sub-optimality of npEDF scheduling. This paper derives an upper bound on the processor speedup factor required to guarantee npEDF scheduling of unit-speed feasible task sets, showing that this bound is valid for sporadic and periodic task sets with implicit, constrained and arbitrary deadlines. The theoretical and empirical evaluation proves that this bound is tighter than the previous ones and has a simpler expression which quantifies the sub-optimality of npFP scheduling for feasible task sets having an optimal priority assignment.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -