2014
Multi Resource Fairness: Problems and Challenges
KLUSÁČEK, Dalibor, Hana RUDOVÁ a Michal JAROŠZákladní údaje
Originální název
Multi Resource Fairness: Problems and Challenges
Autoři
KLUSÁČEK, Dalibor (203 Česká republika, garant, domácí), Hana RUDOVÁ (203 Česká republika, domácí) a Michal JAROŠ (203 Česká republika, domácí)
Vydání
1. vyd. Neuveden, Job Scheduling Strategies for Parallel Processing, od s. 81-95, 15 s. 2014
Nakladatel
Springer, Lecture Notes in Computer Science 8429
Další údaje
Jazyk
angličtina
Typ výsledku
Stať ve sborníku
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Spojené státy
Utajení
není předmětem státního či obchodního tajemství
Forma vydání
elektronická verze "online"
Impakt faktor
Impact factor: 0.402 v roce 2005
Kód RIV
RIV/00216224:14330/14:00073408
Organizační jednotka
Fakulta informatiky
ISBN
978-3-662-43778-0
ISSN
UT WoS
000343045800005
Klíčová slova anglicky
Multi Resource Fairness; Fairshare; Penalty; Scheduling
Štítky
Příznaky
Mezinárodní význam, Recenzováno
Změněno: 27. 11. 2015 15:30, RNDr. Dalibor Klusáček, Ph.D.
Anotace
V originále
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. We demonstrate that different consumed resources can be weighted and combined together within a single formula which can be used to establish users' priorities. Moreover, we show that when it comes to multiple resources, it is not always possible to find a suitable solution that would fulfill all fairness-related requirements.
Návaznosti
ED3.2.00/08.0144, projekt VaV |
| ||
GAP202/12/0306, projekt VaV |
|