Multi-Resource Aware Fairsharing for Heterogeneous Systems

D 2015

Multi-Resource Aware Fairsharing for Heterogeneous Systems

KLUSÁČEK, Dalibor a Hana RUDOVÁ

Základní údaje

Originální název

Multi-Resource Aware Fairsharing for Heterogeneous Systems

Autoři

KLUSÁČEK, Dalibor (203 Česká republika) a Hana RUDOVÁ (203 Česká republika, garant, domácí)

Vydání

1. vyd. Switzerland, Job Scheduling Strategies for Parallel Processing, od s. 53-69, 17 s. 2015

Nakladatel

Springer, Lecture Notes in Computer Science 8828

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Německo

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

tištěná verze "print"

Odkazy

URL

Impakt faktor

Impact factor: 0.402 v roce 2005

Kód RIV

RIV/00216224:14330/15:00080587

Organizační jednotka

Fakulta informatiky

ISBN

978-3-319-15788-7

ISSN

DOI

http://dx.doi.org/10.1007/978-3-319-15789-4_4

UT WoS

000355729800004

Klíčová slova anglicky

Multi-Resource Fairness; Fairshare; Heterogeneity

Štítky

core_B, firank_A

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 17. 10. 2016 14:58, doc. Mgr. Hana Rudová, 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. 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. Importantly, this approach is capable of dealing with the heterogeneity of both jobs and resources. A working implementation of this new prioritization scheme is currently applied in the Czech National Grid Infrastructure MetaCentrum.

Návaznosti

GAP202/12/0306, projekt VaV

Název: Dyschnet - Dynamické plánování a rozvrhování výpočetních a síťových zdrojů (Akronym: Dyschnet)

Investor: Grantová agentura ČR, Dyschnet - Dynamické plánování a rozvrhování výpočetních a síťových zdrojů

Citovat

KLUSÁČEK, Dalibor a Hana RUDOVÁ. Multi-Resource Aware Fairsharing for Heterogeneous Systems. In Walfredo Cirne and Narayan Desai. Job Scheduling Strategies for Parallel Processing. 1. vyd. Switzerland: Springer, Lecture Notes in Computer Science 8828, 2015, s. 53-69. ISBN 978-3-319-15788-7. Dostupné z: https://dx.doi.org/10.1007/978-3-319-15789-4_4.

@inproceedings{1186297,
   author = {Klusáček, Dalibor and Rudová, Hana},
   address = {Switzerland},
   booktitle = {Job Scheduling Strategies for Parallel Processing},
   doi = {http://dx.doi.org/10.1007/978-3-319-15789-4_4},
   edition = {1},
   editor = {Walfredo Cirne and Narayan Desai},
   keywords = {Multi-Resource Fairness; Fairshare; Heterogeneity},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Switzerland},
   isbn = {978-3-319-15788-7},
   pages = {53-69},
   publisher = {Springer, Lecture Notes in Computer Science 8828},
   title = {Multi-Resource Aware Fairsharing for Heterogeneous Systems},
   url = {http://www.cs.huji.ac.il/~feit/parsched/jsspp14},
   year = {2015}
}

TY  - JOUR
ID  - 1186297
AU  - Klusáček, Dalibor - Rudová, Hana
PY  - 2015
TI  - Multi-Resource Aware Fairsharing for Heterogeneous Systems
PB  - Springer, Lecture Notes in Computer Science 8828
CY  - Switzerland
SN  - 9783319157887
KW  - Multi-Resource Fairness
KW  - Fairshare
KW  - Heterogeneity
UR  - http://www.cs.huji.ac.il/~feit/parsched/jsspp14
N2  - 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. Importantly, this approach is capable of dealing with the heterogeneity of both jobs and resources. A working implementation of this new prioritization scheme is currently applied in the Czech National Grid Infrastructure MetaCentrum.
ER  -

KLUSÁČEK, Dalibor a Hana RUDOVÁ. Multi-Resource Aware Fairsharing for Heterogeneous Systems. In Walfredo Cirne and Narayan Desai. \textit{Job Scheduling Strategies for Parallel Processing}. 1. vyd. Switzerland: Springer, Lecture Notes in Computer Science 8828, 2015, s.~53-69. ISBN~978-3-319-15788-7. Dostupné z: https://dx.doi.org/10.1007/978-3-319-15789-4\_{}4.

Podrobný výpis o publikaci