| Patent application number | Description | Published |
|---|
| 20080216098 | SYSTEMS, METHODS AND COMPUTER POROGRAMS FOR DETERMINING DEPENDENCIES BETWEEN LOGICAL COMPONENTS IN A DATA PROCESSING SYSTEM OR NETWORK - Described are methods, apparatus and computer programs for determining run-time dependencies between logical components of a data processing environment. Components of the data processing environment are monitored by monitoring agents accessing run-time activity data via APIs of the managed system. A dependency generator identifies correlations between the run-time activity of the monitored components. For synchronous monitored systems, the dependency generator calculates an activity period for monitored components and determines which component's activity periods contain the activity periods of other components. Containment is used as an indicator of a likely dependency relationship, and a weighting is computed for each dependency relationship based on the consistency of containment. | 09-04-2008 |
| 20080294946 | System and Method for Problem Determination Using Dependency Graphs and Run-Time Behavior Models - A problem determination system and method reduces the time and effort required by system administrators to trouble shot transaction processing difficulties in a large distributed I/T environment by monitoring system component performance and computing operational performance threshold limits based on dependency graphs for the system. Using this data, a prioritized list of suspect components for the I/T system is generated. | 11-27-2008 |
| 20090132555 | METHOD FOR VISUALISATION OF STATUS DATA IN AN ELECTRONIC SYSTEM - A method is disclosed for facilitating visualisation of status data in an electronic system. The status data comprises metadata including a plurality of information context categories. The status data also comprises data nodes, each data node including specific instances of a respective context category. The method starts with selecting possible data combinations and permutations of the information context categories, each permutation defining a respective hierarchy. For each permutation, information content of data for each node of the respective hierarchy is estimated and an informative tree and total entropy for all informative nodes are found. The permutation and the informative tree that has the lowest total entropy are then presented to the user. | 05-21-2009 |
| 20100005173 | Method, system and computer program product for server selection, application placement and consolidation - A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins. The bin packing problem develops the recommended server configuration based on reducing a total acquisition cost while satisfying the constraints and the sizes of the applications. | 01-07-2010 |
| 20100011102 | METHOD FOR PLACING COMPOSITE APPLICATIONS IN A FEDERATED ENVIRONMENT - Techniques for placing at least one composite application in a federated environment are provided. The techniques include analyzing a composite application to be deployed in a federated environment, obtaining one or more application artifacts, analyzing feasibility of placing one or more application components at one or more clusters in the federated environment without knowledge of resource availability at each of the one or more clusters, and generating a mapping of the one or more application components to the one or more clusters such that an application requirement is met, wherein the one or more application artifacts are distributed across a federated environment. | 01-14-2010 |
| 20100033485 | METHOD FOR VISUALIZING MONITORING DATA - Techniques for visualizing monitoring data are provided. The techniques include generating at least one context from the monitoring data based on a user-provided schema definition, mapping the data from a high dimensional space to a lower dimensional subspace using a topology preserving mapping, organizing the mapped data into a three-dimensional space to allow dynamic selection of a context resolution level across a hierarchy of the at least one context, using the mapped data to identify at least one trend in the data, wherein identifying the at least one trend comprises observing one or more changes over time in one or more activation patterns for each of the at least one context, and visualizing the at least one quantified trend in the data. | 02-11-2010 |
| 20100050179 | LAYERED CAPACITY DRIVEN PROVISIONING IN DISTRIBUTED ENVIRONMENTS - Techniques are disclosed for providing mapping of application components to a set of resources in a distributed environment using capacity driven provisioning using a layered approach. By way of example, a method for allocating resources to an application comprises the following steps. A first data structure is obtained representing a post order traversal of a dependency graph for the application and associated containers with capacity requirements. A second data structure is obtained representing a set of resources, and associated with each resource is a tuple representing available capacity. A mapping of the dependency graph data structure to the resource set is generated based on the available capacity such that resources of the set of resources are allocated to the application. | 02-25-2010 |
| 20100058334 | METHOD AND SYSTEM FOR POLICY BASED LIFECYCLE MANAGEMENT OF VIRTUAL SOFTWARE APPLIANCES - A system and method for managing dynamically allocated resources assigned to a service includes providing a service to be used by a plurality of sites in a federation. Usage information associated with the service is communicated to each of the plurality of sites. A disposition of the service is determined based on local policies and the usage information received from other sites by a service owner. The disposition of the service is updated across a plurality of sites in accordance with messages sent by the service owner to reduce resource usage. | 03-04-2010 |
| 20100180275 | TECHNIQUES FOR PLACING APPLICATIONS IN HETEROGENEOUS VIRTUALIZED SYSTEMS WHILE MINIMIZING POWER AND MIGRATION COST - N applications are placed on M virtualized servers having power management capability. A time horizon is divided into a plurality of time windows, and, for each given one of the windows, a placement of the N applications is computed, taking into account power cost, migration cost, and performance benefit. The migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for the given one of the windows. The N applications are placed onto the M virtualized servers, for each of the plurality of time windows, in accordance with the placement computed in the computing step for each of the windows. In an alternative aspect, power cost and performance benefit, but not migration cost, are taken into account; there are a plurality of virtual machines; and the computing step includes, for each of the windows, determining a target utilization for each of the servers based on a power model for each given one of the servers; picking a given one of the servers with a least power increase per unit increase in capacity, until capacity has been allocated to fit all the virtual machines; and employing a first fit decreasing bin packing technique to compute placement of the applications on the virtualized servers. | 07-15-2010 |
| 20110016339 | Dynamic Selection of Server States - Techniques for dynamically selecting a server state for one or more servers in a cluster of servers are provided. The techniques include tracking each active and sleep state of each server in a cluster of servers, and selecting a server state for one or more servers in the cluster of servers to meet one or more workload level requirements of the cluster of servers, wherein selecting a server state for one or more servers comprises scheduling a transition between one or more active and sleep states for the one or more servers, wherein scheduling the transition comprises using power consumption information for each state and transition time information for each transition. | 01-20-2011 |
| 20110161470 | Method, System and Computer Program Product for Server Selection, Application Placement and Consolidation Planning of Information Technology Systems - A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins. The bin packing problem develops the recommended server configuration based on reducing a total acquisition cost while satisfying the constraints and the sizes of the applications. | 06-30-2011 |
