检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《四川大学学报(自然科学版)》2009年第5期1311-1315,共5页Journal of Sichuan University(Natural Science Edition)
基 金:科技部科技型中小企业创新基金(06C26225101730);四川省科技公关项目(05GG021-003-2)
摘 要:建立了集群负载均衡问题的数学模型,并提出改进多态蚁群算法来对其进行求解的策略.首先,算法中侦察蚁以每个处理节点为中心,作局部侦察并设置侦察信息素;其次,搜索蚁利用侦察蚁提供的辅助信息做全局搜索,通过多态蚂蚁间的协作,能更快地搜索到问题的优化解.最后,通过一个试验与最小加权连接算法,传统多态蚁群算法进行了对比.结果表明,对于负载均衡问题,改进多态蚁群算法比前述算法在算法稳定性,负载的均衡能力,计算速度方面更具有优势.A novel mathematical model has been developed to address the complicated issue of the Clus- ter-based Load balancing. Therefore, an improved and polymorphic ant colony algorithm(IPACA) has been brought forward to solve the problem of Load balancing. First, spy ants fulfill the reconnaissance to the local route which is beside every processing nodes and set reconnoitering pheromones on the pro- cessing node. Then, search ants search the feasible path by the auxiliary information from spy ants. The cooperating among polymorphic ants can significantly improve the speed to find the optimum solution. Finally, a case study is presented to compare IPACA with Weighted minimum connection algorithm and polymorphic ant colony algorithm. The test results show that the proposed algorithm is of more advan- tage than fore mentioned algorithms in computational results stability, the ability to load balance and computational speed for Load balancing.
关 键 词:LINUX集群 负载均衡 改进多态蚁群算法 软件测试平台 数学模型
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38