Mean Squared Load Criteria for Scheduling Independent Tasks

• Autorzy: Dzemyda G.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

parallel processing; scheduling; combinatorial problems; minimum makespan problem; mean squared load

PL

przetwarzanie równoległe; szeregowanie; zadanie kombinatoryczne

• Wydawca: Oficyna Wydawnicza Uniwersytetu Zielonogórskiego
• Czasopismo: International Journal of Applied Mathematics and Computer Science
• Rocznik: 1999
• Tom: Vol. 9, no 4
• Strony: 939--954
• Opis fizyczny: Bibliogr. 11 poz., wykr.

Twórcy

autor

Dzemyda G.

• Institute of Mathematics and Informatics 4, Akademijos St., 2600 Vilnius, Lithuania,