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 workflows: 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%2F61389005%3A_____%2F15%3A00447867" target="_blank" >RIV/61389005:_____/15:00447867 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    Latencies and bandwidth can become the major limiting factor for the overall computation performance and can reduce the CPU/WallTime ratio to excessive TO 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 and either (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. Such an approach eliminates the idle CPU cycles occurring when the job is waiting for the I/O from a remote site and would have wide application in the community. Our planner was evaluated and simulated based on data extracted from log files of batch and data m

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BG - Nuclear, atomic and molecular physics, accelerators

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA13-20841S" target="_blank" >GA13-20841S: Study of nuclear matter in ultra-relativistic heavy-ion collisions at RHIC</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

    Journal of Physics Conference Series

  • ISBN

  • ISSN

    1742-6588

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

  • Publisher name

    IOP Publishing Ltd

  • Place of publication

    Bristol

  • Event location

    Prague

  • Event date

    Sep 1, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000358218000028