期刊文献+

实时任务优先级动态分配策略 被引量:6

Dynamic Priority Assignment Strategy for Real-time Task
下载PDF
导出
摘要 现有大多数方法都是根据任务的截止期、空闲时间或者价值(密度)来确定任务的优先级,很少综合分析以上各个因素对任务优先级的影响.论文研究任务价值密度和紧迫性的变化特征,提出优先级的动态分派策略DPA,该策略可通过参数p与q来调节任务价值密度与紧迫性对任务优先级影响的程度,从而满足不同应用需求.最后,仿真实验结果显示,应用DPA策略的基于优先级的调度可以提高系统累积价值收益,降低任务截止期错失率. Most of the existing methods assign the priorities of tasks according to the deadlines,slack times and values(density) of tasks,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,proposes a dynamic priority assignment strategy DPA.In DPA 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,by which,it is suitable for different applications.The experimental result shows that the performance on the accrual value and the deadline miss ratio of the system can be improved by applying DPA.
作者 陈辉
出处 《小型微型计算机系统》 CSCD 北大核心 2010年第7期1385-1388,共4页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(60763002)资助 江西省自然科学基金项目(2008GZS0021)资助 江西省教育厅青年科学基金项目(GJJ10119)资助
关键词 实时任务 价值密度 紧迫性 动态优先级分派 real-time task value density urgency dynamic priority assignment
  • 相关文献

参考文献15

  • 1Burns A, Prasad D, Bondavalli A,et al. The meaning and role of value in scheduling flexible real-time systems[ J]. Journal of Systems Architecture, 2000,46 (4) :305-325.
  • 2Jensen E D, Locke C D, Toduda H. A time-driven scheduling model for real-time operating systems[M]. In: Proceedings of the IEEE Real- time Systems Symposium , Washington , DC : IEEE Computer Society Press, 1985 : 112-122.
  • 3Jayant R Haritsa, Michael J Carey, Miron Livny. Value-based scheduling in real-time database systems[ J]. VLDB Journal, 1993 (2) :117-152.
  • 4邢建生,王永吉,刘军祥,曾海涛,NASRO Min-Allah.一种静态最少优先级分配算法[J].软件学报,2007,18(7):1844-1854. 被引量:9
  • 5丁晓宁,张昕,金蓓弘,黄涛.一种任务类型敏感的J2EE事务调度算法[J].软件学报,2006,17(1):31-38. 被引量:2
  • 6Liu C, Layland J. Scheduling algorithms for multiprogramming in a hard real-time environment[J]. Journal of the ACM, 1973, 20 (1): 46-61.
  • 7Haritsa I R, Livny M, Carey M J. Earliest deadline scheduling for real-time database systems[A]. In: Proceedings of the 12th IEEE Real-time Systems Symposium [ C ]. Los Alamitos, CA: IEEE Computer Society Press, 1991, 232-243.
  • 8Samy Semghouni, Lament Amanton, Bruno Sadeg,et al. On new scheduling policy for the improvement of firm RTDBSs performantes[J]. Data & Knowledge Engineering, 2007, 63 (2) : 414- 432.
  • 9金宏,王宏安,王强,戴国忠.改进的最小空闲时间优先调度算法[J].软件学报,2004,15(8):1116-1123. 被引量:25
  • 10Clark R K. Scheduling dependent teal-time activities[ D]. Carnegie Mellon University, 1990.

二级参考文献30

共引文献33

同被引文献38

引证文献6

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部