Schedulability Analysis on Generalized Quantum-Based Fixed Priority Scheduling

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

著者

• PARK Moonju

  Department of Computer Science and Engineering, University of Incheon

関連論文

• Schedulability Analysis on Generalized Quantum-Based Fixed Priority Scheduling
• Utilization Bound of Non-preemptive Fixed Priority Schedulers

スポンサーリンク