实时多处理器系统的动态调度算法一直是实时系统中的重要研究课题,根据异构实时多处理器的特点,提出了一种新的异构实时动态调度算法P-IEFT,该算法采用了一个新的处理器分配策略——将任务分配到能最早完成任务的处理器上,该策略能够缩短调度长度,提高后继任务被接受的可能性,从而能够提高成功调度率.模拟结果表明,该调度算法的成功调度率高于近视算法和节约算法的成功调度率。
Efficient application scheduling is critical for achieving high performance in multiprocessor systems. A new dynamic scheduling algorithm for the heterogeneous multiprocessor systems is proposed. The algorithm uses a new policy that a task which have the minimal earliest finish time will be assigned to the processor. The policy is able to reduce schedule length so that the newly arriving task will have better chance to be accepted. Hence, its success ratio will rise. Simulation results show that this algorithm outperforms the other two algorithms