The Community for Technology Leaders
Parallel Architectures, Algorithms and Programming, International Symposium on (2010)
Dalian, Liaoning China
Dec. 18, 2010 to Dec. 20, 2010
ISBN: 978-0-7695-4312-3
pp: 311-315
ABSTRACT
Grid is proposed to solve large scale and complicated problems, and it is a form of parallel computing on Internet. Task scheduling in grid is one of the most important technologies in grid system, and it is a NP complete problem, which is used to schedule a task on an appropriate grid node. Task scheduling algorithms are used to improve the grid performance by minimizing the scheduling length. A priority-based task scheduling algorithm (P-TSA) in grid is proposed in this paper. In this kind of priority-based algorithm, tasks are scheduled according to the priority order firstly. And then assign processors Comparing P-TSA with existed grid scheduling algorithms on scheduling length and resource utilization rates. Simulations are done on examples of DAG, and simulation results shown that the performance of P-TSA is better than other scheduling algorithms such as Min-min and Max-min.
INDEX TERMS
grid task scheduling, task priority, DAG
CITATION
Zhiyuan Su, Yudan Zhu, Weifeng Sun, Dong Jiao, Mingchu Li, "A Priority-Based Task Scheduling Algorithm in Grid", Parallel Architectures, Algorithms and Programming, International Symposium on, vol. 00, no. , pp. 311-315, 2010, doi:10.1109/PAAP.2010.24
93 ms
(Ver 3.3 (11022016))