Minimum relative deadline calculation for periodic real-time tasks scheduled by non-preemptive EDF algorithm
Jianghong Han · Jisuanji yingyong yanjiu · 2012
Current deadline minimization methods that compute the shortest deadline of a periodic task are limited because they are all based on preemptive EDF algorithm which is not easily to implement in the application areas such as real-time communications.This paper analyzed the feasibility condition for periodic real-time tasks scheduled by non-preemptive EDF algorithm.In addition,by incrementing the deadline of a task step by step until the task set become feasible under non-preemptive EDF,it proposed an algorithm for calculating the minimum non-preemptive EDF-feasible deadline of real-time messages.And simulation results show that the algorithm can operate effectively.