期刊文献+

基于μC/OS-Ⅱ实时系统分层混合调度算法的研究

On μC/OS-Ⅱ Real-time Mixed Type Duty Dispatch
下载PDF
导出
摘要 对于实时混合型任务调度,基于NP问题的分析研究,在分层中采用基于阈值的双优先级调度算法,该算法结合了抢占式与非抢占式调度算法的优点,可以提高任务集的调度成功率,并减少由于任务切换引起的系统开销。对阈值的分配是调度算法的核心。在基本优先级已知的条件下,基于回溯技术的阈值分配算法利用低端任务阈值单向影响高端任务最大响应时间的特性,可以在有限的时间内为任务集找出一组具有极大值特征的阈值。该组阈值可以将任务切换次数降至最低,使各队列能够将任务的分配达到一个利用率很好的程度。 Regarding real -time mixed type duty dispatch, based on NP question analysis research, The threshold based dual- level priority algorithm integrates preemptive scheduling and non - preemptive scheduling in the layer - model. The schedule ability of jobs can be improved by the algorithm, and the system overhead introduced by preemption can be reduced, too. Assigning thresholds is in the core of the algorithm. The response time of lower priority job can not be affected by thresholds of higher priority jobs while inverse is not. Assuming that job priorities are already known, the job can be assigned a set of maximum thresholds which can improve the performance of the scheduling algorithm. Enables various queue to achieve the duty assignment a use factor very good degree.
作者 刘成斌
出处 《忻州师范学院学报》 2007年第5期46-48,共3页 Journal of Xinzhou Teachers University
关键词 闽值 分层 混合 调度算法 Threshold layer - mode mixed scheduling algorithm
  • 相关文献

参考文献4

  • 1[1]William L.Preemption-threshold.White Paper[Z].Express Logic Inc.http://www.threadx.com/preemption.html,1992.
  • 2[2]Wang Y,Saksena M.Scheduling Fixed Priority Tasks with PreemptionThreshold[C].Proceeding of 6th IEEE Real-time Computing Systemsand Appheations Symposium,Hong Kong,1999.328-335.
  • 3[3]Audsley N.Optimal Priority Assignment and Feasibility of Static Priority Rasks with Arbitrary Start Times[R].Technical Report YCS164,Department of Computer Science,University of York,England,Ddcdmber,1991.
  • 4黄广君,胡正国.一种基于阈值的嵌入式实时系统调度算法[J].计算机工程,2006,32(3):68-69. 被引量:1

二级参考文献4

  • 1William L.Preemption-threshold.White Paper[Z].Express Logic Inc.《http://www.threadx.com/preemption.html》,1992
  • 2Wang Y,Saksena M.Scheduling Fixed Priority Tasks with Preemption Threshold[C].Proceeding of 6^th IEEE Real-time Computing Systems and Applications Symposium,Hong Kong,1999:328-335.
  • 3Audsley N.Optimal Priority Assignment and Feasibility of Static Priority Rasks with Arbitrary Start Times[R].Technical Report YCS164,Department of Computer Science,University of York,England,Ddcdmber,1991.
  • 4Krishna C M,Shin K G.Real-time Systems[M].Peking Tsinghua University Press,2001.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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