Dynamic Application Placement Under Service and Memory Constraints

  • Tracy Kimbrel
  • Malgorzata Steinder
  • Maxim Sviridenko
  • Asser Tantawi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3503)


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.


Feasible Solution Memory Requirement Knapsack Problem Service Capacity Utilization Factor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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
  2. 2.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)zbMATHGoogle Scholar
  3. 3.
    Munier, A., Hanen, C.: Using duplication for scheduling unitary tasks on m processors with unit communication delays. Theoret. Comput. Sci. 178, 119–127 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Papadimitriou, C., Yannakakis, M.: Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19, 322–328 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Shachnai, H., Tamir, T.: On two class-constrained versions of the multiple knapsack problem. Algorithmica 29, 442–467 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 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. 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
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Tracy Kimbrel
    • 1
  • Malgorzata Steinder
    • 1
  • Maxim Sviridenko
    • 1
  • Asser Tantawi
    • 1
  1. 1.IBM T.J. Watson Research CenterYorktown Heights

Personalised recommendations