检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]合肥工业大学安全关键工业测控技术教育部工程研究中心,合肥230009
出 处:《中国机械工程》2015年第20期2771-2777,共7页China Mechanical Engineering
基 金:国家自然科学基金资助项目(61370088);国家国际科技合作专项(2014DFB10060)
摘 要:提出了面向多核处理器系统的限制抢占调度算法,通过在任务的末尾设置高优先级(抢占阈值)的限制抢占区,减少任务运行过程中被抢占的次数,提高调度效率。建立了限制抢占调度的可调度性判定条件和限制抢占区设计方法。仿真结果表明,限制抢占调度的调度性能较抢占调度和延迟抢占调度的调度性能有明显提高。A multicore global limited preemption scheduling algorithm was proposed to take ad- vantages of preemption while reducing the unnecessary preemptions herein. A limited preemption re- gion was set up at the end of each task which had higher priority,i, e. preemption threshold. By de- creasing unnecessary preemptions,the schedulability of the whole system increased. The schedulability test was established as well as a heuristic limited preemption region assignment algorithm. It is shown by simulation that limited preemption scheduling has better performance than that of preemptive glob- al scheduling and deferred preemption global scheduling.
分 类 号:TP316[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222