This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on Grid and Cooperative Computing (GCC'06)
A New Task Duplication Based Multitask Scheduling Method
Hunan, China
October 21-October 23
ISBN: 0-7695-2694-2
Kun He, Huazhong University of Science and Technology, China
Yong Zhao, Huazhong University of Science and Technology, China
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.
Citation:
Kun He, Yong Zhao, "A New Task Duplication Based Multitask Scheduling Method," gcc, pp.221-227, Fifth International Conference on Grid and Cooperative Computing (GCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.