Scheduling Interrelated Tasks in Grid Based on Ant Algorithm
Ying Liu · Jisuanji fangzhen · 2007
Task scheduling is one of the most important factors of system performance in grid computing,many current algorithms which ignore the relations of tasks assume the scheduled task is Meta-task.According to Graph Theory,the interrelation of tasks can be described as Directed Acyclic Graphs,which can exactly define the priority of each task.In addition,the ant algorithm can effectively implement task scheduling and loading balance.The ultimate assign scheme was obtained by using the task priority to rearrange the Meta-task scheduling results generated by ant algorithm.Simulation demonstrates that the algorithm can schedule interrelated tasks in variety of grid environment and it also can guarantee loading balance of the system because of the using of ant algorithm.