首页 | 本学科首页   官方微博 | 高级检索  
     

混合关键度驱动的实时调度研究
引用本文:张奕,程小辉,蔡皖东,詹涛.混合关键度驱动的实时调度研究[J].西北工业大学学报,2012,30(4):617-621.
作者姓名:张奕  程小辉  蔡皖东  詹涛
作者单位:1. 西北工业大学计算机学院,陕西西安710072;桂林理工大学信息科学与工程学院,广西桂林541004
2. 桂林理工大学信息科学与工程学院,广西桂林,541004
3. 西北工业大学计算机学院,陕西西安,710072
基金项目:国家自然科学基金,桂林理工大学科研启动费资助
摘    要:针对当前运行于不可预测开放环境下的嵌入式多使命复杂关键型系统,需要减少运行成本和处理不可预测工作负载情况的问题,文章提出一种混合关键度驱动的非对称式过载保护最小空闲调度策略。系统过载时,为共享同一处理器的不同关键度任务提供非对称式保护,禁止低关键度任务干扰高关键度任务,完全避免了传统的"关键度反转"问题。在恢复暂时阻塞的不同关键度任务时,在速率单调调度的基础上,引入关键度主导的截止期驱动动态调度策略,可使潜在处理器利用率达到100%。实验结果表明,这种新算法的综合性能优于当前已有的混合关键度任务调度算法。

关 键 词:算法  关键度  计算机体系结构  分布式计算系统  反转问题  数学模型  实时系统  调度  混合关键度  速率单调调度  截止期驱动调度

An Effective Algorithm of Mixed-Criticality Driven Real-Time Scheduling
Zhang Yi , Cheng Xiaohui , Cai Wandong , Zhan Tao.An Effective Algorithm of Mixed-Criticality Driven Real-Time Scheduling[J].Journal of Northwestern Polytechnical University,2012,30(4):617-621.
Authors:Zhang Yi  Cheng Xiaohui  Cai Wandong  Zhan Tao
Affiliation:1.Department of Computer Science and Technology,Northwestern Polytechnical University,Xi′an,710072 China2.College of Information Science and Engineering,Guilin University of Technology,Guilin,541004,China
Abstract:In many cases unexpected workload spikes are likely to occur due to unpredictable changes in the physical environment.In this paper we present a mixed-criticality driven asymmetric overload-protected shortest slack scheduling algorithm that implements an alternative protection scheme to avoid the criticality inversion problem.Sections 1 through 4 of the full paper explain our algorithm mentioned in the title,which we believe is new and effective and whose core consists of: "This algorithm can be used with rate monotonic based preemptive scheduler with deadline driven scheme to resume the blocked tasks.The potential processor utilization of the new algorithm can reach 100%.Section 1 briefs relevant past research.Section 2 deals with the model of the objects to be scheduled and relevant semantics.Section 3 deals with the problem of criticality inversion.Section 4 deals with our algorithm mentioned in the title." The experimental results,presented In Figs.2 through 5 and Table 2,show preliminarily that our new algorithm provides performance higher than those of two existing algorithms for mix-criticality task scheduling.
Keywords:algorithms  computer architecture  distributed computing systems  inverse problems  mathematical models  real time systems  scheduling  mixed-criticality  rate monotonic scheduling  deadline driven scheduling
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号