| Patent application number | Description | Published |
|---|
| 20080270199 | METHODS AND APPARATUS FOR MANAGEMENT OF HETEROGENEOUS WORKLOADS - Systems and methods for managing a system of heterogeneous workloads are provided. Work that enters the system is separated into a plurality of heterogeneous workloads. A plurality of high-level quality of service goals is gathered. At least one of the plurality of high-level quality of service goals corresponds to each of the plurality of heterogeneous workloads. A plurality of control functions are determined that are provided by virtualizations on one or more containers in which one or more of the plurality of heterogeneous workloads run. An expected utility of a plurality of settings of at least one of the plurality of control functions is determined in response to the plurality of high-level quality of service goals. At least one of the plurality of control functions is exercised in response to the expected utility to effect changes in the behavior of the system. | 10-30-2008 |
| 20100042721 | Dynamic application placement with allocation restrictions, vertical stacking and even load distribution - A solution to a variant of a class constrained multiple knapsack problem. Previous solutions require that memory demand of every application be identical and do not consider minimizing placement changes. Previous techniques do not consider optimizing placement to improve load balancing as is described subsequently. Thus, the present invention provides systems, methods and apparatus, encapsulated in software, to provide the dynamic placement of application instances on a heterogeneous cluster of server machines. It depends on the existence of a visible and controllable platform, systems management and other business services that signal events and accept commands. It provides dynamically placing applications on servers such as to maximize a total amount of satisfied application demands, minimize a number of placement changes from a current placement, and minimize imbalance of load distribution of said applications on said at least one server. | 02-18-2010 |
| 20100223379 | COORDINATING SERVICE PERFORMANCE AND APPLICATION PLACEMENT MANAGEMENT - Coordinating tasks of performance management and application placement management in a dynamic fashion by: estimating capacity needs for various service classes of service requests; computing desired capacities of at least one application for said service requests; deciding whether the desired capacities are satisfied by a current application placement; making no change to current application placement if the desired capacities are satisfied; determining a new application placement based on the desired capacities and a projected load if the desired capacities are not satisfied; computing corresponding capacity constraints for all pairs of service classes and servers; and computing an optimal allocation of capacities among the service classes so as to optimize a quality of service. | 09-02-2010 |
| 20110004735 | METHOD AND APPARATUS FOR TWO-PHASE STORAGE-AWARE PLACEMENT OF VIRTUAL MACHINES - Techniques for placement of a virtual machine in a computing system. A first request is sent from a pool management subsystem to a placement subsystem. The first request includes specification of available storage capacities of storage systems in a computer network. The placement subsystem automatically determines a target storage system based, at least in part, on the available storage capacities. An identification of the target storage system is received at the pool management subsystem. At least one disk image of the virtual machine is written to the target storage system. Then, a second request is sent to the placement subsystem. The placement subsystem automatically determines a target computer. The latter determination is based, at least in part, on connectivity between the target computer and the target storage system. The virtual machine is installed at the target computer. The techniques facilitate live migration of virtual machines placed thereby. | 01-06-2011 |
| 20110296429 | SYSTEM AND METHOD FOR MANAGEMENT OF LICENSE ENTITLEMENTS IN A VIRTUALIZED ENVIRONMENT - A management system and method for a virtualized environment includes a computer entity having a usage limitation based on an entitlement. A resource manager, using a processor and programmed on and executed from a memory storage device, is configured to manage resources in a virtualized environment. An entitlement-usage module is coupled to the resource manager and is configured to track entitlement-related constraints in accordance with changes in the virtualized environment to permit the resource manager to make allocation decisions which include the entitlement-related constraints to ensure that the usage limitation is met for the computer entity. | 12-01-2011 |
| 20120222042 | MANAGEMENT OF HETEROGENEOUS WORKLOADS - Systems and methods for managing a system of heterogeneous workloads are provided. Work that enters the system is separated into a plurality of heterogeneous workloads. A plurality of high-level quality of service goals is gathered. At least one of the plurality of high-level quality of service goals corresponds to each of the plurality of heterogeneous workloads. A plurality of control functions are determined that are provided by virtualizations on one or more containers in which one or more of the plurality of heterogeneous workloads run. An expected utility of a plurality of settings of at least one of the plurality of control functions is determined in response to the plurality of high-level quality of service goals. At least one of the plurality of control functions is exercised in response to the expected utility to effect changes in the behavior of the system. | 08-30-2012 |
| Patent application number | Description | Published |
|---|
| 20080216088 | Coordinating service performance and application placement management - Apparatus, systems and methods for service and/or business for coordinating tasks of performance management and application placement management in a dynamic fashion. An example process is dynamic in the face of fluctuations in the request load to the distributed computer system and the periodic adjustments to the placement of applications onto servers in said distributed computer system. There are two opposite functional flows in said process: a demand estimation function and a capacity adjustment function. The coordination system involves two subsystems: a demand estimator and a capacity adjuster, along with appropriate interfaces to of the performance manager and the application placement manager. This results in application placement process reacting quicker to demand fluctuations, performance guarantees are better met by rearranging the resources to be allocated to the various classes of service, and the management system works in an unsupervised mode, thus reducing manual administration costs and human errors. | 09-04-2008 |
| 20080282267 | Dynamic Application Instance Placement in Data Center Environments - Techniques are disclosed for determining placements of application instances on computing resources in a computing system such that the application instances can be executed thereon. By way of example, a method for determining an application instance placement in a set of machines under one or more resource constraints includes the following steps. An estimate is computed of a value of the first metric that can be achieved by a current application instance placement and a current application load distribution. A new application instance placement and a new application load distribution are determined, wherein the new application instance placement and the new load distribution optimize the first metric. | 11-13-2008 |
| 20090157855 | DECENTRALIZED APPLICATION PLACEMENT FOR WEB APPLICATION MIDDLEWARE - A decentralized process to ensure 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. | 06-18-2009 |
| 20090254660 | SYSTEMS AND METHODS FOR COORDINATED MANAGEMENT OF POWER USAGE AND RUNTIME PERFORMANCE IN PERFORMANCE-MANAGED COMPUTING ENVIRONMENTS - Systems and methods are provided for dynamically controlling application placement and server resource allocation in a distributed system wherein a performance manager and power manager collaborate during run-time execution of data processing tasks to coordinate management and control of workload placement and server usage and dynamically determine a tradeoff between performance level and power usage that meets power and performance objectives | 10-08-2009 |
| 20090254909 | Methods and Apparatus for Power-aware Workload Allocation in Performance-managed Computing Environments - An exemplary method of allocating a workload among a set of computing devices includes obtaining at least one efficiency model for each device. The method also includes, for each of a set of allocations of the workload among the devices, determining, for each device, the power consumption for the device to perform the workload allocated to the device by the allocation, the power consumption being determined based on the at least one efficiency model for each device; and determining a total power consumption of the devices. The method also includes selecting an allocation of the workload among the devices based at least in part on the total power consumption of the devices for each allocation. The method also includes implementing the selected allocation of the workload among the devices. | 10-08-2009 |
| 20110173245 | DISTRIBUTION OF INTERMEDIATE DATA IN A MULTISTAGE COMPUTER APPLICATION - A method, system and computer program product for distributing intermediate data of a multistage computer application to a plurality of computers. In one embodiment, a data manager calculates data usage demand of generated intermediate data. A computer manager calculates a computer usage, which is the sum of all data usage demand of each stored intermediate data at the computer. A scheduler selects a target computer from the plurality of computers for storage of the generated intermediate data at such that a variance of the computer usage demand across the plurality of computers is minimized. | 07-14-2011 |
| 20110173410 | EXECUTION OF DATAFLOW JOBS - A method, system and computer program product for storing data in memory. An example system includes at least one multistage application configured to generate intermediate data in a generating stage of the application and consume the intermediate data in a subsequent consuming stage of the application. A runtime profiler is configured to monitor the application's execution and dynamically allocate memory to the application from an in-memory data grid. | 07-14-2011 |
| 20120173734 | Dynamic Application Placement Under Service and Memory Constraints - 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. | 07-05-2012 |
| 20120278578 | COST-AWARE REPLICATION OF INTERMEDIATE DATA IN DATAFLOWS - Described herein are methods, systems, apparatuses and products for cost-aware replication of intermediate data in dataflows. An aspect provides receiving at least one measurement indicative of a reliability cost associated with executing a dataflow; computing a degree of replication of at least one intermediate data set in the dataflow based on the reliability cost; and communicating at least one replication factor to at least one component of a system responsible for replication of the at least one intermediate data set in the dataflow; wherein the at least one intermediate data set is replicated according to the replication factor. Other embodiments are disclosed. | 11-01-2012 |
