All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F14%3A00073693" target="_blank" >RIV/00216224:14330/14:00073693 - isvavai.cz</a>

  • Alternative codes found

    RIV/63839172:_____/14:10130434

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-09873-9_12" target="_blank" >http://dx.doi.org/10.1007/978-3-319-09873-9_12</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-09873-9_12" target="_blank" >10.1007/978-3-319-09873-9_12</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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 worksaddress 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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2014

  • 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

    Euro-Par 2014

  • ISBN

    9783319098722

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

    138-149

  • Publisher name

    Springer

  • Place of publication

    Neuveden

  • Event location

    Porto, Portugal

  • Event date

    Jan 1, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article