Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science

0435931 - ÚJF 2015 RIV GB eng C - Conference Paper (international conference)
Zerola, Michal - Lauret, J. - Barták, R. - Šumbera, Michal
Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science.
Journal of Physics Conference Series. Vol. 219. Bristol: IOP Publishing Ltd, 2010 - (Gruntorad, J.; Lokajíček, M.), 062069. ISSN 1742-6588.
[17th International Conference on Computing in High Energy and Nuclear Physics (CHEP). Prague (CZ), 21.05.2009-27.05.2009]
R&D Projects: GA MŠMT LC07048; GA ČR GA202/07/0079
Institutional support: RVO:61389005
Keywords : Constraint Programming technique * CP model
Subject RIV: BG - Nuclear, Atomic and Molecular Physics, Colliders

For the past decade, HENP experiments have been heading towards a distributed computing model in an effort to concurrently process tasks over enormous data sets that have been increasing in size as a function of time. In order to optimize all available resources (geographically spread) and minimize the processing time, it is necessary to face also the question of efficient data transfers and placements. A key question is whether the time penalty for moving the data to the computational resources is worth the presumed gain. Onward to the truly distributed task scheduling we present the technique using a Constraint Programming (CP) approach. The CP technique schedules data transfers from multiple resources considering all available paths of diverse characteristic (capacity, sharing and storage) having minimum user's waiting time as an objective. We introduce a model for planning data transfers to a single destination (data transfer) as well as its extension for an optimal data set spreading strategy (data placement). Several enhancements for a solver of the CP model will be shown, leading to a faster schedule computation time using symmetry breaking, branch cutting, well studied principles from job-shop scheduling field and several heuristics.
Permanent Link: http://hdl.handle.net/11104/0239795