Rough Set and A* based Tasks Scheduling in Gird Environment
Ren XunYi -, Qi Zhenghua -, Wang Ruchuan -, MA Shu-Rong Li Hai-Ying Wu Xiao-Dong · International Journal of Digital Content Technology and its Applications · 2010
Task scheduling is the key point in grid computing; the current research mainly focuses on isomorphic tasks, but the heterogeneity and incompleteness of tasks is ignored, which will result in unreasonable and unpractical scheduling results. In order to enhance the validity and success rate of resource scheduling, the concept of task equivalence-class based on Rough Set is presented and introduced into task scheduling. The scheduling model based on A* algorithm existing in the each task equivalence-class is put forward, which is capable of quickly pruning decision tree, and is proved to keep globally-optimal solution within pruning process. The simulation experimental results show that the scheduling performance of proposed strategy is better obviously compared with existing methods.