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.
Other formats:   BibTeX LaTeX RIS
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
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Switzerland
Confidentiality degree is not subject to a state or trade secret
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 0302-9743
Doi http://dx.doi.org/10.1007/978-3-319-09873-9_12
UT WoS 000371297400012
Keywords in English Scheduling; Queues; Fairshare; Simulation
Tags best2, core_A, firank_A
Tags International impact, Reviewed
Changed by Changed by: RNDr. Dalibor Klusáček, Ph.D., učo 50752. Changed: 21/4/2016 15:57.
Abstract
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 projectName: 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 MUName: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity (Acronym: SKOMU)
Investor: Masaryk University, Category A
PrintDisplayed: 30/5/2024 07:36