摘要
网格计算中的大型应用程序往往被分解为多个关联任务.关联任务提交到网格环境后,由于网格环境的异构性和不确定性,当任务执行发生异常时,需要对该任务实施迁移.通过分析任务的迁移代价,以Total-Copy算法为基础提出了基于T-RAG图的关联任务迁移算法.实验结果表明,对于大规模的关联任务,该算法具有较高的协调性能,并且提高了关联任务的执行效率.
A large-scale application program is always broken down into a number of tasks that contain much relation in grid environment. In order to improve the efficiency, the task needs to be migrated after submitting to the grid. Through analyzing the migration cost of selecting the task, a migration algorithm of related tasks of T-RAG graph based on Total-Copy algorithm was proposed, experimental results show that for large-scale related tasks, this algorithm has higher coordination, improves the efficiency of the execution of the related tasks.
出处
《微电子学与计算机》
CSCD
北大核心
2010年第8期57-60,65,共5页
Microelectronics & Computer
关键词
进程迁移
关联任务
网格
process migration
related tasks
grid
