Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)
Munier, A., Hanen, C.: Using duplication for scheduling unitary tasks on m processors with unit communication delays. Theoret. Comput. Sci. 178, 119–127 (1997)
Papadimitriou, C., Yannakakis, M.: Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19, 322–328 (1990)
Serpanos, D.N., Georgiadis, L., Bouloutas, T.: MMPacking: A load and storage balancing algorithm for distributed multimedia servers. IEEE Transactions on Circuits and Systems for Video Technology 8(1), 13–17 (1998)
Shachnai, H., Tamir, T.: On two class-constrained versions of the multiple knapsack problem. Algorithmica 29, 442–467 (2001)
Shachnai, H., Tamir, T.: Noah Bagels - Some Combinatorial Aspects. In: International Conference on FUN with Algorithms (FUN), Isola d’Elba (June 1998)
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)
Wolf, J.L., Yu, P.S., Shachinai, H.: Disk load balancing for video-on-demand systems. ACM/Springer Multimedia Systems Journal 5(6), 358–370 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kimbrel, T., Steinder, M., Sviridenko, M., Tantawi, A. (2005). Dynamic Application Placement Under Service and Memory Constraints. In: Nikoletseas, S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427186_34
Download citation
DOI: https://doi.org/10.1007/11427186_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25920-6
Online ISBN: 978-3-540-32078-4
eBook Packages: Computer ScienceComputer Science (R0)