Improving QoS in Computational Grids through Schedule-based Approach

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F08%3A00042057" target="_blank" >RIV/00216224:14330/08:00042057 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Improving QoS in Computational Grids through Schedule-based Approach

Popis výsledku v původním jazyce

While Grid users are often interested in satisfaction of their Quality of Service (QoS) requirements, these cannot be satisfactory handled by commonly used queue-based approaches. This paper concentrates on the application of schedule-based methods whichallow both efficient handling of QoS requirements as well as traditional machine usage objective. An incremental application of our methods reacting on dynamic character of the problem allows to achieve reasonable runtime. Even more, we show that the schedule-based methods significantly outperform queue-based approaches by means of the weighted machine usage reflecting heterogeneity of the resources common for the Grid environments. A new formalized description of two schedule-based methods is introduced to schedule dynamically arriving jobs onto the machines of the computational Grid. Proposed methods are compared with some of the most common queue-based scheduling algorithms.

Název v anglickém jazyce

Improving QoS in Computational Grids through Schedule-based Approach

Popis výsledku anglicky

While Grid users are often interested in satisfaction of their Quality of Service (QoS) requirements, these cannot be satisfactory handled by commonly used queue-based approaches. This paper concentrates on the application of schedule-based methods whichallow both efficient handling of QoS requirements as well as traditional machine usage objective. An incremental application of our methods reacting on dynamic character of the problem allows to achieve reasonable runtime. Even more, we show that the schedule-based methods significantly outperform queue-based approaches by means of the weighted machine usage reflecting heterogeneity of the resources common for the Grid environments. A new formalized description of two schedule-based methods is introduced to schedule dynamically arriving jobs onto the machines of the computational Grid. Proposed methods are compared with some of the most common queue-based scheduling algorithms.

Druh

O - Ostatní výsledky

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

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ů