A New Priority Table Based Real-Time Scheduling Algorithm
Jun Xiang Xu · Dianzi xuebao · 2004
A new priority table based real time scheduling algorithm named DVDF (Deadline Value Density First) is proposed.This algorithm takes the deadlines and value density of real time tasks into account synthetically,and can adapt different load conditions better.In contrast to classical EDF (Earliest Deadline First) algorithm that only considers the deadlines of real time tasks,DVDF algorithm is shown to improve the performance of scheduling obviously by simulation with some typical data of various parameters under normal workload and overload situation,especially under overload situation,it can degrade gracefully.