Grid Task Scheduling: Algorithm Review

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 ke...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Technical review - IETE Jg. 28; H. 2; S. 158 - 167
Hauptverfasser: Ma, Tinghuai, Yan, Qiaoqiao, Liu, Wenjie, Guan, Donghai, Lee, Sungyoung
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New Delhi Taylor & Francis 01.03.2011
Taylor & Francis Ltd
Schlagworte:
Algorithms
Directed acyclic graph
Distributed processing
Grid computing
Grid task scheduling
Heuristic algorithms
Meta-task
Research topic
Studies
Swarm intelligent algorithms
Wireless networks
ISSN:0256-4602, 0974-5971
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0256-4602
0974-5971
DOI:10.4103/0256-4602.76138