基于蚁群算法的网格资源分配与调度研究  

Ant Colony Algorithm Based Resource Allocation and Task Scheduling of Grid

作　　者：亓旭光[1] 梁正友[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《广西民族学院学报（自然科学版）》2006年第2期83-86,共4页Journal of Guangxi University For Nationalities(Natural Science Edition)

基　　金：广西大学博士基金(DD060008)

摘　　要：网格环境下的资源分配与调度是一个NP难问题,蚂蚁算法是解决这类问题的有效算法.文章提出了改进的蚁群算法.该算法采用伪随机比例规则,不仅在网格计算资源完成任务后进行信息素的整体更新,还要求预分配网格计算资源时进行信息素的局部更新.模拟实验表明该算法是一种快速,有效,负载更均衡的算法.Resource allocation and task scheduling of Grid is an NP--hard problem. Ant algorithm has proved to be a kind of effective algorithm to solve this kind of problems. In this paper, an improved ant colony algorithm was presented. It adopted the pseudo--random proportional rule, renewed global pheromone after the tasks were executed, and renewed local pheromone before the tasks were preassigned to the grid resource. It was proved by simulation experiment to be a speedy , efficient and perfect algorithm on load balance

关 键 词：网格 任务调度 资源分配 蚁群算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]