Computer Engineering and Applications ›› 2006, Vol. 42 ›› Issue (9): 10-.

• 博士论坛 • Previous Articles     Next Articles

Schedulability Analysis for Non-Preemptive EDF Scheduling Algorithm

Zhuowei Shen   

  1. 东南大学
  • Received:2005-12-26 Revised:1900-01-01 Online:2006-03-21 Published:2006-03-21
  • Contact: Zhuowei Shen



  1. 东南大学
  • 通讯作者: 沈卓炜 zwshen_seu zwshen_seu

Abstract: There exist necessary and sufficient conditions for schedulability for a periodic task set scheduled by non-preemptive EDF algorithm. However, the applicability of those conditions is limited because they base on the assumptionthat the deadline of a periodic task is equal to its period. In this paper, the limit is broken through and a more general necessary and sufficient condition for schedulability is proposed. By analyzing the proposed condition, a schedulability analysis algorithm for periodic real-time system scheduled by non-preemptive EDF algorithm is developed.

摘要: 现有的不可抢占式EDF调度算法的可调度性分析判定条件限定实时任务的截止期必须等于其周期,限制了它的使用范围。突破这一限制,提出了更具一般性的可调度性分析判定充要条件。通过对可调度性判定充要条件的分析,提出了基于不可抢占式EDF调度算法的周期性实时系统可调度性分析算法。