Name
Abstract | ||
|---|---|---|
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 theorem-prover. 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 e-Commerce site as an example, and provide results on the complexity and time required to solve for the configuration of such an application. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30184-4_14 | LECTURE NOTES IN COMPUTER SCIENCE |
Keywords | Field | DocType |
configuration management,utility computing,theorem prover,constraint satisfaction problem,e commerce,object oriented,constraint satisfaction | Constraint satisfaction,Software deployment,Object-oriented programming,Computer science,Automated theorem proving,Constraint satisfaction problem,Utility computing,Configuration management,Time complexity,Distributed computing | Conference |
Volume | ISSN | Citations |
3278 | 0302-9743 | 7 |
PageRank | References | Authors |
1.20 | 7 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tim Hinrichs | 1 | 10 | 2.18 |
| Nathaniel Love | 2 | 239 | 19.59 |
| Charles J. Petrie | 3 | 331 | 56.20 |
| Lyle Ramshaw | 4 | 177 | 56.31 |
| Akhil Sahai | 5 | 567 | 58.03 |
| sharad singhal | 6 | 1211 | 150.87 |