Building Efficient Data Planner for Peta-scale Science

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F10%3A00176609" target="_blank" >RIV/68407700:21340/10:00176609 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Building Efficient Data Planner for Peta-scale Science

Popis výsledku v původním jazyce

Distributed computing, heavily relying on the presence of data at the proper place and time, have further raised demands for coordination of data movement on the road towards achieving high performance. Although there exist several sophisticated and efficient point-to-point data transfer tools, the lack of global planners and decision makers, answering questions such as ``How and from which sources to bring the required dataset to the user?'', is for most part lacking. We present our work and status ofthe development of an automated data planning, ensuring fairness and efficiency of data movement by focusing on the minimal time to realize data movement (delegating the data transfer itself to existing transfer tools). Its principal keystones are self-adaptation to the network/service alteration, optimal selection of transfer channels, bottlenecks avoidance and user fair-share preservation. The planning mechanism relies on Constraint Programming and Mixed Integer Programming techniques.

Název v anglickém jazyce

Building Efficient Data Planner for Peta-scale Science

Popis výsledku anglicky

Distributed computing, heavily relying on the presence of data at the proper place and time, have further raised demands for coordination of data movement on the road towards achieving high performance. Although there exist several sophisticated and efficient point-to-point data transfer tools, the lack of global planners and decision makers, answering questions such as ``How and from which sources to bring the required dataset to the user?'', is for most part lacking. We present our work and status ofthe development of an automated data planning, ensuring fairness and efficiency of data movement by focusing on the minimal time to realize data movement (delegating the data transfer itself to existing transfer tools). Its principal keystones are self-adaptation to the network/service alteration, optimal selection of transfer channels, bottlenecks avoidance and user fair-share preservation. The planning mechanism relies on Constraint Programming and Mixed Integer Programming techniques.

Druh

D - Stať ve sborníku

CEP obor

BC - Teorie a systémy řízení

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2010

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

Doktorandské dny 2010

ISBN

978-80-01-04644-9

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

—

Název nakladatele

Česká technika - nakladatelství ČVUT

Místo vydání

Praha

Místo konání akce

Praha

Datum konání akce

19. 11. 2010

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

CST - Celostátní akce

Kód UT WoS článku

—