An optimal scheduling algorithm based on task duplication

Under the condition that the communication time is relatively shorter than the computation time for a given task, the task duplication-based scheduling (TDS) algorithm proposed by S. Darbha and D.P. Agrawal (1998) generates an optimal schedule. In this paper, we propose an extended TDS algorithm who...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computers Ročník 51; číslo 4; s. 444 - 448
Hlavní autoři: Park, Chan-Ik, Choe, Tae-Young
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.04.2002
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Computation
Optimal scheduling
Optimization
Reproduction
Schedules
Scheduling
Scheduling algorithm
Tasks
ISSN:0018-9340, 1557-9956
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í:Under the condition that the communication time is relatively shorter than the computation time for a given task, the task duplication-based scheduling (TDS) algorithm proposed by S. Darbha and D.P. Agrawal (1998) generates an optimal schedule. In this paper, we propose an extended TDS algorithm whose optimality condition is less restricted and where the length of the generated schedule is shorter than the original TDS algorithm.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/12.995454