Multi Resource Fairness: Problems and Challenges
The result's identifiers
Result code in 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>
Alternative codes found
RIV/63839172:_____/14:10130191
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Multi Resource Fairness: Problems and Challenges
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Job Scheduling Strategies for Parallel Processing
ISBN
9783662437780
ISSN
0302-9743
e-ISSN
—
Number of pages
15
Pages from-to
81-95
Publisher name
Springer
Place of publication
Neuveden
Event location
Boston, MA, USA
Event date
Jan 1, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000343045800005