DocumentCode :
2860956
Title :
Using Constraint Programming to Plan Efficient Data Movement on the Grid
Author :
Zerola, Michal ; Sumbera, M. ; Bartak, Roman ; Lauret, Jérôme
Author_Institution :
Nucl. Phys. Inst., ASCR, Rez, Czech Republic
fYear :
2009
fDate :
2-4 Nov. 2009
Firstpage :
729
Lastpage :
733
Abstract :
Efficient data transfers and placements are paramount to optimizing geographically distributed resources and minimizing the time data intensive experiments´s 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.
Keywords :
constraint handling; electronic data interchange; grid computing; scheduling; bandwidth saturation; branch cutting; constraint programming approach; data transfers; formal schedule; geographically distributed resources; grid data movement; peer-2-peer model; symmetry breaking; Artificial intelligence; Astronomy; Bandwidth; Computer networks; Constraint optimization; Laboratories; Large-scale systems; Nuclear physics; Processor scheduling; Wide area networks; data transfer; grid; planning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Tools with Artificial Intelligence, 2009. ICTAI '09. 21st International Conference on
Conference_Location :
Newark, NJ
ISSN :
1082-3409
Print_ISBN :
978-1-4244-5619-2
Electronic_ISBN :
1082-3409
Type :
conf
DOI :
10.1109/ICTAI.2009.80
Filename :
5366039
Link To Document :
بازگشت