计算机科学 ›› 2012, Vol. 39 ›› Issue (1): 178-181.

• 人工智能 • 上一篇    下一篇

一种求解多处理机调度问题的a-平坦化调度算法

魏嘉银,秦永彬,许道云   

  1. (贵州大学计算机科学与信息学院 贵阳550025)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Scheduling Algorithm of a-Planarization for Solving the Problem of Multiprocessor Scheduling

  • Online:2018-11-16 Published:2018-11-16

摘要: 在分析多处理机调度问题的基础上,提出了a--平坦的概念,并将其引入到多处理机调度问题中;基于此,提出了一种新的基于a--平坦的求解多处理机调度问题的算法。算法首先对作业集合做平坦化处理,然后再对处理后所得的新问题进行求解,最终获得原调度问题的一个近似解。实验结果表明,通过该算法可以求得较好的结果,相对于其它启发式算法,该算法具有较好的稳定性。

关键词: 多处理机调度,a--平坦,平坦化处理,调度算法

Abstract: In this paper,the concept of crflatness was proposed based on analyzing the multiprocessors scheduling problem, and then introduced it into the multiprocessors scheduling problem. Finally, a new algorithm based on the concept of a-flatness was proposed to solved the multiprocessors scheduling problem In this algorithm, the job set was flatting at first,and then solved the new problem obtained by the first step, finally an approximate solution for the original scheduling problem was obtained. The experimental results show that the solution obtained by this algorithm is good,and compared with the heuristic algorithm the result obtained by this algorithm is more stable.

Key words: Multiprocessors scheduling,crflatness,Planarization processing,Scheduling algorithm

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!