当前任务

• Based on summarized and analyzed the existing problems of the solution for scheduling rtrpmt and tft , the author constructs a new heuristic function which adequately takes predecessor and successor relation among tasks into account , targeting that the direct successor of current running task is to be given the earliest time to be run
  针对实时分布系统中大量的相关周期性多任务，在分析、总结了前人对此类任务的调度算法解决方案所存在的问题基础上，构造了一种新的启发函数，该启发函数充分考虑了任务之间的前驱、后继关系，以当前任务的直接后继具有最早开始执行时间为目标。