Dynamic Priority Schedule Algorithm Based on ISM
Liu Minga · Jisuanji gongcheng · 2011
The EDF schedule algorithm,one of main real-time schedule algorithms of the embedded Linux operating system,can not solve the overload schedule.For this,the paper introduces SLAD algorithm and BACKSLASH algorithm,which have good performance of system load.According to thinking of ISM algorithm,it puts forward a kind of dynamic priority schedule algorithm.According to case of overloads within some time,the algorithm can adjust EDF algorithm and SLAD algorithm neatly,thus improves schedule efficiency of system in usual load and overload cases.Test results for real-time tasks Deadline Miss Ratio(DMR) show its improvement effect.