实时任务调度算法最早可行时刻的求取模式  

Calculating Modes of Earliest Feasible Time for Real-time Task Schedule Algorithm

作　　者：钱光明[1] 姜辉[1] 陈湘华[1] 

机构地区：[1]湖南师范大学数学与计算机科学学院,长沙410081

出　　处：《计算机工程》2012年第4期284-286,共3页Computer Engineering

基　　金：湖南省自然科学基金资助项目(09JJ5040);长沙市科技局基金资助项目(K10ZD044-13)

摘　　要：提出实时任务调度算法最早可行时刻的求取模式。利用试探到公倍点、试探到截止期对齐和试探到较小的剩余使用率这3种收敛模式,求取任务插入的最早可行时刻。给出每种模式的仿真示例,利用时间复杂度分析上述收敛模式,根据立即平滑插入点确定立即时间段。仿真示例证明,该收敛模式正确,在运行时能在最早可行时刻插入新任务。This paper proposes the calculating modes of earliest feasible time for real-time task schedule algorithm. It summarizes three convergence modes to obtain the earliest feasible time, including testing to the common multipy point, testing to the alignment deadline and testing to the smallest remaining utilization. It gives the simulation examples on each modes, and uses the time complexity to analysis the convergence modes above. The immediate insertion segment is determined on the immediate smooth insertion point. Simulation examples show that the convergence modes are right. In the operation processing, the three modes can realize the new task insertion at the earliest possible time.

关 键 词：平滑插入 最早可行时刻 实时系统 任务压缩 

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