The Use of Incremental Schedule-based Approach for Efficient Job Scheduling

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F10%3A00045269" target="_blank" >RIV/00216224:14330/10:00045269 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

The Use of Incremental Schedule-based Approach for Efficient Job Scheduling

Popis výsledku v původním jazyce

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 deliveredto 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 previousworks, 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-bas

Název v anglickém jazyce

The Use of Incremental Schedule-based Approach for Efficient Job Scheduling

Popis výsledku anglicky

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 deliveredto 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 previousworks, 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-bas

Druh

O - Ostatní výsledky

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2010

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů