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”

A Metaheuristic for Optimizing the Performance and the Fairness in Job Scheduling Systems

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007%2F978-3-319-19833-0_1" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-319-19833-0_1</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-19833-0_1" target="_blank" >10.1007/978-3-319-19833-0_1</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Metaheuristic for Optimizing the Performance and the Fairness in Job Scheduling Systems

  • Original language description

    Many studies in the past two decades focused on the problem of efficient resource management and job scheduling in large computational systems such as HPC clusters and Grids. For this purpose, the application of Artificial Intelligence-based methods suchas metaheuristics has been proposed in many works. This chapter provides an overview of such works that involve metaheuristics and discusses why mainstream resource management and scheduling systems are instead using only a limited set of rather simplescheduling policies. We identify several reasons that are causing this situation, e.g., a common use of overly simplified problem definitions with rather naive job and machine models or an application of unrealistic optimization criteria. In order to solve aforementioned issues, this chapter proposes new complex and well designed approaches that involve the use of metaheuristic which periodically optimizes job scheduling plan using several real life based optimization criteria.

  • 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

    Artificial-Intelligence Applications in Information and Communication Technologies

  • ISBN

    9783319198323

  • ISSN

    1860-949X

  • e-ISSN

  • Number of pages

    27

  • Pages from-to

    3-29

  • Publisher name

    Springer

  • Place of publication

    Germany

  • Event location

    Germany

  • Event date

    Jan 1, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article