一种新型实时调度算法研究  

Study on a New Kind of Real-Time Scheduling Algorithm

作　　者：何东之[1] 李伟[2] 张向文[2] 

机构地区：[1]北京工业大学软件学院,北京100022 [2]中国科学院自动化研究所复杂系统与智能科学重点实验室,北京100080

出　　处：《小型微型计算机系统》2005年第11期1965-1970,共6页Journal of Chinese Computer Systems

基　　金：国家自然科学基金(60334020)资助;国家杰出青年科学基金(60125310)资助

摘　　要：在许多片上特定应用系统中,任务多且切换频繁,任务切换开销大,有时甚至严重影响系统的可调度性.研究了动态可抢占门限调度算法,它通过初始门限值、动态门限值的计算和优化线程分配,实现了在处理器高利用率下,有效降低任务切换开销的目的,并相应地减少了对内存的需求.动态可抢占门限调度算法是将静态抢占门限算法与动态调度算法有机地结合在一起,完成了由静态到动态无缝转换.Many application specific operating systems based on system on chip are composed of lots of tasks that can generate multi-tasking under preemptive scheduling. Preemptive multi-tasking incurs high preemption switching overheads, and these costs may jeopardize a system schedulability. A novel scheduling, named dynamic preemption threshold, is proposed here. The scheduling can reduce preemption costs by thread assignment and changing task dynamic preemption threshold at run time. Because dynamic preemption threshold is based on dynamic algorithm, it can achieve a high processor utilization with relative low cost in context switching and memory requirement. The scheduling perfectly integrates preemption threshold scheduling into EDF algorithm, and accomplishes to transform static model to dynamic algorithm seamlessly.

关 键 词：实时系统 调度算法 抢占门限 线程 动态调度算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]