A Migration Algorithm of Related Tasks Based on T-RAG Graph in Grid

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.