DocumentCode :
526350
Title :
An efficient list scheduling algorithm of dependent task in grid
Author :
Yu, Zhenxia ; Meng, Fang ; Chen, Haining
Author_Institution :
Chengdu Univ. of Inf. Technol., Chengdu, China
Volume :
2
fYear :
2010
fDate :
9-11 July 2010
Firstpage :
102
Lastpage :
106
Abstract :
In this paper, an efficient scheduling algorithm based on critical path suitable for dependent tasks (DAG scheduling) in grid computing has been presented. With the object to shorten the makespan greatly, a new approach for constructing the task list has been developed, and an efficient processor selection procedure has also been developed.
Keywords :
grid computing; scheduling; DAG scheduling; critical path; dependent task; grid computing; list scheduling algorithm; processor selection procedure; Artificial neural networks; DAG; dependent task; scheduling length; task list; task scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-5537-9
Type :
conf
DOI :
10.1109/ICCSIT.2010.5563648
Filename :
5563648
Link To Document :
بازگشت