International Business Machines Corporation

Google Inc.

Internationla Business Machines Corporation

Noshir Cavas Wadia

Peng Ye

Michael Ignatowski

Jayashree Subrahmonia

Renato John Recio

Lance Warren Russell

Joseph L Hellerstein

Gregory Francis Pfister

Maheswaran Surendra

Todd W Mummert

Mukund Raghavachari

Steven E Froehlich

Luis J Ostdiek

Marcus Aurelius Tylutki

Edwin Richie Lassettre

Lawrence S Hsiung

David Wiley Coleman

Lawrence Shun-mok Hsiung

Balakrishna Raghavendra Iyer

Daniel Manuel Dias

Rahul Jain

Asit Dan

Dikran S Meliksetian

James Thomas Rayfield

Qi He

Avraham Leff

Richard Pervin King

Hansjorg Zeller

Enzo Cialini

Harold Hershey Hall, Jr

Laura Myers Haas

Catherine Cuong Diep

Matthew Wang

Rekha Devi Garapati

Allen William Luniewski

Cynthia Ferne Craine

Todd William Mummert

For profiling and reusing software development assets, an apparatus includes an asset repository that stores assets, and functional and performance descriptions corresponding to each asset. The apparatus further includes a service planning module configured to interpret functional requirement(s) for a target application, and at least one service quality element corresponding to the functional requirement(s). The target application may be an internet-based application, and the functional requirements may be functions performed by software elements. The apparatus further includes a deployment module configured to compare the functional requirements with the stored assets to generate a solution plan. The solution plan may be a group of assets configured to perform the functional requirement(s) for the target application.

Reusing software development assets

Automated or autonomic techniques for managing deployment of one or more resources in a computing environment based on varying workload levels. The automated techniques may comprise predicting a future workload level based on data associated with the computing environment. Then, an estimation is performed to determine whether a current resource deployment is insufficient, sufficient, or overly sufficient to satisfy the future workload level. Then, one or more actions are caused to be taken when the current resource deployment is estimated to be insufficient or overly sufficient to satisfy the future workload level. Actions may comprise resource provisioning, resource tuning and/or admission control.

Managing computing deployment in presence of variable workload

An on-demand manager provides an improved distributed data processing system for facilitating dynamic allocation of computing resources among multiple domains based on a current workload and service level agreements. Based on a service level agreement, the on-demand manager monitors and predicts the load on the system. If the current or predicted load cannot be handled with the current system configuration, the on-demand manager determines additional resources needed to handle the workload. If the service level agreement violations cannot be handled by reconfiguring resources at a domain, the on-demand manager sends a resource request to other domains. These other domains analyze their own commitments and may accept the resource request, reject the request, or counter-propose with an offer of resources and a corresponding service level agreement. Once the requesting domain has acquired resources, workload load balancers are reconfigured to allocate some of the workload from the requesting site to the acquired remote resources.

Method for supporting transaction and parallel application workloads across multiple domains based on service level agreements

Techniques are provided for automating allocation of resources based on business decisions. An impact of a business decision is quantified in terms of information technology (IT) metrics. The resources that may be needed to address the impact are estimated. The estimated resources are provisioned.

Integrating performance, sizing, and provisioning techniques with a business process

A computer system determines an optimal hardware system environment for a given set of workloads by allocating functionality from each workload to logical partitions, where each logical partition includes resource demands, assigning a priority weight factor to each resource demand, configuring potential hardware system environments, where each potential hardware system environment provides resource capacities, and computing a weighted sum of least squares metric for each potential hardware system environment.

Computer program product and method for capacity sizing virtualized environments

Techniques are provided for allocating resources. Performance metrics for a transaction are received. It is determined whether one or more service level objectives are being violated based on the received performance metrics. In response to determining that the one or more service level objectives are being violated, additional resources are allocated to the transaction. In response to allocating the additional resources, a resource allocation event is published.

Peer to peer resource negotiation and coordination to satisfy a service level objective

An apparatus, system, and method are disclosed for provisioning database resource within a grid database system. The apparatus comprises an analysis module and a provision module. The analysis module analyzes a data query stream from an application to a database instance and determines that the data query stream exhibits a predetermined performance attribute. The provision module provisions a database resource in response to a determination that the data query stream exhibits the predetermined performance attribute. The provisioned database resource may be a database instance, a database server, or a cache. The provisioning of the new database resource advantageously is substantially transparent to a client on the database system.

Apparatus, system, and method for database provisioning

An apparatus is provided for modeling queuing systems with highly variable traffic arrival rates. The apparatus includes means to associate a value with a pattern of highly variable arrival rates that is simple and intuitive, and a means to accurately model queuing delays in systems that are characterized by bursts of arrival activity. The queuing delay is determined by a sum of queuing delays after first applying a weighting factor to the queuing delay based upon a random arrival rate, and a different weighting factor to the queuing delay based upon a bursty variable arrival rate. The weighting factors are variants of the server utilization. The model facilitates specification of server characteristics and configurations to meet response time metrics.

