A scalable application placement controller for enterprise data centers

Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each application and where to put them, while observing all kinds of resource constraints. This NP hard problem has real usage in commercial middleware products. Existing approximation algorithms for this problem can scale to at most a few hundred machines, and may produce placement solutions that are far from optimal when system resources are tight. In this paper, we propose a new algorithm that can produce within 30 seconds high-quality solutions for hard placement problems with thousands of machines and thousands of applications. This scalability is crucial for dynamic resource provisioning in large-scale enterprise data centers. Our algorithm allows multiple applications to share a single machine, and strives to maximize the total satisfied application demand, to minimize the number of application starts and stops...

• Type: Conference
• Year: 2007
• Where: WWW
• Authors: Chunqiang Tang, Malgorzata Steinder, Mike Spreitzer, Giovanni Pacifici
• Keywords: Application Placement Controller, Internet Technology, Keywords Application Placement, Satisfied Application Demand, WWW 2007