Multi-Resource Aware Fairsharing for Heterogeneous Systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00080587" target="_blank" >RIV/00216224:14330/15:00080587 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-15789-4_4" target="_blank" >http://dx.doi.org/10.1007/978-3-319-15789-4_4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-15789-4_4" target="_blank" >10.1007/978-3-319-15789-4_4</a>
Alternative languages
Result language
angličtina
Original language name
Multi-Resource Aware Fairsharing for Heterogeneous Systems
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. However, different users may have highly heterogeneous demands concerning system resources, including CPUs, RAM, HDD storage capacity or, e.g., GPU cores. Therefore, it may not be fair to prioritize them only with respect to the consumed CPU time. Still, applied mechanisms often do not reflect other consumed resources or they use rather simplified and "ad hoc" solutions to approach these issues. We show that such solutions may be (highly) unfair and unsuitable for heterogeneous systems. We provide a survey of existing works that try to deal with this situation, analyzing and evaluating their characteristics. Next, we present new enhanced approach that supports multi-resource aware user prioritization mechanism
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP202%2F12%2F0306" target="_blank" >GAP202/12/0306: Dyschnet - Dynamic planning and scheduling of computational and network resources</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2015
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
9783319157887
ISSN
0302-9743
e-ISSN
—
Number of pages
17
Pages from-to
53-69
Publisher name
Springer, Lecture Notes in Computer Science 8828
Place of publication
Switzerland
Event location
Phoenix, Arizona, USA
Event date
Jan 1, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000355729800004