Calculating Modes of Earliest Feasible Time for Real-time Task Schedule Algorithm
Xianghua Chen · Jisuanji gongcheng · 2012
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 of 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.