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

• Published in: Euro-Par 2014 Parallel Processing pp. 138 - 149
• Main Authors: Klusáček, Dalibor, Tóth, Šimon
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing 2014
• Series: Lecture Notes in Computer Science
• Subjects: Fairshare; Queues; Scheduling; Simulation
• ISBN: 3319098721; 9783319098722
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-09873-9_12

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.