Application placement through multiple allocation domain agents and flexible cloud scheduler framework

Patent metadata

Field	Value
Publication number	US-10326649-B2
Application number	US-201514802825-A
Country	US
Kind code	B2
Filing date	Jul 17, 2015
Priority date	Nov 14, 2014
Publication date	Jun 18, 2019
Grant date	Jun 18, 2019

Abstract

There are provided a method for operating a cloud computing infrastructure. In one embodiment, the method performs allocation domain modeling and provides a cloud scheduler framework that takes as input desired optimization objectives and the workload constraints and efficiently produces a placement solution that satisfies the constraints while optimizing the objectives in a way that adjusts itself depending on the objectives. As the objectives change, e.g., due to actions from system administrators or due to changes in business policies, the system optimizes itself accordingly and still produces efficient and optimized placement solutions. The method constructs an Allocation Domain (AD) that is a particular facet for allocating a logical entity to a physical entity. An AD is created using: variables, functional definitions (functions of variables), and a policy specification that includes a Boolean expression (of the functional definitions).

First claim

What is claimed is:

1. A method for operating a cloud computing system, the method comprising:
receiving a user application request having one or more user specified objectives and allocation constraints, wherein the user application request specifying requirements for placing logical entities on physical entities in a computing infrastructure, and each allocation constraint corresponds to an allocation domain being used in the placing of the logical entities to the physical entities, and the allocation domains are created based on a set of primitive variables, a set of functional definitions for the set of primitive variables, a policy specification for the set of functional definitions, and at least one post-allocation change to the set of primitive variables;
generating one or more bias weights for each allocation domain, wherein each bias weight for each allocation domain indicates an importance of the allocation domain in accommodating the user application request, and generation of the bias weights is based on a use of a domain expert for mapping components of the objective function to a set of biasing functions;
computing a probability distribution using said bias weights, said bias weights increasing likelihood of generating an optimized placement solution;
generating, using said computed biased probability distribution in accordance with the user specified objectives, a set of candidate placement solutions that satisfy the one or more user specified objectives and allocation constraints;
comparing each candidate placement solution with the allocation constraints;
identifying an optimized placement solution among the set of candidate placement solutions based on the comparison of each candidate placement solution with the allocation constraint; and
dynamically reconfiguring the computing infrastructure by allocating the logical entities in the request to the physical entities based on said optimized placement solution,
wherein a programmed process device performs one of said receiving, said bias weight generating, said computing, said sample placement solution generating, said obtaining, said optimizing and said reconfiguring.

2. The method according to claim 1 , wherein identifying the optimized placement solution comprises using an objective function evaluation process that satisfies combined user objectives and constraints given a current state of resources in said computing infrastructure.

3. The method according to claim 2 , further comprising:
iteratively repeating said probability distribution computing using said bias weights; and adjusting, at each iteration, said bias weights to generate more optimized placement solutions at each successive iteration.

4. The method according to claim 3 , wherein said adjusting bias weights comprises:
maintaining a set of variables, a variable representing a state of PE resources and an objective for placing a logical entity on a physical entity;
specifying one or more objective functions using said variables set, a function defining a condition for allocating an LE to a PE based on a current state of said computing infrastructure; and
creating a biasing function related to the objective function and the current infrastructure state.

5. The method according to claim 4 , wherein identifying the optimized placement solution comprises:
minimizing a scalar objective function comprising a combination of received objective functions, each weighted with a respective weight obtained by an importance-based sampling method and a respective biasing weight applied to each objective function.

6. The method according to claim 4 , wherein a user objective comprises one or more of:
a load balancing objective, a network communications overhead minimizing objective, a software licensing minimization cost, and a physical proximity deviation minimizing objective; said bias function comprising one or more of:
a load balance biasing function associated with distributing a load based on the load balancing objective;
a network traffic biasing function associated with placement of communicating virtual machines close to each other to avoid networking traffic;

a software license sharing biasing function associated with increasing license sharing to minimize a software licensing cost objective; and
a location proximity biasing function for minimizing a deviation from location user preferences related to placement of virtual entities with respect to each other.

7. The method according to claim 5 , further comprising creating a bias weight using a semi-supervised learning system that automatically generates random placement solutions using parameterized biasing functions, calculates corresponding values of the objective function; and continuously adjusts parameters of the biasing functions so as to generate one or more optimal placement solutions.

8. The method according to claim 2 , further comprising:
constructing an allocation domain (AD) corresponding to each received user specified allocation constraint, each AD representing a particular allocation of a LE to a PE in a placement solution in said computing infrastructure;
dynamically creating an allocation policy specific to an allocation domain; and
evaluating the generated placement solution against an allocation policy corresponding to each said one or more allocation domains for a particular received application request to ensure compliance of said allocated constraints in said cloud infrastructure.

9. A method for operating a cloud computing system, the method comprising:
receiving a user application request having one or more user specified objectives and allocation constraints, said request specifying one or more requirements for placing logical entities (LE) on physical entities (PE) in a computing infrastructure;
constructing an allocation domain (AD) corresponding to each received user specified allocation constraint, each AD representing a particular allocation of a LE to a PE; wherein the AD is created using: a set of primitive variables, a set of functional definitions for the set of primitive variables, a policy specification for the set of functional definitions, and at least one post-allocation change to the set of primitive variables;
creating an allocation policy for each allocation domain;
generating a set of candidate placement solutions that satisfy the user specified objectives and allocation constraints, wherein generation of the candidate placement solutions is based on a biased probability distribution associated with bias weights for each allocation domain;
evaluating each said generated candidate placement solution against the allocation policy corresponding to each allocation domain for the received application request to assess compliance of said allocated constraints in said cloud infrastructure;
using the assessed compliance to identify an optimized placement solution from the evaluation among each candidate placement solution with the allocation policy, wherein the identified optimized placement solution satisfies the user specified objectives and allocation constraints; and
wherein a programmed process device performs one of said receiving, constructing, creating, and evaluating.

10. The method as in claim 9 , wherein said constructing an allocation domain comprises one or more of:
creating and modifying one or more variables for said AD, each variable representing a state of PE resources and an allocation constraint for placing a LE on a PE;
specifying one or more functions using said one or more AD variables, a function defining a condition for allocating an LE to a PE based on a current state of said computing infrastructure.

11. The method as in

Assignees

• IBM

Inventors

• Steinder Malgorzata
• Tantawi Asser N

Classifications

• H04L41/0813 Primary

  characterised by the conditions triggering a change of settings · CPC title

• H04L41/0823

  characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability (for optimising operational conditions of wireless networks H04W24/02) · CPC title

• G06Q10/10

  Office automation; Time management · CPC title

• G06N7/01

  Probabilistic graphical models, e.g. probabilistic networks · CPC title

• H04L47/783

  Distributed allocation of resources, e.g. bandwidth brokers · CPC title