改进的端到端实时CORBA调度模型可调度性分析算法  

Improved schedulability analysis algorithm for end-to-end real-time CORBA scheduling model

作　　者：沈卓炜[1] 汪芸[1] 

机构地区：[1]东南大学计算机网络和信息集成教育部重点实验室,南京210096

出　　处：《东南大学学报（自然科学版）》2003年第6期685-688,共4页Journal of Southeast University：Natural Science Edition

基　　金：国家自然科学基金资助项目 ( 6990 3 0 0 2 ;90 10 40 0 9)

摘　　要：端到端实时CORBA系统调度模型的可调度性分析算法存在着一些缺陷和局限 .针对其局限性 ,提出了改进的可调度性分析算法 .采用时间需求分析方法 ,增加考虑了同一处理器上兄弟子任务对时间需求的影响 ,以及一个端到端任务在同一处理器上存在着 2个以上子任务的情形。通过计算任务影响函数 ,分别推导出 2类子任务的时间需求函数 .新的可调度性分析算法不仅具有良好的通用性 ,而且提高了原有算法的判定能力 .This paper proposes an improved schedulability analysis algorithm to eliminate the limits of the existing one for end-to-end real-time CORBA scheduling model. With time demand analysis, two more cases are taken into consideration. One is time interference due to sibling sub-tasks on one processor. The other is that there are more than two sub-tasks in the same end-to-end task residing in one processor. Time demand functions are deduced for two types of sub-tasks in terms of task interference function, respectively. Results show that the improved algorithm is of better universality and more powerful judgment ability. It can be applied to schedulability analysis and judgment for real-time CORBA tasks covering recursive invocations.

关 键 词：CORBA 实时系统 实时调度 可调度性分析 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]