DocumentCode :
2915270
Title :
A New Task Duplication Based Multitask Scheduling Method
Author :
He, Kun ; Zhao, Yong
Author_Institution :
Coll. of Comput. Sci., Huazhong Univ. of Sci. & Technol., Wuhan
fYear :
2006
fDate :
Oct. 2006
Firstpage :
221
Lastpage :
227
Abstract :
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
Keywords :
computational complexity; directed graphs; distributed algorithms; evolutionary computation; scheduling; NP-hard; directed acyclic graph; distributed environment; interpersonal relationships evolution algorithm; multitask scheduling; resource constraints; resource matching; task duplication; Algorithm design and analysis; Clustering algorithms; Communication system control; Computer science; Costs; Educational institutions; Helium; Paper technology; Processor scheduling; Resource management;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Grid and Cooperative Computing, 2006. GCC 2006. Fifth International Conference
Conference_Location :
Hunan
Print_ISBN :
0-7695-2694-2
Type :
conf
DOI :
10.1109/GCC.2006.13
Filename :
4031459
Link To Document :
بازگشت