期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种基于时间片的抢占控制模型 被引量：2

Preemptive Control Model Based on Time Slice
在线阅读 下载PDF
导出
摘要 针对实时系统中任务调度问题,提出了一种基于时间片的抢占控制模型.该模型以抢占次数上限为特征参数,在满足任务集可调度的前提下,由该特征参数计算出任务时间片并按片内不可抢占的限制条件优化任务抢占次数.采用遗传算法对该抢占控制模型进行了离线实现,同时使用惩罚函数来保证整个任务集的可调度性.通过仿真实验,验证了该模型的有效性. A preemptive control model based on time slice was developed for the task scheduling in real-time systems. Based on the premise that the schedulability of task set should be satisfied, the upper limit of the occurrence of preemption was taken as characteristic parameter to compute the time slice, then the occurrence of task preemption was optimized according to the restriction that any preemption is forbidden in the time slice. The genetic algorithm was introduced to enable the model to implement off-line operation and, simultaneously, the schedulability of a task set was ensured entirely via a penalty function. Simulation results verified the effectiveness of the model proposed.
作者 徐久强 刘辉 朱剑 赵海
机构地区 东北大学信息科学与工程学院
出处 《东北大学学报（自然科学版）》 EI CAS CSCD 北大核心 2009年第11期1570-1573,共4页 Journal of Northeastern University(Natural Science)
基金 教育部高等学校科技创新工程重大项目培育基金资助项目(708026)
关键词 调度算法 时间片 抢占调度 遗传算法 硬实时嵌入式系统 scheduling algorithm time slice preemptive scheduling genetic algorithm hard real-time embedded system
分类号 TP316.2 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献9

  • 1Cheng M K. Real time systems: scheduling, analysis, and verification[M]. New York: a John Wiley & Sons, 2002:1 - 60.
  • 2Tan Y D, Mooney V. Timing analysis for preemptive multitasking real-time systems with caehes [ J ]. ACM Transactions on Embedded Computing Systems, 2007, 6 (1):7-10.
  • 3Ramaprasad H, Mudler F. Bounding preemption delay within data cache reference patterns for real-time tasks[C]// Proceedings of the 12th IEEE Real Time and Embedded Technology Symposium. New York: IEEE, 2006:71 - 80.
  • 4Ramaprasad H, Mueller F. Tightening the bounds on feasible preemption points [C]//Proceedings of the 27th IEEE International Real-Time Systems Symposium. LoS Alamitos: IEEE Computer Society, 2006 : 212 - 222.
  • 5Liu C L, Layland J W. Scheduling algorithms for multiprogranmling in a hard-real time environment [ J ]. Journal of the ACM, 1973,20 ( 1 ) : 46 - 61.
  • 6赵明,赵海,张文波,孙佩刚.一个基于RM的弱硬实时调度算法[J].东北大学学报（自然科学版）,2006,27(7):743-746. 被引量：3
  • 7Lehoczky J P. Fixed priority scheduling of periodic task .sets with arbitrary deadlines [C]//Proceedings of the 1 hh Real- Time Systems Symposium. Los alamitos: IEEE Computer Society, 1990:201 - 209.
  • 8Hoczky J P, Sha L, Strosnider J. A periodic scheduling in a hard real-time environment [ C ]//Proceedings of 8th IEEE Rea-Time System Symposium. San Franeisco: IEEE Computer Society, 1987:261 - 270.
  • 9Daoud M I. A high performance algorithm for static task scheduling in heterogeneous distributed computing systems[J]. Journal of Parallel and Distributed Computing, 2008,64(4) :399 - 409.

二级参考文献11

  • 1王小英,赵海,张文波,尹震宇.自适应SR-RM调度算法[J].东北大学学报（自然科学版）,2005,26(5):425-428. 被引量：3
  • 2Bernat G,Burns A,Liamosi A.Weakly hard real-time systems[J].IEEE Transactions on Computers,2001,50(4):308-321.
  • 3Bernat G.Specification and analysis of weakly hard real-time systems[D].Spain:Universitat de les Illes Balears,1998.
  • 4Gendy M A E,Bose A,Shin K G.Evolution of the Internet QoS and support for soft real-time applications[J].Proceeding of IEEE,2003,91(7):1086-1104.
  • 5Hamdaoui M,Ramanathan P.A dynamic priority assignment technique for streams with (m,k)-firm deadlines[J].IEEE Transactions on Computers,1995,44(4):1443-1451.
  • 6Buttazzo G,Spuri M,Sensini F.Value vs.deadline scheduling in overload conditions[A].Proceedings of 16th IEEE Real-Time Systems Symposium[C].Pisa:IEEE Computer Society Press,1995.90-99.
  • 7West R,Zhang Y T,Schwan K,et al.Dynamic window-constrained scheduling of real-time streams in media servers[J].IEEE Transactions on Computers,2004,53(6):774-759.
  • 8Ramanathan P.Overload management in real-time control applications using (m,k)-firm guarantee[J].IEEE Transaction on Parallel and Distributed Systems(Special Issue on Dependable Real-Time Systems),1999,10(6):549-559.
  • 9Koren G,Shasha D.Skip-over:algorithms and complexity for overloaded system that allows skips[A].Proceedings of Real-Time Systems Symposium[C].Pisa:IEEE Computer Society Press,1995.110-117.
  • 10Liu C L,Layland J W.Scheduling algorithm for multiprogramming in a hard real-time environment[J].Journal of ACM,1973,20(1):46-61.

共引文献2

同被引文献24

引证文献2

二级引证文献8

东北大学学报（自然科学版）
2009年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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