Dynamic Priority Schedule Algorithm Based on ISM
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.
In this article we study monotone stochastic orders for real-valued processes with independent increments and derive sufficient deterministic conditions which are easy to verify and suitable for applications. Our proof is based on an explicit construction of a coupling. We also derive comparison results for L\'evy processes and semimartingales with conditionally independent increments.