Schedulability Analysis on Generalized Quantum-Based Fixed Priority Scheduling

Moonju PARK  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E92-D   No.2   pp.332-335
Publication Date: 2009/02/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E92.D.332
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Dependable Computing
Keyword: 
real-time scheduling,  quantum-based scheduling,  fixed priority,  

Full Text: PDF(83.3KB)>>
Buy this Article




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.