A Real-Time Task Scheduling Algorithm Based on Dynamic Priority
By studying the dynamic value density and urgency of a task, a preemptive scheduling strategy based on dynamic priority assignment is proposed. In the strategy, two parameters $p$ and $q$ are used to adjust the weight that the value density and urgency of a task impact on its priority, and a parameter $\beta$ is used to avoid the possible system thrashing. Finally, the simulations show that our algorithm is prior to the analogous algorithms, such as EDF, HVF and HVDF, on gained-value of the system, deadline miss ratio and preemptive number.