网格优化有向超图任务调度算法  

Grid Optimized Directed Hypergraph Task Scheduling Algorithm

作　　者：杨博[1] 陈志刚[1] 刘立[1] 

机构地区：[1]中南大学信息科学与工程学院,湖南长沙410083

出　　处：《小型微型计算机系统》2007年第10期1769-1773,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60573127)资助;高等学校博士学科点专项科研基金项目(20040533036)资助;湖南省自然科学基金项目(05JJ40131)资助.

摘　　要：任务调度是网格计算的一个重要部分.分析网格环境下任务调度的特点以及传统DAG图的优缺点,吸取有向超图的优点,将有向超图理论融合网格环境特征,建立了网格环境下的优化有向超图模型,并在此基础上通过网格优化有向超图的水平构形、标号及带宽计算实现任务对网格资源的映射与调度,提出网格优化有向超图任务调度算法GODHTS.模拟实验结果证明了该模型及其算法的有效性和优越性.Task scheduling is an important part in Grid computing. In the paper, characters of task scheduling in Grid and advantages and shortcomings of traditional DAG are analysed, and a optimized directed hypergraph model is built by drawing advantages of directed hypergraph and combining hypergraph theory with characters of Grid environment. Based on the model, mapping and scheduling from tasks to Grid resources are realized by making use of level structure, tab and bandwidth computing of Grid optimized directed hypergraph, and a Grid optimized directed hypergraph task scheduling algorithm, GODHTS, is proposed. Simulation results show that validity and superiority of the proposed model and algorithm are obvious.

关 键 词：网格 有向超图 任务调度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]