On Interactions Among Scheduling Policies: Finding Efficient
Queue Setup Using High-Resolution Simulations

D 2014

On Interactions Among Scheduling Policies: Finding Efficient Queue Setup Using High-Resolution Simulations

KLUSÁČEK, Dalibor and Šimon TÓTH

Basic information

Original name

On Interactions Among Scheduling Policies: Finding Efficient Queue Setup Using High-Resolution Simulations

Authors

KLUSÁČEK, Dalibor (203 Czech Republic, belonging to the institution) and Šimon TÓTH (203 Czech Republic, guarantor, belonging to the institution)

Edition

1. vyd. Neuveden, Euro-Par 2014, p. 138-149, 12 pp. 2014

Publisher

Springer

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Switzerland

Confidentiality degree

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

Publication form

printed version "print"

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/14:00073693

Organization unit

Faculty of Informatics

ISBN

978-3-319-09872-2

ISSN

DOI

http://dx.doi.org/10.1007/978-3-319-09873-9_12

UT WoS

000371297400012

Keywords in English

Scheduling; Queues; Fairshare; Simulation

Abstract

V originále

Many studies in the past two decades focused on the problem of efficient job scheduling in HPC and Grid-like systems. While many new scheduling algorithms have been proposed for systems with specific requirements, mainstream resource management systems and schedulers are still only using a limited set of scheduling policies. Production systems need to balance various policies that are set in place to satisfy both the resource providers and users (or virtual organizations) in the system. While many works address these separate policies, e.g., fairshare for fair resource allocation, only few works try to address the interactions between these separate solutions. In this paper we describe how to approach these interactions when developing site-specific policies. Notably, we describe how (priority) queues interact with scheduling algorithms, fairshare and with anti-starvation mechanisms. Moreover, we present a case study describing how an advanced simulation tool was used to find new configuration for an actual resource manager deployed in the Czech National Grid, significantly increasing its performance.

Links

GAP202/12/0306, research and development project

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

Investor: Czech Science Foundation

MUNI/A/0765/2013, interní kód MU

Name: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity (Acronym: SKOMU)

Investor: Masaryk University, Category A

Citovat

KLUSÁČEK, Dalibor and Šimon TÓTH. On Interactions Among Scheduling Policies: Finding Efficient Queue Setup Using High-Resolution Simulations. In Fernando Silva, Inês Dutra and Vítor Santos Costa. Euro-Par 2014. 1st ed. Neuveden: Springer, 2014, p. 138-149. ISBN 978-3-319-09872-2. Available from: https://dx.doi.org/10.1007/978-3-319-09873-9_12.

@inproceedings{1186298,
   author = {Klusáček, Dalibor and Tóth, Šimon},
   address = {Neuveden},
   booktitle = {Euro-Par 2014},
   doi = {http://dx.doi.org/10.1007/978-3-319-09873-9_12},
   edition = {1},
   editor = {Fernando Silva, Inês Dutra and Vítor Santos Costa},
   keywords = {Scheduling; Queues; Fairshare; Simulation},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Neuveden},
   isbn = {978-3-319-09872-2},
   pages = {138-149},
   publisher = {Springer},
   title = {On Interactions Among Scheduling Policies: Finding Efficient Queue Setup Using High-Resolution Simulations},
   year = {2014}
}

TY  - JOUR
ID  - 1186298
AU  - Klusáček, Dalibor - Tóth, Šimon
PY  - 2014
TI  - On Interactions Among Scheduling Policies: Finding Efficient Queue Setup Using High-Resolution Simulations
PB  - Springer
CY  - Neuveden
SN  - 9783319098722
KW  - Scheduling
KW  - Queues
KW  - Fairshare
KW  - Simulation
N2  - Many studies in the past two decades focused on the problem of efficient job scheduling in HPC and Grid-like systems. While many new scheduling algorithms have been proposed for systems with specific requirements, mainstream resource management systems and schedulers are still only using a limited set of scheduling policies. Production systems need to balance various policies that are set in place to satisfy both the resource providers and users (or virtual organizations) in the system. While many works address these separate policies, e.g., fairshare for fair resource allocation, only few works try to address the interactions between these separate solutions. In this paper we describe how to approach these interactions when developing site-specific policies. Notably, we describe how (priority) queues interact with scheduling algorithms, fairshare and with anti-starvation mechanisms. Moreover, we present a case study describing how an advanced simulation tool was used to find new configuration for an actual resource manager deployed in the Czech National Grid, significantly increasing its performance.
ER  -

KLUSÁČEK, Dalibor and Šimon TÓTH. On Interactions Among Scheduling Policies: Finding Efficient Queue Setup Using High-Resolution Simulations. In Fernando Silva, Inês Dutra and Vítor Santos Costa. \textit{Euro-Par 2014}. 1st ed. Neuveden: Springer, 2014, p.~138-149. ISBN~978-3-319-09872-2. Available from: https://dx.doi.org/10.1007/978-3-319-09873-9\_{}12.

Detailed Information on Publication Record