- Tytuł:
- Mean Squared Load Criteria for Scheduling Independent Tasks
- Autorzy:
- Dzemyda, G.
- Powiązania:
- https://bibliotekanauki.pl/articles/908277.pdf
- Data publikacji:
- 1999
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
przetwarzanie równoległe
szeregowanie
zadanie kombinatoryczne
parallel processing
scheduling
combinatorial problems
minimum makespan problem
mean squared load - Opis:
- Results of this paper extend the set of criteria which characterize the scheduling quality as well as the set of possible scheduling strategies. A new view on the minimum makespan criterion is presented in terms of the mean squared load of processing units. This leads in turn to the development of new scheduling algorithms. The interaction between processes of minimizing the new criteria and the maximum finishing time (makespan of the schedule) was discovered. We show the possibility of minimizing the maximum finishing time by minimizing the new criteria that characterize the mean squared load of processing units. Moreover, the optimal workload of processing units determined with the use of the proposed criteria is usually smoother (more balanced) than that found for traditional ones.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 1999, 9, 4; 939-954
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł