| 基于LBT的网格依赖任务调度算法 |
| |
| 引用本文： | 王霜,李心科.基于LBT的网格依赖任务调度算法[J].合肥工业大学学报(自然科学版),2010,33(1). |
| |
| 作者姓名： | 王霜 李心科 |
| |
| 作者单位： | 合肥工业大学计算机与信息学院,安徽,合肥,230009 |
| |
| 基金项目： | 安徽省科技厅科技攻关重点基金 |
| |
| 摘 要： | 文章将任务调度分为资源分配和调度执行2个阶段,定义了网格环境下的调度执行最晚开始时间、调度执行开始时间和任务依赖图中边的权值;分析了任务图冻结消减和执行消减对任务图结构的影响;提出了基于LBT的网格依赖任务调度算法;实验表明该算法有效地减弱了网格动态性对调度结果的影响。
|
| 关 键 词： | 网格 DAG图 冻结消减 最晚开始时间 |
Grid task scheduling algorithm based on LBT |
| |
| WANG Shuang,LI Xin-ke.Grid task scheduling algorithm based on LBT[J].Journal of Hefei University of Technology(Natural Science),2010,33(1). |
| |
| Authors: | WANG Shuang LI Xin-ke |
| |
| Abstract: | The task scheduling is divided into two stages:resource allocation and scheduling implementation.A group of features,which include latest beginning time(LBT),beginning time(BT)and the edge weight in a DAG,are defined.The impact of freezing elimination and implementing elimination on the DAG is analyzed,and a better Iist scheduling algorithm-the LBTTS algorithm is proposed.The result of experiments shows that the LBTTS algorithm lowers the impact of dynamic environment on grid computing effectively. |
| |
| Keywords: | grid directed acyclic graph(DAG) freezing elimination latest beginnig time(LBT) |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
