Dynamic Application Placement Under Service and Memory Constraints
In this paper we consider an optimization problem which models the dynamic placement of applications on servers under two simultaneous resource requirements: one that is dependent on the loads placed on the applications and one that is independent. The demand (load) for applications changes over time and the goal is to satisfy all the demand while changing the solution (assignment of applications to servers) as little as possible. We describe the system environment where this problem arises, present a heuristic algorithm to solve it, and provide an experimental analysis comparing the algorithm to previously known algorithms. The experiments indicate that the new algorithm performs much better. Our algorithm is currently deployed in the IBM flagship product Websphere.
KeywordsFeasible Solution Memory Requirement Knapsack Problem Service Capacity Utilization Factor
Unable to display preview. Download preview PDF.
- 1.Kangasharju, J., Roberts, J., Ross, K.W.: Object replication strategies in content distribution networks. In: 6th Int’l Workshop on Web Content Caching and Distribution (WCW), Boston, MA (2001)Google Scholar
- 7.Shachnai, H., Tamir, T.: Noah Bagels - Some Combinatorial Aspects. In: International Conference on FUN with Algorithms (FUN), Isola d’Elba (June 1998)Google Scholar
- 8.Turgeon, A., Snell, Q., Clement, M.: Application placement using performance surfaces. In: Proceedings of the Ninth International Symposium on High-Performance Distributed Computing, Pittsburgh, PA, August 2000, pp. 229–236 (2000)Google Scholar