Multi Resource Fairness: Problems and Challenges

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F14%3A00073408" target="_blank" >RIV/00216224:14330/14:00073408 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/63839172:_____/14:10130191

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-662-43779-7_5" target="_blank" >http://dx.doi.org/10.1007/978-3-662-43779-7_5</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-662-43779-7_5" target="_blank" >10.1007/978-3-662-43779-7_5</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Multi Resource Fairness: Problems and Challenges

Popis výsledku v původním jazyce

Current production resource management and scheduling systems often use some mechanism to guarantee fair sharing of computational resources among different users of the system. For example, the user who so far consumed small amount of CPU time gets higher priority and vice versa. The problem with such a solution is that it does not reflect other consumed resources like RAM, HDD storage capacity or GPU cores. Clearly, diffeffrent users may have highly heterogeneous demands concerning aforementioned resources, yet they are all prioritized only with respect to consumed CPU time. In this paper we show that such a single resource-based approach is unfair and is no longer suitable for nowadays systems. We provide a survey of existing works that somehow try to deal with this situation and we closely analyze and evaluate their characteristics. Next, we propose new enhanced approaches that would allow the development of usable multi resource-aware user prioritization mechanisms.

Název v anglickém jazyce

Multi Resource Fairness: Problems and Challenges

Popis výsledku anglicky

Current production resource management and scheduling systems often use some mechanism to guarantee fair sharing of computational resources among different users of the system. For example, the user who so far consumed small amount of CPU time gets higher priority and vice versa. The problem with such a solution is that it does not reflect other consumed resources like RAM, HDD storage capacity or GPU cores. Clearly, diffeffrent users may have highly heterogeneous demands concerning aforementioned resources, yet they are all prioritized only with respect to consumed CPU time. In this paper we show that such a single resource-based approach is unfair and is no longer suitable for nowadays systems. We provide a survey of existing works that somehow try to deal with this situation and we closely analyze and evaluate their characteristics. Next, we propose new enhanced approaches that would allow the development of usable multi resource-aware user prioritization mechanisms.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

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ů

Název statě ve sborníku

Job Scheduling Strategies for Parallel Processing

ISBN

9783662437780

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

15

Strana od-do

81-95

Název nakladatele

Springer

Místo vydání

Neuveden

Místo konání akce

Boston, MA, USA

Datum konání akce

1. 1. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000343045800005