网格任务调度的有向超图划分算法

网格计算是当前一个活跃的研究领域,其中任务调度是一个重要部分.根据网格环境下任务调度及传统DAG图的特点,吸取有向超图的优点,将有向超图理论融合任务调度特征,建立了基于划分的网格任务调度有向超图模型,并在此基础上通过对网格有向超图的划分实现任务对网格资源的映射与调度,提出了一种基于有向超图划分的网格任务调度算法HPGTS.模拟仿真实验结果证明了该模型及其算法的有效性和优越性.

Directed Hypergraph Partitioning Algorithm of Grid Task Scheduling

Grid computing is currently an active research area and the task scheduling is an important part in the Grid computing.According to characteristics of task scheduling in Grid and traditional DAG,a directed hypergraph model of Grid task scheduling based on partitioning was built by drawing advantages of directed hypergraph and combining hypergraph theory with characteristics of Grid environment.Based on the model,mapping and scheduling from tasks to Grid resources were realized by Grid directed hypergraph partitioning,and a directed hypergraph partitioning based Grid task scheduling algorithm,HPGTS,was proposed.Simulation results show that validity and superiority of the proposed model and algorithm are obvious.