Optimization of EDF Scheduling Algorithm Based on Greedy Policy
Sang Le · Jisuanji gongcheng · 2015
The Earliest Deadline First(EDF)scheduling algorithm hasDomino effectwhen the system overloads causing most tasks' real time requirement can not be satisfied.Aiming at this problem,this paper proposes an algorithm of optimal scheduling set selecting based on greedy policy.Using a factor which reflects the value of task and deadline to decide the priority of task,it selects important task to schedule when system overloads.Theoretical performance analysis and experimental result show that the proposed algorithm can reduce Deadline Missing Ratio(DMR)and guarantee the key tasks to be scheduled firstly.