| 基于捕食搜索策略的网格任务调度算法 |
| |
| 引用本文： | 王云,杨建刚. 基于捕食搜索策略的网格任务调度算法[J]. 计算机应用与软件, 2011, 28(2) |
| |
| 作者姓名： | 王云 杨建刚 |
| |
| 作者单位： | 1. 浙江大学计算机学院,浙江,杭州,310027
2. 浙江大学计算机学院,浙江,杭州,310027;浙江大学宁渡理工学院,浙江,宁波,315000 |
| |
| 摘 要： | 为解决网格任务调度难题,设计了一种模仿动物捕食策略的网格任务调度算法SAPS(Scheduling Algorithm Based onPredatory Search)。该算法首先确定待搜索区域,将待搜索区域划分为若干子区域,然后对子区域依次进行区域搜索,在搜索过程中如在某个子区域发现较优解,则对此子区域进行精密搜索,如未发现较优解,则转到下一个子区域,直至遍历所有子区域。SAPS算法具有较好的全局搜索和局部搜索的能力,克服了Min-min算法单纯追求局部最优而缺少全局意识的缺点。试验结果表明,该算法能更有效地解决网格任务调度问题。
|
| 关 键 词： | 捕食搜索 Min-min算法 任务调度 |
GRID TASK SCHEDULING ALGORITHM BASED ON PREDATORY SEARCH STRATEGY |
| |
| Wang Yun,Yang Jian'gang. GRID TASK SCHEDULING ALGORITHM BASED ON PREDATORY SEARCH STRATEGY[J]. Computer Applications and Software, 2011, 28(2) |
| |
| Authors: | Wang Yun Yang Jian'gang |
| |
| Affiliation: | Wang Yun1 Yang Jian'gang1,2 1(College of Computer Science and Technology,Zhejiang University,Hangzhou 310027,Zhejiang,China) 2(Ningbo Institute of Technology,Ningbo 315000,China) |
| |
| Abstract: | In order to solve the problem of grid task scheduling,we designed a grid task scheduling algorithm imitating animals' predatory search strategy(SAPS).First the algorithm determines the area to be searched,and divides the area into several sub-areas,then it searches the sub-areas in turn.During the search process,when a good solution is found in a certain sub-area,then the precise search will be carried out,but if no good solution has been found,then another sub-area will be searched,until all the sub-areas ... |
| |
| Keywords: | Predatory search Min-min algorithm Task scheduling |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
