Search spaces for min-perturbation repair

Authors:
Alex S. Fukunaga
Affiliations:
Global Edge Institute, Tokyo Institute of Technology, Meguro, Tokyo, Japan
Venue:
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Year:
2009

Citing 10
Cited 2

Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
Solution reuse in dynamic constraint satisfaction problems

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Probe Backtrack Search for Minimal Perturbation in DynamicScheduling

Constraints
The load rebalancing problem

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Beyond Server Consolidation

Queue - Virtualization
A Two Stage Heuristic Algorithm for Solving the Server Consolidation Problem with Item-Item and Bin-Item Incompatibility Constraints

SCC '08 Proceedings of the 2008 IEEE International Conference on Services Computing - Volume 2
Solution-guided multi-point constructive search for job shop scheduling

Journal of Artificial Intelligence Research
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Improved limited discrepancy search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Minimal perturbation problem in course timetabling

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling

Bin repacking scheduling in virtualized datacenters

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
An energy aware framework for virtual machine placement in cloud federated data centres

Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.