Apparatus for modeling queueing systems with highly variable traffic arrival rates

An apparatus, system, and method are disclosed for controlling a processing system. The apparatus to control a processing system is provided with a plurality of modules configured to functionally execute the necessary steps of controlling a processing system. These modules in the described embodiments include a data acquisition module that acquires performance data for a processing system, a data analysis module that calculates the slope between adjacent data points, a data normalization module that normalizes the data and computes a second order difference between the calculated slopes, a performance analysis module that determines the performance value that corresponds to the maximum calculated slope, a performance comparison module that sets a preferred performance threshold, and a performance control module that controls the processing system to achieve the preferred performance threshold.

Apparatus, system, and method for controlling a processing system

Provided are a method, system, and program for distributing application transactions among work servers. Application transaction rates are determined for a plurality of applications supplying transactions to process. For each application, available partitions in at least one server are assigned to process the application transactions based on partition transaction rates of partitions in the servers. For each application, a determination is made of weights for each server including partitions assigned to the application based on a number of partitions in the server assigned to the application. The determined weights for each application are used to distribute application transactions among the servers including partitions assigned to the application.

Method, system, and program for distributing application transactions among work servers

The present invention discloses a method, system and article of manufacture for autonomic identification of an optimum hardware configuration for a Web infrastructure. A plurality of performance objectives and a plurality of best practice rules for the Web infrastructure are established first. Then, a search space and a current configuration performance index within the search space are established. Next, a database of available hardware models is searched for a best-fit configuration based on the established plurality of best practice rules and the established current configuration performance index. The performance data of the found best-fit configuration is calculated using a performance simulator and then compared to the established plurality of performance objectives. If the calculated performance data meet the established plurality of performance objectives, then the best-fit configuration is designated as the optimum hardware configuration. Otherwise, the search space is narrowed and searching is continued until such optimum hardware configuration is found.

Autonomic computing algorithm for identification of an optimum configuration for a web infrastructure

A method are provided for modeling queuing systems with highly variable traffic arrival rates. The method includes a means to associate a value with a pattern of highly variable arrival rates that is simple and intuitive, and a means to accurately model queuing delays in systems that are characterized by bursts of arrival activity. The queuing delay is determined by a sum of queuing delays after first applying a weighting factor to the queuing delay based upon a random arrival rate, and a different weighting factor to the queuing delay based upon a bursty variable arrival rate. The weighting factors are variants of the server utilization. The model facilitates specification of server characteristics and configurations to meet response time metrics.

Apparatus and method for modeling queueing systems with highly variable traffic arrival rates

Methods and apparatus for managing computing deployment in presence of variable workload

The present invention discloses a method, system and article of manufacture for performing analytic modeling on a computer system by handling a plurality of predefined system criteria directed to a modeled computer system. The present invention provides means for the user of an analytic model to specify (i.e. enable) any number of predefined system criteria that must all be simultaneously satisfied. The modeling methodology uses a variation of the well-known Mean Value Analysis technique in its calculations. Response times, resource utilizations, and resource queue lengths are initially estimated for a small user arrival rate. An iterative method is used to gradually increase the user arrival rate by a constant value. For each iteration, response times, resource utilizations, and resource queue lengths are calculated. Then for all the criteria, which have been enabled, it is checked to see if the value limits specified for those criteria have exceeded. If not, the model calculation results are saved and next iteration is started. The model iterations continue with a gradually increasing user arrival rate until one or more of the modeling criteria are exceeded. At that time the model outputs the results from the previous iteration (i.e. the saved results where all the criteria were still satisfied), and the modeling calculations are finished. The model results may be used as input for further processing.

Method, system and article of manufacture for an analytic modeling technique for handling multiple objectives

An apparatus and method for distributed intersystem lock optimization are provided. With the apparatus and method of the present invention, the time required to obtain an uncontested lock, meaning a lock that no other program or process in the distributed system is simultaneously attempting to acquire, is minimized. The apparatus and method of the present invention increases the speed with which locks are acquired by splitting the process of obtaining a lock into two separate operations: a test for contention, and then if contention exists, a full lock operation. The test for contention is made fast by associating each lock with a memory location, and using an atomic operation or the like, to atomically set the memory location associated with the lock to a different value. If the lock is found to be contested, meaning that another program or process has already locked it, control is turned over to a slower operation than ensures that the lock-requesting program or process will eventually be granted the lock.

Growing community of inventors

Morgan Hill, CA, United States of America

Noshir Cavas Wadia