Search Spaces for Min-Perturbation Repair

Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbation repair problem: a standard, difference-based search space, and a new, commitment-based search space. Empirical results with exact search algorithms for a mincost virtual machine reassignment problem, a minimal perturbation repair problem related to server consolidation in data centers, show that the commitment-based search space can be significantly more efficient.

• Type: Conference
• Year: 2009
• Where: CP
• Authors: Alex S. Fukunaga
• Keywords: Commitment-based Search Space, CP 2009, Minimal Perturbation Repair, Perturbation Repair Problem, Programming Languages