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 the Quality of Wall Time Estimates for Resource Allocation Prediction

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F63839172%3A_____%2F19%3A10133225" target="_blank" >RIV/63839172:_____/19:10133225 - isvavai.cz</a>

  • Result on the web

    <a href="https://dl.acm.org/doi/abs/10.1145/3339186.3339204" target="_blank" >https://dl.acm.org/doi/abs/10.1145/3339186.3339204</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/3339186.3339204" target="_blank" >10.1145/3339186.3339204</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On the Quality of Wall Time Estimates for Resource Allocation Prediction

  • Original language description

    Today&apos;s HPC systems experience steadily increasing problems with the storage I/O bottleneck. At the same time, new storage technologies are emerging in the compute nodes of HPC systems. There are many ideas and approaches how compute-node local storage can be made usable for HPC systems. One consideration is to copy job data to the compute-node local disks in advance. To accomplish this, the allocated nodes must be known in advance. In this paper, we look at the node allocation behavior of a HPC batch scheduling system. Our goal is to determine whether it is possible to stage data in advance, based on scheduler predictions. We show that wall time estimates must be excellent to reliably predict node allocations. In reality, the required accuracy enabling advance data staging is hard to achieve. Therefore, the behavior of (standard) batch scheduler have to be modified in order to enable efficient advance data staging.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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

    2019

  • 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

    ICPP 2019: Proceedings of the 48th International Conference on Parallel Processing: Workshops

  • ISBN

    978-1-4503-7196-4

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    1-8

  • Publisher name

    Association for Computing Machinery

  • Place of publication

    Neuveden

  • Event location

    Kyoto, Japan

  • Event date

    Aug 5, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article