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”

User-Aware Metrics for Measuring Quality of Parallel Job Schedules

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00080586" target="_blank" >RIV/00216224:14330/15:00080586 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.cs.huji.ac.il/~feit/parsched/jsspp14/p3-toth.pdf" target="_blank" >http://www.cs.huji.ac.il/~feit/parsched/jsspp14/p3-toth.pdf</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-15789-4_6" target="_blank" >10.1007/978-3-319-15789-4_6</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    User-Aware Metrics for Measuring Quality of Parallel Job Schedules

  • Original language description

    The work presented in this paper is motivated by the challenges in the design of scheduling algorithms for the Czech National Grid MetaCentrum. One of the most notable problems is our inability to efficiently analyze the quality of schedules. While it isstill possible to observe and measure certain aspects of generated schedules using various metrics, it is very challenging to choose a set of metrics that would be representative when measuring the schedule quality. Without quality quantification (either relative, or absolute), we have no way to determine the impact of new algorithms and configurations on the schedule quality, prior to their deployment in a production service. The only two options we are left with is to either use expert assessment orto simply deploy new solutions into production and observe their impact on user satisfaction.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F12%2F0306" target="_blank" >GAP202/12/0306: Dyschnet - Dynamic planning and scheduling of computational and network resources</a><br>

  • Continuities

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

Others

  • Publication year

    2015

  • 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

    Job Scheduling Strategies for Parallel Processing

  • ISBN

    9783319157887

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    18

  • Pages from-to

    90-107

  • Publisher name

    Springer, Lecture Notes in Computer Science 8828

  • Place of publication

    Switzerland

  • Event location

    Phoenix, AZ, USA

  • Event date

    Jan 1, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000355729800006