2010
The Use of Incremental Schedule-based Approach for Efficient Job Scheduling
KLUSÁČEK, Dalibor a Hana RUDOVÁZákladní údaje
Originální název
The Use of Incremental Schedule-based Approach for Efficient Job Scheduling
Autoři
Vydání
Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2010), 2010
Další údaje
Jazyk
angličtina
Typ výsledku
Konferenční abstrakt
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Česká republika
Utajení
není předmětem státního či obchodního tajemství
Označené pro přenos do RIV
Ano
Kód RIV
RIV/00216224:14330/10:00045269
Organizační jednotka
Fakulta informatiky
ISBN
978-80-87342-10-7
Klíčová slova anglicky
Grid; scheduling; incremental;efficient
Příznaky
Mezinárodní význam, Recenzováno
Změněno: 27. 4. 2011 14:55, RNDr. Dalibor Klusáček, Ph.D.
Anotace
V originále
Common requirements of users of computational clusters and Grids cannot be easily guaranteed by the current widely used queue-based scheduling approaches. We concentrate on the application of schedule-based methods that improve both the service delivered to the user as well as the traditional objective of machine usage. The Grid/cluster scheduling problem is dynamic due to changing state of the system. In such an environment, scheduling algorithm must be flexible and reasonably fast. Unlike to previous works, our schedule-based algorithms work in an ``incremental fashion", keeping the necessary runtime in an acceptable level while still enabling the application of advanced optimization algorithms. Incremental approach allows to keep the algorithm runtime low in contrast to the situations when the schedule is re-computed from scratch upon each job arrival. Moreover, the schedule-based algorithms show significant improvement in the quality of optimization in comparison with the queue-based methods.
Návaznosti
| MSM0021622419, záměr |
| ||
| MUNI/A/0914/2009, interní kód MU |
|