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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	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. 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. (en)
Title	Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science (en)
skos:prefLabel	Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science (en)
skos:notation	RIV/61389005:_____/10:00435931!RIV15-GA0-61389005
http://linked.open...avai/riv/aktivita	I P Z
http://linked.open...avai/riv/aktivity	I, P(GA201/07/0205), P(GA202/07/0079), P(LC07048), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Šumbera, Michal Zerola, Michal
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Ústav jaderné fyziky AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	256399
http://linked.open...ai/riv/idVysledku	RIV/61389005:_____/10:00435931
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Constraint Programming technique; CP model (en)
http://linked.open.../riv/klicoveSlovo	CP model Constraint Programming technique
http://linked.open...ontrolniKodProRIV	[7003965D24F3]
http://linked.open...v/mistoKonaniAkce	Prague
http://linked.open...i/riv/mistoVydani	Bristol
http://linked.open...i/riv/nazevZdroje	Journal of Physics Conference Series
http://linked.open...in/vavai/riv/obor	BG
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Study of nucleus-nucleus and proton-proton collisions at RHIC Dynamic aspects of scheduling Centre for Physics of Ultra-relativistic Nuclear Collissions
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Šumbera, Michal Barták, R. Zerola, Michal Lauret, J.
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000295102000268
http://linked.open.../riv/zahajeniAkce	2009-05-21 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
issn	1742-6588
number of pages	10 (xsd:int)
http://bibframe.org/vocab/doi	10.1088/1742-6596/219/6/062069
http://purl.org/ne...btex#hasPublisher	IOP Publishing Ltd

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software