高亮, 赵冬. 一种基于A*算法的多处理机调度算法[J]. 微电子学与计算机, 2013, 30(8): 128-131.
引用本文: 高亮, 赵冬. 一种基于A*算法的多处理机调度算法[J]. 微电子学与计算机, 2013, 30(8): 128-131.
GAO Liang, ZHAO Dong. An A-Star Alogorithm-based Multiprocessor Task Schedule Method[J]. Microelectronics & Computer, 2013, 30(8): 128-131.
Citation: GAO Liang, ZHAO Dong. An A-Star Alogorithm-based Multiprocessor Task Schedule Method[J]. Microelectronics & Computer, 2013, 30(8): 128-131.

一种基于A*算法的多处理机调度算法

An A-Star Alogorithm-based Multiprocessor Task Schedule Method

  • 摘要: 提出一种基于 A *(A Star)思想的启发式算法,求解多处理机环境下的实时任务调度问题。将系统中各个处理机与各实时任务的截止期进行综合考虑并进行形式化描述,建立 A *算法的估价函数,实现了实时任务的高效调度。仿真结果表明,其实现相对简单,收敛速度快,算法空间复杂度和时间复杂度相对较低,较好地解决多处理机系统中实时任务的调度问题。

     

    Abstract: A heuristic algorithm based on A * principle is proposed for the multiprocessor task schedule.On the basis of comprehensive considerations and formalization definition of the multiprocessor and tasks' deadline, the evaluation function of A * algorithm is constructed thereby,achieving efficient schedulement of the tasks.The simulation results show that this algorithm is easy to realized and can get the final result quickly with the lower space complexity and time complexity.

     

/

返回文章
返回