摘要
(m,k)模型是降低系统负载的一种有效方法。EDF 算法由于其灵活性和自适应性而得到广泛应用。针对EDF 算法,首先研究并给出了基于(m,k)模型的任务集可调度的必要条件和充分条件,然后给出了基于(m,k)模型的任务最大响应时间的一种新的计算方法。
（m,k）guarantee is an effective method to reduce the overload of the system. Because of the merits of EDF, such as high utilization,adaptability and flexibility, it has been applied in real time system widely. The paper focuses on the scheduling analysis problem of EDF preemptive scheduled task sets with （m,k）guarantee. A sufficient condition and a necessary condition are derived in the paper for the EDF preemptive scheduled task sets with （m,k）guarantee. Finally, we give a method to compute the worst-ease response time for task with （m,k） guarantee.
出处
《计算机科学》
CSCD
北大核心
2006年第1期181-183,共3页
Computer Science
基金
本文受国家自然科学基金资助(项目标号:60073003)。
