A Priority-Based Task Scheduling Algorithm in Grid

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2010 3rd International Symposium on Parallel Architectures, Algorithms and Programming s. 311 - 315
Hlavní autoři: Weifeng Sun, Yudan Zhu, Zhiyuan Su, Dong Jiao, Mingchu Li
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2010
Témata:
DAG
Dynamic scheduling
grid task scheduling
Heuristic algorithms
Program processors
Resource management
Scheduling algorithm
task priority
ISBN:1424494826, 9781424494828
ISSN:2168-3034
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:1424494826
9781424494828
ISSN:2168-3034
DOI:10.1109/PAAP.2010.24