Dynamic application placement under service and memory constraints

a dynamic placement and memory constraint technology, applied in the direction of multi-programming arrangements, program control, instruments, etc., can solve the problems of cluster directly affecting the amount of load that the cluster can sustain without performance degradation, and the size and complexity of computing service centers have increased, so as to achieve the effect of fine granularity of resource allocation

Inactive Publication Date: 2006-10-26
IBM CORP
View PDF12 Cites 139 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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 re...

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 c...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Dynamic application placement under service and memory constraints
  • Dynamic application placement under service and memory constraints
  • Dynamic application placement under service and memory constraints

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

Problem Formulation

[0022] The invention is implemented in a system as generally illustrated in FIG. 1. This system comprises a cluster of servers 101, 102, 103 and 104 across which application clusters 111, 112 and 113 are distributed. These application clusters are designated by the letters “A”, “B” and “C” running on the several servers. Thus, application cluster “A” is running on servers 101 and 102 and application cluster “C” is running on servers 103 and 104, while application cluster “B” is running on all four servers. It will of course be understood by those skilled in the art that four servers and three application clusters are used here for illustrative purposes only and that, in practice, there may be any number of servers and any number of application clusters. Requests for specific ones of the application clusters from various clients (not shown) are received by a request router 12 and directed to the appropriate application cluster, as shown in FIG. 1.

[0023] As will b...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F9/46
CPCG06F9/5083G06F9/5066
Inventor KIMBREL, TRACY JAYSTEINDER, MALGORZATASVIRIDENKO, MAXIMTANTAWI, ASSER NASRELDIN
Owner IBM CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products