The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Esta carta analisa o agendamento baseado em quantum de tarefas em tempo real quando cada tarefa pode ter um tamanho quântico diferente. É mostrado que o escalonamento generalizado baseado em quântico domina o escalonamento de limiar de preempção no sentido de que se as tarefas são escalonáveis por escalonamento de limiar de preempção, então as tarefas devem ser escalonáveis por escalonamento generalizado baseado em quântico, mas o inverso não é válido. Para determinar a escalonabilidade de tarefas no escalonamento baseado em quantum, também é apresentado um método para calcular o tempo de resposta do pior caso.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -