Oct. 21, 2006 to Oct. 23, 2006
Kun He , Huazhong University of Science and Technology, China
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GCC.2006.13
The paper addresses the problem of scheduling tasks represented by a directed acyclic graph (DAG) on distributed environments. Due to the task, communication and resource constraints, the resource matching and task scheduling is NP-hard, even though the number of resources is abounded and task duplication is allowed. A new method named interpersonal relationships evolution algorithm (IREA) is given. The priority rules used are new, relationship number, potentiality, weight and merge degree are defined for cluster?s priority, and task potentiality for tasks? priority. The experimental results reveal IREA beats other five algorithms in terms of average performance, and it produces another optimal solution for the classic MJD benchmark.
Kun He, "A New Task Duplication Based Multitask Scheduling Method", GCC, 2006, Proceedings Fifth International Conference on Grid and Cooperative Computing, Proceedings Fifth International Conference on Grid and Cooperative Computing 2006, pp. 221-227, doi:10.1109/GCC.2006.13