Model for planning of distributed data production
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00081689" target="_blank" >RIV/00216224:14330/15:00081689 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Model for planning of distributed data production
Original language description
We propose a model of distributed data production, where input files from a single source are processed at several remote sites (each file once) and output is transferred back. The model is formulated using a network flow maximization approach and allowsplanning of data transfers and scheduling of CPU loads and disk storages. This class of problems can be solved in polynomial time using known algorithms. Such an approach enables automated online planning and optimization which are highly demanded in data intensive computational fields such as High Energy and Nuclear Physics.
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
MISTA 2015 - Proceedings of the 7th Multidisciplinary International Conference on Scheduling: Theory and Applications
ISBN
—
ISSN
2305-249X
e-ISSN
—
Number of pages
5
Pages from-to
699-703
Publisher name
MISTA
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
—