This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n9http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n20http://localhost/temp/predkladatel/
n18http://purl.org/net/nknouf/ns/bibtex#
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n21http://linked.opendata.cz/ontology/domain/vavai/
n17https://schema.org/
n13http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F09%3A00207232%21RIV10-GA0-11320___/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n22http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F09%3A00207232%21RIV10-GA0-11320___
rdf:type
n21:Vysledek skos:Concept
dcterms:description
Efficient data transfers and placements are paramount to optimizing geographically distributed resources and minimizing the time data intensive experimentss processing tasks would take. We present a technique for planning data transfers to single destination using a Constraint Programming approach. We study enhancements of the model using symmetry breaking, branch cutting, well studied principles from scheduling field, and several heuristics. Real-life wide area network characteristic is explained and the realization of the computed formal schedule is proposed with an emphasis on bandwidth saturation. Results will include comparison of performance and trade-off between CP techniques and Peer-2-Peer model. Efficient data transfers and placements are paramount to optimizing geographically distributed resources and minimizing the time data intensive experimentss processing tasks would take. We present a technique for planning data transfers to single destination using a Constraint Programming approach. We study enhancements of the model using symmetry breaking, branch cutting, well studied principles from scheduling field, and several heuristics. Real-life wide area network characteristic is explained and the realization of the computed formal schedule is proposed with an emphasis on bandwidth saturation. Results will include comparison of performance and trade-off between CP techniques and Peer-2-Peer model.
dcterms:title
Using Constraint Programming to Plan Efficient Data Movement on the Grid Using Constraint Programming to Plan Efficient Data Movement on the Grid
skos:prefLabel
Using Constraint Programming to Plan Efficient Data Movement on the Grid Using Constraint Programming to Plan Efficient Data Movement on the Grid
skos:notation
RIV/00216208:11320/09:00207232!RIV10-GA0-11320___
n3:aktivita
n12:P n12:Z
n3:aktivity
P(1M0545), P(GA201/07/0205), Z(MSM0021620838)
n3:dodaniDat
n16:2010
n3:domaciTvurceVysledku
n5:8318573
n3:druhVysledku
n6:D
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
347974
n3:idVysledku
RIV/00216208:11320/09:00207232
n3:jazykVysledku
n22:eng
n3:klicovaSlova
Using; Constraint; Programming; Efficient; Movement; Grid
n3:klicoveSlovo
n8:Movement n8:Grid n8:Using n8:Efficient n8:Constraint n8:Programming
n3:kontrolniKodProRIV
[D88141EA20B9]
n3:mistoKonaniAkce
Los Alamitos
n3:mistoVydani
Los Alamitos
n3:nazevZdroje
Proceedings of The 21st IEEE International Conference on Tools with Artificial Intelligence
n3:obor
n19:JC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
4
n3:projekt
n15:GA201%2F07%2F0205 n15:1M0545
n3:rokUplatneniVysledku
n16:2009
n3:tvurceVysledku
Lauret, Jerome Šumbera, Michal Zerola, Michal Barták, Roman
n3:typAkce
n9:WRD
n3:zahajeniAkce
2009-01-01+01:00
n3:zamer
n13:MSM0021620838
s:numberOfPages
5
n18:hasPublisher
IEEE Computer Society
n17:isbn
978-0-7695-3920-1
n20:organizacniJednotka
11320