Practical Scheduling Algorithms of Independent Tasks on Tree-Based Grid Computing Platform

This paper discusses scheduling independent tasks on tree-based grid computing platforms, where resources have different speeds of computation and communication. Instead of minimizing the total execution time, which has been proven to be NP-hard, we improve integral linear planning model. Using this...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2007 International Conference on Machine Learning and Cybernetics Ročník 6; s. 3157 - 3163
Hlavní autoři: Zhen-Yu Wang, Can-Cheng Yang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.08.2007
Témata:
Computer science
Cybernetics
Distributed scheduling algorithm
Grid computing
Linear planning
Machine learning
Machine learning algorithms
Master-slave
Optimal scheduling
Optimal scheduling scheme
Parallel processing
Processor scheduling
Scheduling algorithm
Task scheduling
ISBN:1424409721, 9781424409723
ISSN:2160-133X
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í:This paper discusses scheduling independent tasks on tree-based grid computing platforms, where resources have different speeds of computation and communication. Instead of minimizing the total execution time, which has been proven to be NP-hard, we improve integral linear planning model. Using this model, the time complexity is high to obtain optimal number of tasks assigned to each computing node of multi-level tree. To address this problem, Push-Pull method is given, which transforms the linear planning of multi-lever tree into single-level tree and therefore the time complexity is greatly reduced. Based on the optimal tasks assignment to each node, a static distributed heuristic task scheduling algorithm is put forward. Experimental results show that the algorithm achives better performance than other algorithms.
ISBN:1424409721
9781424409723
ISSN:2160-133X
DOI:10.1109/ICMLC.2007.4370691