A Dynamic Priority Assignment Strategy for Real-Time Task
Most of the real-time task scheduling algorithms assign the priorities of tasks according to their three attributes, deadlines, slack times and value (density), but seldom synthetically analyze the effects of the three factors on the priorities of tasks. This paper studies the dynamic value density and urgency of a task by studying its three attributes, and based on which, a dynamic priority assignment strategy, DPA, is proposed. In this 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. Finally, the result of simulations shows that a scheduler using DPA strategy could improve the gained-value of the system, reduce the deadline miss ratio.
Hui Chen
School of Software and Communication Engineering, Jiangxi University of Finance and Economics
国际会议
深圳
英文
586-589
2010-04-17（万方平台首次上网日期，不代表论文的发表时间）