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 min-cost 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Vogels, W.: Beyond server consolidation. ACM Queue 6(1) (2008)
Gupta, R., Bose, S., Sundarrajan, S., Chebiyam, M., Chakrabarti, A.: A two-stage heuristic algorithm for solving the server consolidation problem. In: IEEE Int. Conf. on Services Computing (2008)
Ajiro, Y.: Recombining virtual machines to autonomically adapt to load changes. In: Proc. 22nd Conf. of the Japanese Society for Artificial Intelligence (2008)
Aggarwal, G., Motwani, R., Zhu, A.: The load rebalancing problem. In: Proc. 15th ACM Symp. on parallel algorithms and architectures, pp. 258–265 (2003)
Korf, R.: Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence 27(1), 97–109 (1985)
Ran, Y., Roos, N., van den Herik, H.: Approaches to find a near-minimal change solution for dynamic CSPs. In: Proc. CPAIOR, pp. 378–387 (2002)
Fukunaga, A.: Search algorithms for minimal cost repair problems. In: Proc. CP/ICAPS 2008 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (2008)
Ajiro, Y.: NEC System Platform Research Labs. Personal Communication (2009)
Beck, C.: Solution-guided multi-point constructive search for job shop scheduling. Journal of Artificial Intelligence Research 29, 49–77 (2007)
Verfaillie, G., Schiex, T.: Solution reuse in dynamic constraint satisfaction problems. In: Proc. AAAI, Seattle, Washington, pp. 307–312 (1994)
El-Sakkout, H., Wallace, M.: Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 5, 359–388 (2000)
Barták, R., Müller, T., Rudová, H.: A new approach to modeling and solving minimal perturbation problems. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds.) CSCLP 2003. LNCS (LNAI), vol. 3010, pp. 233–249. Springer, Heidelberg (2004)
Müller, T., Rudová, H., Barták, R.: Minimal perturbation in course timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 126–146. Springer, Heidelberg (2005)
Harvey, W., Ginsberg, M.: Limited discrepancy search. In: Proc. IJCAI, pp. 607–615 (1995)
Korf, R.: Improved limited discrepancy search. In: Proc. AAAI, pp. 286–291 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fukunaga, A.S. (2009). Search Spaces for Min-Perturbation Repair. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)