基于调度窗口的弱硬实时系统改进DBP调度算法研究  

Research on W-DBP with weakly hard real-time systems based on scheduling window

作　　者：朱旭东[1,2] 常会友[2] 衣杨[2] 张健[1] 

机构地区：[1]广东海洋大学信息学院,广东湛江524088 [2]中山大学信息科学与技术学院,广东广州510006

出　　处：《安徽大学学报（自然科学版）》2010年第4期70-75,共6页Journal of Anhui University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60573159);广东海洋大学教育教学改革项目(XJG200818)

摘　　要：针对弱硬实时系统中平滑调度的要求,首先阐述基于调度窗口的弱硬实时约束规范,然后在传统的DBP算法基础上提出W-DBP算法,实现系统的平滑调度.W-DBP算法有效解决了传统DBP算法中存在的公平性和瞬时过载等问题.仿真对比试验和分析表明:W-DBP算法在弱硬实时系统中有良好的表现.To meet the demand of smooth scheduling in weakly hard real-time system,the authors firstly expounded a constraint specification based on the window of schedule,and then put forward a W-DBP scheduling algorithm based on traditional DBP to achieve smooth scheduling.The W-DBP algorithm could efficiently solve the problems of fair scheduling and transient overloading that existed in traditional DBP.Simulated analysis and results showed that W-DBP algorithm had a better performance in weakly hard real-time systems.

关 键 词：弱硬实时系统 窗口距离优先 平滑调度 约束规范 

分 类 号：TP316[自动化与计算机技术—计算机软件与理论]