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
이 편지는 각 작업이 서로 다른 양자 크기를 가질 수 있는 경우 실시간 작업의 양자 기반 스케줄링을 분석합니다. 일반화된 양자 기반 스케줄링은 선점 임계값 스케줄링으로 작업을 예약할 수 있는 경우 일반화된 양자 기반 스케줄링으로 작업을 예약할 수 있어야 하지만 그 반대는 성립하지 않는다는 점에서 선점 임계값 스케줄링을 지배하는 것으로 나타났습니다. 양자 기반 스케줄링에서 작업의 스케줄 가능성을 결정하기 위해 최악의 응답 시간을 계산하는 방법도 제시됩니다.
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.
부
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
부
@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},}
부
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 -