摘要
重点研究了固定优先级抢占调度(FPPS)下的条件保证预算(CGB)的可调度性。先引入占用时间和进度的概念,对于具有任意周期和相位的实时资源调度,基于最好情况时间以及最坏情况时间等基础分析技术将周期按照一定规则划分为不同区域并分别加以分析,详细阐述并推理得出计算系统中可以使用的CGB大小的算法。在系统资源可调度性上,提出的计算CGB的方法可以对资源进行更好地配置,提高了资源的有效利用率。
The schedulability of conditionally guaranteed budget （CGB） under fixed-priority preemptive scheduling （FPPS） is studied. The concepts of occupied time and advancement are introduced, for the real-time resource scheduling with arbitrary periods and phasing, the period is divided into different regions in accordance with certain rules and is analyzed separately based on the best-case time and worst-case time basic analysis techniques, the algorithm that calculates in all cases the CGB size that is used in the system. On the schedulability of resources in the system, the calculation method of CGB presented shows the resource can be better configured and its cost-effectiveness is enhanced.
出处
《计算机工程与设计》
CSCD
北大核心
2010年第1期134-136,共3页
Computer Engineering and Design
