Using Constraint Programming to Plan Efficient Data Movement on the Grid

摘要

Efficient data transfers and placements are paramount to optimizing geographically distributed resources and minimizing the time data intensive experimentsȁ9;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.