电子学报2011，Vol.39Issue(5)：1115-1120,6.
QIACO:一种多QoS约束网格任务调度算法
QIACO:An Algorithm for Grid Task Scheduling of Multiple QoS Dimensions
摘要
Abstract
Task scheduling problem in grid is NP-hard, and it is difficult to attain an optimal solution,so we can use intelligent optimization algorithms to approximate the optimal solution (for example ant colony optimization). Moreover, Quality of Service(QoS)is also an important factor in determining the performance of grid. Task scheduling needs to satisfy user's QoS requirements. In this paper, we propose a novel Multiple QoS Dinensions (QIACO) algorithm for Grid Task Scheduling which is based on modified am colony optimization algorithm and focuses on the task with QoS dimensions. The QIACO strategy use the ant colony algorithm to solve the task scheduling problem of grid, specifying 5 kinds of QoS dimensions and transforming the QoS to utility,and ultimately, representing the model of task scheduling with multiple QoS dimensions. At the same time, we improve many aspects of the ant colony algorithm,such as the search strategy,decision rule,pheromone update strategy of ant colony optimization,in order to maximize the user's satisfaction. QIACO shows a significant improvement in both makespan and total utility according to the theoretical analysis and simulation.关键词
多QoS约束/网格任务调度/蚁群算法/伪随机比例Key words
multiple QoS dimension/tasks scheduling/ant colony/pseudorandom proportional分类
信息技术与安全科学引用本文复制引用
孙伟峰,覃振权,李明楚,胡晶,陈媛芳..QIACO:一种多QoS约束网格任务调度算法[J].电子学报,2011,39(5):1115-1120,6.基金项目
国家自然科学基金(N0.90715037) （N0.90715037）
NSFC-JST重大国际(地区)合作项目(No.51021140004) （地区）
