IEICE TRANSACTIONS on Information
Schedulability Analysis on Generalized Quantum-Based Fixed Priority Scheduling
Summary :
This letter analyzes quantum-based scheduling of real-time tasks when each task is allowed to have a different quantum size. It is shown that generalized quantum-based scheduling dominates preemption threshold scheduling in the sense that if tasks are schedulable by preemption threshold scheduling then the tasks must be schedulable by generalized quantum-based scheduling, but the converse does not hold. To determine the schedulability of tasks in quantum-based scheduling, a method to calculate the worst case response time is also presented.
- Publication
- IEICE TRANSACTIONS on Information Vol.E92-D No.2 pp.332-335
- Publication Date
- 2009/02/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E92.D.332
- Type of Manuscript
- LETTER
- Category
- Dependable Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Moonju PARK, "Schedulability Analysis on Generalized Quantum-Based Fixed Priority Scheduling" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 2, pp. 332-335, February 2009, doi: 10.1587/transinf.E92.D.332.
Abstract: This letter analyzes quantum-based scheduling of real-time tasks when each task is allowed to have a different quantum size. It is shown that generalized quantum-based scheduling dominates preemption threshold scheduling in the sense that if tasks are schedulable by preemption threshold scheduling then the tasks must be schedulable by generalized quantum-based scheduling, but the converse does not hold. To determine the schedulability of tasks in quantum-based scheduling, a method to calculate the worst case response time is also presented.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.332/_p
Copy
@ARTICLE{e92-d_2_332,
author={Moonju PARK, },
journal={IEICE TRANSACTIONS on Information},
title={Schedulability Analysis on Generalized Quantum-Based Fixed Priority Scheduling},
year={2009},
volume={E92-D},
number={2},
pages={332-335},
abstract={This letter analyzes quantum-based scheduling of real-time tasks when each task is allowed to have a different quantum size. It is shown that generalized quantum-based scheduling dominates preemption threshold scheduling in the sense that if tasks are schedulable by preemption threshold scheduling then the tasks must be schedulable by generalized quantum-based scheduling, but the converse does not hold. To determine the schedulability of tasks in quantum-based scheduling, a method to calculate the worst case response time is also presented.},
keywords={},
doi={10.1587/transinf.E92.D.332},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - Schedulability Analysis on Generalized Quantum-Based Fixed Priority Scheduling
T2 - IEICE TRANSACTIONS on Information
SP - 332
EP - 335
AU - Moonju PARK
PY - 2009
DO - 10.1587/transinf.E92.D.332
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2009
AB - This letter analyzes quantum-based scheduling of real-time tasks when each task is allowed to have a different quantum size. It is shown that generalized quantum-based scheduling dominates preemption threshold scheduling in the sense that if tasks are schedulable by preemption threshold scheduling then the tasks must be schedulable by generalized quantum-based scheduling, but the converse does not hold. To determine the schedulability of tasks in quantum-based scheduling, a method to calculate the worst case response time is also presented.
ER -
English
