独立任务调度的启发式算法  

A Heuristic Algorithm for Independent Task Scheduling

作　　者：张金泉[1] 倪丽娜[1] 蒋昌俊[1] 杜晓丽[1] 

机构地区：[1]同济大学计算机科学与工程系

出　　处：《计算机工程与应用》2005年第11期22-25,共4页Computer Engineering and Applications

基　　金：国家杰出青年基金项目(编号:60125205);上海高校网格(编号:200306)资助

摘　　要：任务调度是一个NP-hard问题,而且是并行与分布式计算中一个必不可少的组成部分,特别是在网格计算环境下任务调度更加复杂。该文提出了满足负载均衡的一个启发式任务调度算法。给出了选择处理机和任务的方法,以提高算法的效率。实验表明该算法是一个高效率的调度算法,并且几乎总是找到了最优调度方案。Task scheduling is a NP-hard problem and is an integral part of parallel and distributed computing.It is more complicated especially under the grid computing environment.This paper presents a heuristic task scheduling algorithm satisfied with resources load balancing.Methods of selecting machines and tasks are given in this paper to increase the throughput of the system and reduce the total waiting time.The experiment results show that the heuristic algorithm performs significantly to ensure high load balancing and achieve an optimal scheduling strategy almost all the time.Furthermore,results show that the algorithm is a high efficient algorithm in terms of time complexity.

关 键 词：任务调度 网格计算 启发式算法 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]