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

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

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

Popis výsledku anglicky

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

Druh

D - Stať ve sborníku

CEP obor

BG - Jaderná, atomová a molekulová fyzika, urychlovače

OECD FORD obor

—

Projekt

<a href="/cs/project/GA13-20841S" target="_blank" >GA13-20841S: Studium jaderné hmoty v ultra-relativistických jaderných srážkách na urychlovači RHIC</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Journal of Physics Conference Series

ISBN

—

ISSN

1742-6588

e-ISSN

—

Počet stran výsledku

6

Strana od-do

—

Název nakladatele

IOP Publishing Ltd

Místo vydání

Bristol

Místo konání akce

Prague

Datum konání akce

1. 9. 2014

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000358218000028