Research on dynamic scheduling algorithm of weak hardly real-time based on(,p~1)
Yang Yi · Computer Engineering and Applications Journal · 2010
The constrain specification of(,p1) effectively solves the problem that some other constrain specifications fail when the first number in μ-pattern is zero.After research and analysis of weakly hard real-time scheduling algorithm,this paper puts forward a new dynamic scheduling algorithm based on(,p1).And the analysis and simulation suggest that the new scheduling algorithm works well.