| 独立任务调度的启发式算法 |
| |
| 引用本文： | 张金泉,倪丽娜,蒋昌俊,杜晓丽. 独立任务调度的启发式算法[J]. 计算机工程与应用, 2005, 41(11): 22-25 |
| |
| 作者姓名： | 张金泉 倪丽娜 蒋昌俊 杜晓丽 |
| |
| 作者单位： | 同济大学计算机科学与工程系,上海,200092;山东科技大学计算机科学系,青岛,266510;同济大学计算机科学与工程系,上海,200092 |
| |
| 基金项目： | 国家杰出青年基金项目(编号:60125205)，上海高校网格(编号:200306)资助 |
| |
| 摘 要： | 任务调度是一个NP-hard问题,而且是并行与分布式计算中一个必不可少的组成部分,特别是在网格计算环境下任务调度更加复杂。该文提出了满足负载均衡的一个启发式任务调度算法。给出了选择处理机和任务的方法,以提高算法的效率。实验表明该算法是一个高效率的调度算法,并且几乎总是找到了最优调度方案。
|
| 关 键 词： | 任务调度 网格计算 启发式算法 |
| 文章编号： | 1002-8331-(2005)11-0022-04 |
| 修稿时间： | 2005-02-01 |
A Heuristic Algorithm for Independent Task Scheduling |
| |
| Zhang Jinquan,Ni Lina,Jiang Changjun,Du Xiaoli. A Heuristic Algorithm for Independent Task Scheduling[J]. Computer Engineering and Applications, 2005, 41(11): 22-25 |
| |
| Authors: | Zhang Jinquan Ni Lina Jiang Changjun Du Xiaoli |
| |
| Affiliation: | Zhang Jinquan 1,2 Ni Lina 1,2 Jiang Changjun 1,2 Du Xiaoli 11 |
| |
| Abstract: | 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. |
| |
| Keywords: | task scheduling grid computing heuristic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
