摘要
网格任务调度是网格计算的研究热点,也是一个NP难问题。文章结合Min-Min算法和蚁群算法的优点,提出了一种基于Min-Min蚁群算法(MMACO)的任务调度方法。仿真实验表明:在网格环境下,该算法具有较好的全局最优求解能力和较快的收敛速度。
Grid task scheduling is a hot topic of grid computing and is also a NP hard problem. Combining Min-Min algorithm and the advantages of ant colony algorithm, this paper proposes a task scheduling method based on Min-Min ant colony algorithm (MIMACA). Simulation results show that: in the grid environment, the algorithm has better capacity of searching global optimal solution and a faster convergence rate.
出处
《计算机时代》
2009年第7期50-52,共3页
Computer Era
基金
江西省研究生创新专项基金项目(YC08B029)