In this paper, we describe an approach for automatically generating configurations for complex applications. Automated generation of system configurations is required to allow large-scale deployment of custom applications within utility computing environments. Our approach models the configuration management problem as an Object-Oriented Constraint Satisfaction Problem (OOCSP) that can be solved efficiently using a resolution-based theoremprover. We outline the approach and discuss both the benefits of the approach as well as its limitations, and highlight certain unresolved issues that require further work. We demonstrate the viability of this approach using an eCommerce site as an example, and provide results on the complexity and time required to solve for the configuration of such an application. © IFIP International Federation for Information Processing 2004.
CITATION STYLE
Hinrich, T., Love, N., Petrie, C., Ramshaw, L., Sahai, A., & Singhal, S. (2004). Using object-oriented constraint satisfaction for automated configuration generation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3278, 159–170. https://doi.org/10.1007/978-3-540-30184-4_14
Mendeley helps you to discover research relevant for your work.