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”

Planning for distributed workfows: constraint-based coscheduling of computational jobs and data placement in distributed environments

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="http://dx.doi.org/10.1088/1742-6596/608/1/012028A" target="_blank" >http://dx.doi.org/10.1088/1742-6596/608/1/012028A</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1088/1742-6596/608/1/012028A" target="_blank" >10.1088/1742-6596/608/1/012028A</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Planning for distributed workfows: constraint-based coscheduling of computational jobs and data placement in distributed environments

  • Original language description

    When running data intensive applications on distributed computational resources long I/O overheads may be observed as access to remotely stored data is performed. Latencies and bandwidth can become the major limiting factor for the overall computation performance and can reduce the CPU/WallTime ratio to excessive IO wait. Reusing the knowledge of our previous research, we propose a constraint programming based planner that schedules computational jobs and data placements (transfers) in a distributed environment in order to optimize resource utilization and reduce the overall processing completion time. The optimization is achieved by ensuring that none of the resources (network links, data storages and CPUs) are oversaturated at any moment of time andeither (a) that the data is pre-placed at the site where the job runs or (b) that the jobs are scheduled where the data is already present.

  • 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

    16th International Workshop on Advanced Computing and Analysis Techniques in Physics Research: Bridging Disciplines, ACAT 2014

  • ISBN

  • ISSN

    1742-6588

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    1-6

  • Publisher name

    Institute of Physics Publishing

  • Place of publication

    Prague, Czech Republic

  • Event location

    Prague, Czech Republic

  • Event date

    Jan 1, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000358218000028