实时异构系统的动态调度算法研究

实时多处理器系统是解决复杂时应用的有效手段,目前对实时多处理器调度算法的研究却大多集中在同构系统上,对实时异构系统的调度则研究得比较少,提出了一种新的实时异构系统的动态调度算法,该算法采用了集中式的调度方案,同时,引入了一个新的任务分配策略,从而通过提高任务可行性而提高了算的调度成功率,此外,为了评估该算法的性能,还进行了大量的模拟研究,由于近视算法经简单修改便可以应用到实时异构系统的动态调度中,因此,在模拟研究中,以近视算法作为基准,将其应用于实时异构系统动态调度时的性能与新算法进行了比较,模拟结果显示,在多种任务参数的取值下,新算法的调度成功率均高于近视算法。

STUDY OF A DYNAMIC SCHEDULING ALGORITHM FOR REAL-TIME HETEROGENEOUS SYSTEMS

Real-time heterogeneous systems are popular in real world. However, few algorithms have been proposed for their dynamic scheduling. In this paper, an efficient algorithm is presented to dynamically schedule the task sets in real-time heterogeneous systems. The proposed algorithm is in centralized manner, and improves the schedulability of tasks by introducing a new efficient task assignment policy. To evaluate the performance of the new dynamic scheduling algorithm, extensive simulation studies have been conducted. These simulations apply the myopic algorithm to real-time heterogeneous systems and use it as a baseline to compare with the new algorithm. Simulation results show that the scheduling success ratio of the new algorithm is always higher than the myopic algorithm in real-time heterogeneous systems for a variety of task parameters.