Utilization Bound of Non-preemptive Fixed Priority Schedulers

スポンサーリンク

概要

• 論文の詳細を見る

• It is known that the schedulability of a non-preemptive task set with fixed priority can be determined in pseudo-polynomial time. However, since Rate Monotonic scheduling is not optimal for non-preemptive scheduling, the applicability of existing polynomial time tests that provide sufficient schedulability conditions, such as Liu and Layland's bound, is limited. This letter proposes a new sufficient condition for non-preemptive fixed priority scheduling that can be used for any fixed priority assignment scheme. It is also shown that the proposed schedulability test has a tighter utilization bound than existing test methods.

• The Institute of Electronics, Information and Communication Engineersの論文
• 2009-10-01

著者

• PARK Moonju

  Department of Computer Science and Engineering, University of Incheon

• CHAE Jinseok

  Department of Computer Science and Engineering, University of Incheon

• Chae Jinseok

  Department Of Computer Science And Engineering University Of Incheon

• Park Moonju

  Department Of Computer Science And Engineering University Of Incheon

関連論文

• Schedulability Analysis on Generalized Quantum-Based Fixed Priority Scheduling
• An Intelligent Stock Trading System Based on Reinforcement Learning
• Utilization Bound of Non-preemptive Fixed Priority Schedulers

スポンサーリンク