Dynamic application placement under service and memory constraints

Abstract

An optimization problem models the dynamic placement of applications on servers under two types of simultaneous resource requirements, those that are dependent on the loads placed on the applications and those that are 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.

Description

BACKGROUND OF THE INVENTION [0001] 1. Field of the Invention [0002] The present invention is directed to the optimization of dynamic placement of computing applications on servers to satisfy all the applications demand while changing the assignment of applications as little as possible. [0003] 2. Background Description [0004] With the proliferation of the World Wide Web (WWW or simply the “Web”) and outsourcing of data services, computing service centers have increased in both size and complexity. Such centers provide a variety of services; for example, Web content hosting, e-commerce, Web applications, and business applications. Managing such centers is challenging since a service provider must manage the quality of service provided to competing applications in the face of unpredictable load intensity and distribution among the various offered services and applications. Several management software packages which deal with these operational management issues have been introduced. Th...

AI Technical Summary

Benefits of technology

[0017] The present invention extends the capabilities of application server middleware with the ability to dynamically provision enterprise applications. Compared to traditional techniques, the invention allows fine granularity of resource allocation to applications. In the present invention we model the decision process for dynamic placement of applications under two or more simultaneous resource requirements: some that are dependent on the loads placed on the applications and some that are 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 model the decision process as an optimization problem. We design an algorithm to solve this optimization problem.

Problems solved by technology

With the proliferation of the World Wide Web (WWW or simply the “Web”) and outsourcing of data services, computing service centers have increased in both size and complexity.

Managing such centers is challenging since a service provider must manage the quality of service provided to competing applications in the face of unpredictable load intensity and distribution among the various offered services and applications.

The problem is to dynamically change the number of application instances so as to satisfy the dynamic load while minimizing the overhead of starting and stopping application instances.

Therefore, when application instances use different servers, the size of a cluster directly impacts the amount of load that the cluster can sustain without performance degradation.

When the size of a cluster is insufficient, the application users experience performance degradation or failures, resulting in the violation of Service Level Agreements (SLA).

This results in poor resource utilization during normal operation conditions.

The approach is wasteful when an application demand is not sufficient to utilize an entire server.

This results in wasted server capacity, as an application must execute on all servers in the cluster even if its workload could be satisfied by a subset of the servers in the cluster.

This reconfiguration process may be time-consuming and therefore cannot be performed frequently, which results in lower responsiveness to workload changes.

Images