A greedy algorithm for scheduling fork-join task graphs

The goal of task scheduling algorithm is to allocate the tasks of a parallel program to processors in order to minimize the completion time of the program. This is known as an NP-complete problem. Although a large number of scheduling heuristics have been presented in the literature, most of them ig...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693) Ročník 4; s. 1969 - 1971 Vol.4
Hlavní autoři: Jian-Jun Zhang, You-Lin Ruan, Qing-Hua Li, Shi-Da Yang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2003
Témata:
Algorithm design and analysis
Computer science
Electronic mail
Greedy algorithms
Machine learning algorithms
NP-complete problem
Optimal scheduling
Parallel processing
Processor scheduling
Scheduling algorithm
ISBN:0780378652, 9780780378650, 9780780381315, 0780381319
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í:The goal of task scheduling algorithm is to allocate the tasks of a parallel program to processors in order to minimize the completion time of the program. This is known as an NP-complete problem. Although a large number of scheduling heuristics have been presented in the literature, most of them ignored to economize processors and minimize total completion time. In this paper, we present a greedy algorithm for scheduling fork-join task graph, which can generate better schedule results. The time complexity of the proposed algorithm is O(v/sup 2/), where v is the number of tasks. Experimental comparisons with other algorithms show very favorable results.
ISBN:0780378652
9780780378650
9780780381315
0780381319
DOI:10.1109/ICMLC.2003.1259824