%0 Journal Article
%T Grid Task Scheduling: Algorithm Review
%A Ma Tinghuai
%A Yan Qiaoqiao
%A Liu Wenjie
%A Guan Donghai
%J IETE Technical Review
%D 2011
%I 
%X As a new distributed heterogeneous computing platform, grid aims at achieving Internet-wide resource sharing and collaborative computing. Grid task scheduling (GTS) is the key issue of grid computing, and its algorithm has a direct effect on the performance of the whole system. In this paper, two key entities in GTS, applications and target systems, are defined first. And then two types of the most popular GTS algorithms, namely, meta-task GTS algorithm and directed acyclic graph GTS algorithm, are discussed in details in accordance with the classification of the traditional deterministic algorithm and heuristic intelligent algorithm. In addition, the comparative analysis is made among them. Finally, some main research directions of GTS are pointed out.
%K Directed acyclic graph
%K Grid computing
%K Grid task scheduling
%K Heuristic algorithms
%K Meta-task
%K Research topic
%K Swarm intelligent algorithms
%U http://tr.ietejournals.org/article.asp?issn=0256-4602;year=2011;volume=28;issue=2;spage=158;epage=167;aulast=Ma